A persistence-based approach to automatic detection of line segments in images

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Edge detection algorithms usually produce a discrete set of edgels (edge pixels) in a given image on a fixed pixel grid. We consider the harder problem of detecting continuous straight line segments at subpixel resolution. The state-of-the art Line Segment Detection Algorithm (LSDA) outputs unordered line segments whose total number cannot be easily controlled. Another motivation to improve the LSDA is to avoid intersections and small angles between line segments, hence difficulties in higher level tasks such as segmentation or contour extraction. The new Persistent Line Segment Detector (PLSD) outputs only non-intersecting line segments and ranks them by a strength, hence the user can choose a number of segments. The main novelty is an automatic selection of strongest segments along any straight line by using the persistence from Topological Data Analysis. The experiments on the Berkeley Segmentation Database of 500 real-life images show that the new algorithm outperforms the LSDA on the important measure of Boundary Recall.

Cite

CITATION STYLE

APA

Kurlin, V., & Muszynski, G. (2019). A persistence-based approach to automatic detection of line segments in images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11382 LNCS, pp. 137–150). Springer Verlag. https://doi.org/10.1007/978-3-030-10828-1_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free