Effective shape contour extraction, and multiresolution representation and matching methods

In this paper we are going to present end to end algorithms that address curvature extraction, shape representation and shape similarity retrieval. Our novel shape contour tracing algorithm can trace open, ill-defined and closed shapes and return an ordered set of background points adjacent to the shape’s contour. Our shape descriptor builds a multi-resolution equal segmentation polygonal based shape representation that uses the center of the shape as a reference point and is invariant to scale, rotation and translation, and efficient in terms of time and space. The shape descriptor captures three contour primitives including distance and slope at regular intervals around the center. The dual stage novel shape matching algorithm works in two stages. The first is data driven and uses a shape signature metric to factor out dissimilar shapes while the second stage linearly scans the remaining shapes and measures the similarity using elasticity with a distance and a user-friendly fuzzy measure. We have applied our algorithms on the MPEG-7 shape core experiment and achieved the best result reported based on the number of queries. Our algorithms achieved 83.23% for the similarity test of part B where the optimized CSS shape descriptor came second at 81.12%.

[1]  Daphna Weinshall,et al.  Flexible Syntactic Matching of Curves and Its Application to Automatic Hierarchical Classification of Silhouettes , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  lawa Kanas,et al.  Metric Spaces , 2020, An Introduction to Functional Analysis.

[3]  Diane J. Cook,et al.  Learning Membership Functions in a Function-Based Object Recognition System , 1995, J. Artif. Intell. Res..

[4]  Azriel Rosenfeld,et al.  Digital geometry , 2002, JCIS.

[5]  T. Pavlidis Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[6]  Shuang Fan,et al.  Shape Representation and Retrieval Using Distance Histograms , 2001 .

[7]  Guojun Lu,et al.  Review of shape representation and description techniques , 2004, Pattern Recognit..

[8]  Keiichi Abe,et al.  Comparison of Methods for Detecting Corner Points from Digital Curves , 1995, GREC.

[9]  Geoff A. W. West,et al.  Nonparametric Segmentation of Curves into Various Representations , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Ronald Fagin,et al.  Relaxing the Triangle Inequality in Pattern Matching , 2004, International Journal of Computer Vision.

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

[12]  Hirobumi Nishida Matching And Recognition Of Deformed Closed Contours Based On Structural Transformation Models , 1998, Pattern Recognit..

[13]  Kevin W. Bowyer,et al.  GRUFF-3: Generalizing the domain of a function-based recognition system , 1994, Pattern Recognit..

[14]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

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

[16]  Paul L. Rosin Assessing the Behaviour of Polygonal Approximation Algorithms , 1998, BMVC.

[17]  Remco C. Veltkamp,et al.  On the Implementation of Polygonal Approximation Algorithms , 2003 .

[18]  Paul L. Rosin Techniques for Assessing Polygonal Approximations of Curves , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Euripides G. M. Petrakis,et al.  Shape retrieval based on dynamic programming , 2000, IEEE Trans. Image Process..

[20]  Sven Loncaric,et al.  A survey of shape analysis techniques , 1998, Pattern Recognit..

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

[22]  M. Brady Criteria for Representations of Shape , 1983 .

[23]  Miroslaw Bober,et al.  Curvature Scale Space Representation: Theory, Applications, and MPEG-7 Standardization , 2011, Computational Imaging and Vision.

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

[25]  Jia-Guu Leu,et al.  Polygonal approximation of 2-D shapes through boundary merging , 1988, Pattern Recognit. Lett..

[26]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.