HOME JOURNALS CONTACT

Journal of Applied Sciences

Year: 2013 | Volume: 13 | Issue: 18 | Page No.: 3736-3741
DOI: 10.3923/jas.2013.3736.3741
A Fast Three-Phase Line Segments Clustering Method Based on Relative Spatial Relationship
Y.Q. Liu, X.H. Su and E.H. Wu

Abstract: Lines indicate structure information of objects. However, the general line detectors cannot give enough clear information with many short or discontinuous line segments. This study presents a new fast three-phase line segment clustering algorithm. Firstly, Hough transform or LSD algorithm is used to attain initial line set; and then these lines are grouped into different sets according to direction; and then each direction set is further subdivided into different sub-sets according to their relative distances; finally the lines are merged or split on the basis of their neighborhood relations to form the final groups. Compared to previous work, the present method is more efficient and easier to implement. More importantly, the clustered line segments can fully indicate the structure information of targets in the image which is verified by the experiments.

Fulltext PDF

How to cite this article
Y.Q. Liu, X.H. Su and E.H. Wu, 2013. A Fast Three-Phase Line Segments Clustering Method Based on Relative Spatial Relationship. Journal of Applied Sciences, 13: 3736-3741.

Keywords: Line segment clustering, structure feature, distance, direction and merging or splitting

REFERENCES
  • Bazin, J.C., Y. Seo, C. Demonceaux, P. Vasseur, K. Ikeuchi, I. Kweon and M. Pollefeys, 2012. Globally optimal line clustering and vanishing point estimation in manhattan world. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, June 16-21, 2012, Providence, RI., USA., pp: 638-645.

  • Canny, J., 1986. A computational approach to edge detection. IEEE Trans. Pattern Anal. Mach. Intell., 8: 679-698.
    CrossRef    Direct Link    

  • Gong, M.G., S. Wang, M. Ma, Y. Cao, L.C. Jiao and W.P. Ma, 2011. Two-phase clustering algorithm for complex distributed data. J. Software, 22: 2760-2772.
    CrossRef    Direct Link    

  • Hough, P.V.C., 1962. A method and means for recognizing complex patterns. US Patent Number, 3069654.

  • Jang, J.H. and K.S. Hong, 2002. Fast line segment grouping method for finding globally more favorable line segments. Pattern Recogn., 35: 2235-2247.
    CrossRef    

  • Jonk, A. and A.W. Smeulders, 1995. An axiomatic approach to clustering line-segments. Proceedings of the 3rd International Conference on Document Analysis and Recognition, Volume 1, August 14-16, 1995, Montreal, Canada, pp: 386-389.

  • Kostas, K.V., A.I. Ginnis and P.D. Kaklis, 2004. A scan-line algorithm for clustering line segments. Proceedings of the Conference on Shape Modeling Applications, June 7-9, 2004, Genova, Italy, pp: 379-392.

  • Nacken, P.F.M., 1993. A metric for line segments. IEEE Trans. Pattern Anal. Mach. Intell., 15: 1312-1318.
    CrossRef    

  • Park, D.C., 2010. Hierarchical clustering of 3-D line segments for building detection. Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, December 15-18, 2010, Luxor, Egypt, pp: 388-393.

  • Von Gioi, R.G., J. Jakubowicz, J.M. Morel and G. Randall, 2010. LSD: A fast line segment detector with a false detection control. IEEE Trans. Pattern Anal. Mach. Intell., 32: 722-732.
    CrossRef    

    • © Science Alert. All Rights Reserved