Abstract
The authors describe the advantages of the hierarchical implementation of the Hough transform with respect to the labelled one. They demonstrate that the hierarchical Hough is faster than the labelled Hough if simple conditions are satisfied. They then discuss the automatic construction of the hierarchical models for the objects belonging to a completely known set. These models can be seen as oriented graphs whose nodes represent local features or patterns which are subparts of the object silhouette. Some experimental results are presented. >
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.
