A potential-based approach for shape matching and recognition

This paper presents a novel potential-based approach for recognizing the shape of a two-dimensional (2D) region by identifying the best match from a selected group of shape templates. The proposed model assumes that the border of every 2D region is uniformly charged. An initially small shape template placed inside a shape sample will experience the repulsive force and torque arising from the potential field. A better match in the shape between the template and the sample can be obtained if the template translates and reorients itself to reduce the potential while growing in size. The shape template with the largest final size corresponds to the best match and represents the shape of the given sample. The potential and the associated repulsive force and torque between the polygonal contours are analytically tractable, hence resulting in high computational efficiency of the matching process. The proposed approach is intrinsically invariant under translation, rotation and size changes of the shape sample. Moreover, not only can the matching be carried out directly for shape contours at different viewscales, but the contours can also be unconnected, provided that the template is confined within the shape sample throughout the matching process.

[1]  Naonori Ueda,et al.  Learning Visual Models from Shape Contours Using Multiscale Convex/Concave Structure Matching , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Ralph Roskies,et al.  Fourier Descriptors for Plane Closed Curves , 1972, IEEE Transactions on Computers.

[3]  S. S. Reddi,et al.  Radial and Angular Moment Invariants for Image Identification , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  King-Sun Fu,et al.  Shape Discrimination Using Fourier Descriptors , 1977, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Jia-Guu Leu Computing a shape's moments from its boundary , 1991, Pattern Recognit..

[6]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Larry S. Davis,et al.  A Corner-Finding Algorithm for Chain-Coded Curves , 1977, IEEE Transactions on Computers.

[8]  Filson H. Glanz,et al.  An Autoregressive Model Approach to Two-Dimensional Shape Classification , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Rama Chellappa,et al.  Stochastic models for closed boundary analysis: Representation and reconstruction , 1981, IEEE Trans. Inf. Theory.

[10]  Maurice Maes,et al.  Polygonal shape recognition using string-matching techniques , 1991, Pattern Recognit..

[11]  Ming-Kuei Hu,et al.  Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[12]  Chin-Chen Chang,et al.  A shape recognition scheme based on relative distances of feature points from the centroid , 1991, Pattern Recognition.

[13]  Alejandro Blumenkrans,et al.  Two-dimensional object recognition using a two-dimensional polar transform , 1991, Pattern Recognit..

[14]  Wen-Hsiang Tsai,et al.  Attributed String Matching with Merging for Shape Recognition , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  P. Rummel,et al.  Workpiece recognition and inspection by a model-based scene analysis system , 1984, Pattern Recognit..

[16]  L. N. Kanal,et al.  A Bivariate Autoregressive Modeling Technique for Analysis and Classification of Planar Shapes , 1990 .

[17]  Olivier D. Faugeras,et al.  HYPER: A New Approach for the Recognition and Positioning of Two-Dimensional Objects , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  W. A. Perkins,et al.  A Model-Based Vision System for Industrial Parts , 1978, IEEE Transactions on Computers.

[19]  S. Maitra Moment invariants , 1979, Proceedings of the IEEE.

[20]  Manohar Das,et al.  A Bivariate Autoregressive Technique for Analysis and Classification of Planar Shapes , 1990, IEEE Trans. Pattern Anal. Mach. Intell..