Fast line and rectangle detection by clustering and grouping
- 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
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.
Unable to display preview. Download preview PDF.