Detection and Extraction of Discontinuous Lines

A new algorithm for detecting and extracting discontinuous lines is presented against the shortcomings of the usual method for lines extraction. Firstly almost all of the line segments were acquired by the means of Hough transform, and then the line segments were grouped by the method of improved dynamic clustering algorithm. The improvement of the dynamic clustering algorithm are the initial cluster is based on the method of the standardized pattern transform and a kernel of every class replaces the centre of the class as the patterns of every class obey the norm distribution. In the next step the line segments belong to the same group are fitted into possible longer lines and the long lines' existence is further defined by judging whether the total number of marginal points in the neighbourhood of the lines is large enough or not. At last, the redundant lines are also excluded by the means of dynamic clustering algorithm. Experiments demonstrate that the proposed algorithm is valid.

[1]  LU Yu-ming,et al.  Fit Line Using A Method Combined Hough Transform With Least Square , 2003 .

[2]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Ardeshir Goshtasby,et al.  On the Canny edge detector , 2001, Pattern Recognit..

[4]  Li Quan Probability Model of Randomized Hough Transform: Limited Data , 2002 .

[5]  Milan Sonka,et al.  Image Processing, Analysis and Machine Vision , 1993, Springer US.

[6]  Ma Chun-guang A New 2-D Line Clipping Algorithm , 2001 .

[7]  Hungwen Li,et al.  Fast Hough transform: A hierarchical approach , 1986, Comput. Vis. Graph. Image Process..

[8]  Josef Kittler,et al.  The Adaptive Hough Transform , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.