Issue No. 02 - February (1993 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.192485
<p>The problem of recognizing and localizing objects that can vary in parameterized ways is considered. To achieve this goal, a concept of parameterized point pattern is introduced to model parameterized families of such objects, and a parameterized point pattern matching algorithm is proposed. A parameterized point pattern is a very flexible concept that can be used to model a large class of parameterized objects, such as a pair of scissors with rotating blades. The proposed matching algorithm is formulated as a tree search procedure, and it generates all maximum matchings satisfying a condition called delta -boundedness. Several pruning methods based on the condition of delta -boundedness and their efficient computing techniques are given. The proposed matching algorithm is applied to a real shape matching problem in order to check the validity of the approach.</p>
pattern matching; object families; parameterized point pattern; tree search procedure; delta -boundedness; pruning methods; shape matching problem; pattern recognition; search problems; trees (mathematics)
S. Umeyama, "Parameterized Point Pattern Matching and Its Application to Recognition of Object Families," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 15, no. , pp. 136-144, 1993.