Share Email Print

Proceedings Paper • new

A novel line segment detection algorithm based on graph search
Author(s): Hong-dan Zhao; Guo-ying Liu; Xu Song
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

To overcome the problem of extracting line segment from an image, a method of line segment detection was proposed based on the graph search algorithm. After obtaining the edge detection result of the image, the candidate straight line segments are obtained in four directions. For the candidate straight line segments, their adjacency relationships are depicted by a graph model, based on which the depth-first search algorithm is employed to determine how many adjacent line segments need to be merged. Finally we use the least squares method to fit the detected straight lines. The comparative experimental results verify that the proposed algorithm has achieved better results than the line segment detector (LSD).

Paper Details

Date Published: 19 February 2018
PDF: 6 pages
Proc. SPIE 10608, MIPPR 2017: Automatic Target Recognition and Navigation, 106080I (19 February 2018); doi: 10.1117/12.2285324
Show Author Affiliations
Hong-dan Zhao, Anyang Normal Univ. (China)
Guo-ying Liu, Anyang Normal Univ. (China)
Xu Song, Anyang Normal Univ. (China)

Published in SPIE Proceedings Vol. 10608:
MIPPR 2017: Automatic Target Recognition and Navigation
Jianguo Liu; Jayaram K. Udupa; Hanyu Hong, Editor(s)

© SPIE. Terms of Use
Back to Top