Abstract
It is demonstrated that the idea of grouping together features that satisfy a geometric relationship can be used, both for (automatic) detection and estimation of vanishing points and lines. We describe the geometry of three commonly occurring types of geometric grouping and present efficient grouping algorithms, which exploit these geometries. The three types of grouping are: (1) a family of equally spaced coplanar parallel lines; (2) a planar pattern obtained by repeating some element by translation in the plane; and (3) a set of elements arranged in a regular planar grid. Examples of automatically computing groupings, together with their vanishing points and lines, are given for a number of real images.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
