logo
Select language

Journal of Computer Applications



Download

DOI: 10.3724/SP.J.1087.2008.00177

Journal of Computer Applications 2008/28 :1 PP.177-180

Graphics and image processing

Line detection based on Euclidean distance

SHANG Zhen-hong , FU Xiao-dong , YUAN Mei-yu , LIU Hui

Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, 650051, China



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.

Keywords: line detection  Euclidean distance  edge tracking  chain code 

Recieved: 2007-07-26 ; Accepted: 2007-09-27; Published Online: 2008-10-14

Corresponding Author: SHANG Zhen-hong (shangzhenhong@126.com)

Appraise