Pattern matching of 2‐D shape using hierarchical descriptions

1 January 1991

journal article
research article
Published by Wiley in Systems and Computers in Japan

Vol. 22 (10) , 40-49
https://doi.org/10.1002/scj.4690221005

Abstract

This 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.

Keywords

PATTERN MATCHING

This publication has 9 references indexed in Scilit:

Planar shape matching based on binary tree shape representation
Pattern Recognition, 1988
A process-grammar for shape
Artificial Intelligence, 1988
Scaling Theorems for Zero Crossings
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1986
Uniqueness of the Gaussian Kernel for Scale-Space Filtering
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1986
An Autoregressive Model Approach to Two-Dimensional Shape Classification
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
The Curvature Primal Sketch
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
Codon constraints on closed 2D shapes
Computer Vision, Graphics, and Image Processing, 1985
Strip trees: a hierarchical representation for curves
Communications of the ACM, 1981