Abstract
To detect lines in digital image, this paper proposed a new algorithm. Different form traditional line detection algorithms, the algorithm does not search another coordinate transformation, but defines the line degree of a point in a curve as the sum of k Euclidean distance square between points centered at the point, and deduces that except limited points in the head and tail, points in a line segment will have the maximum line degree. Derived from this characteristic, the new algorithm detects line segments in a two-pass manner. Firstly, the points on a curve that obviously belonged to a line segment were selected by using Freeman chain-code. Secondly, the points that were continuous and had the maximum line degree were selected. The result shows the algorithm is stable, precise and fast.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
