ESTIMATION OF CURVE SIMILARITY USING TURNING FUNCTIONS

The process of classifying objects is a fundamental feature of most human pursuits, and the idea that people classify together those things that people find similar is both intuitive and popular across a wide range of disciplines. Estimation of difference between curves (curve matching) is an useful and often necessary technique in many applications, including: pattern recognition, image object recognition, robotic applications, computational geometry, etc. In this paper, three methods for curve matching using turning functions are presented. While the first two, called plain and polygonal method, are based on a simple adaptation of the existing approaches, the third one, called penalty method, is a new one and tries to overcome some important problems from the first two. The advantages and essential problems of the proposed methods are also discussed. A number of examples are presented to show major differences among the methods and their potential usefulness. AMS Subject Classification: 68T45, 68T10

[1]  Jose A. Ventura,et al.  Optimal matching of general polygons based on the minimum zone error , 1995, Pattern Recognit. Lett..

[2]  Noel E. O'Connor,et al.  Efficient contour-based shape representation and matching , 2003, MIR '03.

[3]  Haim J. Wolfson,et al.  A new method of estimating shape similarity , 1996, Pattern Recognit. Lett..

[4]  Nikolaos Papanikolopoulos,et al.  Planar shape recognition by shape morphing , 2000, Pattern Recognit..

[5]  Richard A. Volz,et al.  Recognizing Partially Occluded Parts , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Theodosios Pavlidis.  The Use of a Syntactic Shape Analyzer for Contour Matching , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Esther M. Arkin,et al.  An efficiently computable metric for comparing polygonal shapes , 1991, SODA '90.

[8]  MiliosEvangelos,et al.  Matching and Retrieval of Distorted and Occluded Shapes Using Dynamic Programming , 2002 .

[9]  Gary James Jason,et al.  The Logic of Scientific Discovery , 1988 .

[10]  Longin Jan Latecki,et al.  Shape Similarity and Visual Parts , 2003, DGCI.

[11]  A. Tversky.  Features of Similarity , 1977 .

[12]  Olivier D. Faugeras,et al.  Shape Matching of Two-Dimensional Objects , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[14]  B. John Oommen,et al.  A Geometrical Approach to Polygonal Dissimilarity and Shape Matching , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[16]  Haim J. Wolfson.  On curve matching , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  W. Quine.  Ontological Relativity and Other Essays , 1969 .

[18]  Po-Whei Huang,et al.  Planar shape recognition by directional flow-change method , 1999, Pattern Recognit. Lett..

[19]  Owen Robert Mitchell,et al.  Partial Shape Recognition Using Dynamic Programming , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Longin Jan Latecki,et al.  Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution , 1999, Comput. Vis. Image Underst..

[21]  Luciano da Fontoura Costa,et al.  Shape Analysis and Classification: Theory and Practice , 2000 .

[22]  Celso C. Ribeiro,et al.  Computing some distance functions between polygons , 1991, Pattern Recognit..

[23]  Hirobumi Nishida.  Model-Based Shape Matching with Structural Feature Grouping , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[24]  David Avis,et al.  A combinational approach to polygon similarity , 1983, IEEE Trans. Inf. Theory.

[25]  John P. Oakley,et al.  Hierarchical classification method and its application in shape representation , 1992, Electronic Imaging.