Abstract
AbstractThis paper introduces a system for hierarchical description of two‐dimensional shapes on the basis of scale space analysis. We propose a group of simple primitives for describing curved line segments; they are suitable for hierarchical analysis. To realize effective matching, nineteen rules are necessary and sufficient to derive a tree. The tree derived from the analysis yields the hierarchical structure of a shape and enables efficient matching of objects in a top‐down manner. An algorithm to create a compact database from trees is also shown. The sophisticated database is shown to be useful for recognizing objects by their category. Several examples showed that matching for skewed or occluded shapes can be done by searching for a subtree in the database.
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.
