We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Detecting local features, such as corners, segments or blobs, is the first step in the pipeline of many Computer Vision applications. Its speed is crucial for real-time applications. In this paper we present ELSED, the fastest line segment detector in the literature. The key for its efficiency is a local segment growing algorithm that connects gradient-aligned pixels in presence of small discontinuities. The proposed algorithm not only runs in devices with very low end hardware, but may also be parametrized to foster the detection of short or longer segments, depending on the task at hand. We also introduce new metrics to evaluate the accuracy and repeatability of segment detectors. In our experiments with different public benchmarks we prove that our method accounts the highest repeatability and it is the most efficient in the literature. In the experiments we quantify the accuracy traded for such gain.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2108.03144")
get_code_for_paper("2108.03144")
have("2108.03144")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2108.03144.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2108.03144)
Connect an agent — have() is free.