Fast line and rectangle detection by clustering and grouping

8Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Lagunovsky, D., & Ablameyko, S. (1997). Fast line and rectangle detection by clustering and grouping. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1296, pp. 503–510). Springer Verlag. https://doi.org/10.1007/3-540-63460-6_156

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free