Fast line and rectangle detection by clustering and grouping

  • Dmitry Lagunovsky
  • Sergey Ablameyko
Poster Session I

DOI: 10.1007/3-540-63460-6_156

Volume 1296 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Lagunovsky D., Ablameyko S. (1997) Fast line and rectangle detection by clustering and grouping. In: Sommer G., Daniilidis K., Pauli J. (eds) Computer Analysis of Images and Patterns. CAIP 1997. Lecture Notes in Computer Science, vol 1296. Springer, Berlin, Heidelberg

Abstract

Fast algorithms to detect lines and rectangles in grey-scale images are proposed. At first, a contour image is obtained by the modified edge detection scheme. The linear primitives are extracted in the contour image and joined into line segments by cluster analysis method. The line merging algorithm is developed to get straight lines from segments. Algorithm to detect rectangles from the extracted straight lines is suggested. The developed algorithms are fast and permit to get the qualitative result.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Dmitry Lagunovsky
    • 1
  • Sergey Ablameyko
    • 1
  1. 1.Institute of Engineering CyberneticsBelarussian Academy of SciencesMinskBelarus