This Article 
 Bibliographic References 
 Add to: 
Parameterized Point Pattern Matching and Its Application to Recognition of Object Families
February 1993 (vol. 15 no. 2)
pp. 136-144

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.

[1] H. Alt, K. Mehlhorn, H. Wagener, and E. Welzl, "Congruence, similarity and symmetries of geometric objects," inProc. ACM 3rd Ann. Comput. Geo. Conf., 1987, pp. 308-315.
[2] H. S. Baird,Model-Based Image Matching Using Location, Cambridge, MA: MIT Press, 1986.
[3] R. Brooks, "Symbolic reasoning among 3-dimensional models and 2- dimensional images,"Artificial Intell., vol. 17, pp. 285-349, 1981.
[4] P. C. Gaston and T. Lozano-Péres, "Tactile recognition and localization using object models: The case of polyhedra on a plane,"IEEE Trans. Part. Anal. Machine Intell., vol. PAMI-6, no. 3, pp. 257-266, May 1984.
[5] A. Goshtasby and G. Stockman, "Point pattern matching using convex hull edges,"IEEE Trans. Syst. Man Cybern., vol. SMC-15, no. 5, pp. 631-637, 1985.
[6] W. E. L. Grimson and T. Lozano-Péres, "Model-based recognition and localization from sparse range or tactile data,"Int. J. Robotics Res., vol. 3, no. 3, pp. 3-35, Fall 1984.
[7] W. E. L. Grimson, "Recognition of object families using parameterized models," inProc. of First Int. Conf. Comput. vision, 1987, pp. 93-101.
[8] D. Kahl, A. Rosenfeld, and A. Danker, "Some experiments in point pattern matching,"IEEE Trans. Syst. Man Cybern., vol. SMC-10, pp. 105-116, 1980.
[9] L. Kitchen, "Relaxation applied to matching quantitative relational structures,"IEEE Trans. Syst. Man Cybern., vol. SMC-10, no. 2, pp. 96-101, Feb. 1980.
[10] H. Ogawa, "Labeled point pattern matching by fuzzy relaxation,"Patt. Recogn., vol. 17, no. 5, pp. 569-573, 1984.
[11] N. Otsu, "A threshold selection method from grey-level histogram,"IEEE Trans. Syst. Man Cybern., vol. SMC-9, pp. 62-66, 1979.
[12] U. Ramer, "An iterative procedure for the polygonal approximation of plane curves,"Comput. Graphics Image Processing, vol. 1, pp. 244-256, 1972.
[13] S. Umeyama, "Least-squares estimation of transformation parameters between two point patterns,"IEEE Trans. Patt. Anal. Machine Intell., vol. 13, no. 4, pp. 376-380, Apr. 1991.
[14] A. K. C. Wong, "An algorithm for constellation matching," inProc. 8th Int. Conf. Patt. Recogn., 1986, pp. 546-554, vol. 1.

Index Terms:
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," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 15, no. 2, pp. 136-144, Feb. 1993, doi:10.1109/34.192485
Usage of this product signifies your acceptance of the Terms of Use.