This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Flexible Syntactic Matching of Curves and Its Application to Automatic Hierarchical Classification of Silhouettes
December 1999 (vol. 21 no. 12)
pp. 1312-1328

Abstract—Curve matching is one instance of the fundamental correspondence problem. Our flexible algorithm is designed to match curves under substantial deformations and arbitrary large scaling and rigid transformations. A syntactic representation is constructed for both curves and an edit transformation which maps one curve to the other is found using dynamic programming. We present extensive experiments where we apply the algorithm to silhouette matching. In these experiments, we examine partial occlusion, viewpoint variation, articulation, and class matching (where silhouettes of similar objects are matched). Based on the qualitative syntactic matching, we define a dissimilarity measure and we compute it for every pair of images in a database of 121 images. We use this experiment to objectively evaluate our algorithm: First, we compare our results to those reported by others. Second, we use the dissimilarity values in order to organize the image database into shape categories. The veridical hierarchical organization stands as evidence to the quality of our matching and similarity estimation.

[1] N. Ansari and E. Delp, “Partial Shape Recognition: A Landmark Based Approach,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, pp. 470-489, 1990.
[2] E.M. Arkin, L.P. Chew, D.P. Huttenlocher, K. Kedem, and J.S.B. Mitchell, "An Efficiently Computable Metric for Comparing Polygonal Shapes," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, pp. 209-216, 1991.
[3] H. Asada and M. Brady, “The Curvature Primal Sketch,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, pp. 2-14, 1986.
[4] N. Ayache and O. Faugeras, “HYPER: A New Approach for the Recognition and Positioning of Two-Dimensional Objects,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 1, pp. 44-54, Jan. 1986.
[5] R. Basri, L. Costa, D. Geiger, and D. Jacobs, “Determining the Similarity of Deformable Shapes,” IEEE Workshop Physics Based Modeling in Computer Vision, pp. 135-143, 1995.
[6] B. Bhanu and O. Faugeras, “Shape Matching of Two Dimensional Objects,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 137-155, 1984.
[7] R. Bolles and R. Cain, “Recognizing and Locating Partially Visible Objects: The Focus Feature Method,” Int'l J. Robotics Research, vol. 1, pp. 57-81, 1982.
[8] A. Brint and M. Brady, “Stereo Matching of Curves,” Image and Vision Computing, vol. 8, pp. 50-56, 1990.
[9] W.J. Christmas, J. Kittler, and M. Petrou, “Structural Matching in Computer Vision Using Probabilistic Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749–764, Aug. 1995.
[10] I. Cohen, N. Ayache, and P. Sulger, “Tracking Points on Deformable Objects Using Curvature Information,” Proc. European Conf. Computer Vision, pp. 458-466, 1992.
[11] L. Davis, “Shape Matching Using Relaxation Techniques,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 1, pp. 60-72, 1979.
[12] A. del Bimbo and P. Pala, “Visual Image Retrieval by Elastic Matching of User Sketches,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 2, pp. 121-132, Feb. 1997.
[13] A. Dembo, S. Karlin, and O. Zeitouni, “Critical Phenomena for Sequence Matching with Scoring,” Annals of Probability, vol. 22, pp. 1,993-2,021, 1994.
[14] Y. Gdalyahu, D. Weinshall, and M. Werman, “Stochastic Image Segmentation by Typical Cuts,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, Fort Collins, Colo., 1999.
[15] D. Geiger, A. Gupta, L.A. Costa, and J. Vlontzos, Dynamical Programming for Detecting, Tracking and Matching Deformable Contours IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 3, pp. 294-302, Mar. 1995.
[16] J. Gorman, O. Mitchell, and F. Kuhl, “Partial Shape Recognition Using Dynamic Programming,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, pp. 257-266, 1988.
[17] J. Gregor and M. Thomason, “Dynamic Programming Alignment of Sequences Representing Cyclic Patterns,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, pp. 129-135, 1993.
[18] R. Horaud and T. Skordas, “Stereo Correspondence Through Feature Grouping and Maximal Cliques,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 1,168-1,180, 1989.
[19] D.P. Huttenlocher, G.A. Klanderman, and W.J. Rucklidge, “Comparing Images Using the Hausdorff Distance,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 850-863, Sept. 1993.
[20] D. Huttenlocher and S. Ullman, “Object Recognition Using Alignment,” Proc. Int'l Conf. Computer Vision, pp. 102-111, London, 1987.
[21] D.W. Jacobs, D. Weinshall, and Y. Gdalyahu, “Condensing Image Databases when Retrieval Is Based on Nonmetric Distances,” Proc. Sixth Int'l Conf. Computer Vision, Bombay, 1998.
[22] B. Kamger-Parsi, M. Margalit, and A. Rozenfeld, “Matching General Polygonal Arcs,” Computer Vision, Graphics, and Image Processing: Image Understanding, vol. 53, pp. 227-234, 1991.
[23] M.W. Koch and R.L. Kashyap, “Using Polygons to Recognize and Locate Partially Occluded Objects,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, no. 4, pp. 483-494, Apr. 1987.
[24] L.J. Latecki and R. Lakämper, “Shape Similarity Measure for Image Database of Occluding Contours,” Proc. Fourth IEEE Workshop Applications of Computer Vision, Princeton, N. J., Oct. 1998.
[25] Y. Lamdan, J.T. Schwartz, and H.J. Wolfson, "Affine invariant model-based object recognition," IEEE Trans. Robotics and Automation, vol. 6, pp. 578-589, 1990.
[26] S. Li, “Matching: Invariant to Translations, Rotations and Scale Changes,” Pattern Recognition, vol. 25, pp. 583-594, 1992.
[27] H. Liuand and M. Srinath, “Partial Shape Classification Using Contour Matching in Distance Transformation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, pp. 1,072-1,079, 1990.
[28] C. Lu and J. Dunham, “Shape Matching Using Polygon Approximation and Dynamic Alignment,” Pattern Recongition Letters, vol. 14, pp. 945-949, 1993.
[29] A. Marzal and E. Vidal, "Computation of Normalized Edit Distance and Applications," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 15, pp. 926-932, 1993.
[30] R. McConnell, R. Kwok, J. Curlander, W. Kober, and S. Pang, “$\Psi$-S Correlation and Dynamic Time Warping: Two Methods for Tracking Icefloes in SAR Images,” IEEE Trans. Geoscience and Remote Sensing, vol. 29, pp. 1,004-1,012, 1991.
[31] F. Mokhtarian and A. Mackworth,“Scale-based description and recognition of planar curbes and two-dimensional shapes,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 1, pp. 34-43, 1986.
[32] M. Pelillo, K. Siddiqi, and S. Zucker, “Matching Hierarchical structures Using Association Graphs,” Proc. European Conf. Computer Vision, pp. 3-16, 1998.
[33] J. Rocha and T. Pavlidis, "A Shape Analysis Model With Applications to a Character Recognition System," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, pp. 393-404, 1994.
[34] S. Sclaroff and A.P. Pentland, Modal Matching for Correspondence and Recognition IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 6, pp. 545-561, 1995.
[35] L.S. Shapiro and J.M. Brady, “Feature-Based Correspondence: An Eigenvector Approach,” Image and Vision Computing, vol. 10, pp. 283-288, 1992.
[36] D. Sharvit, J. Chan, H. Tek, and B. Kimia, “Symmetry Based Indexing of Image Databases,” J. Visual Comm. and Image Representation, 1998.
[37] A. Shokoufandeh, S.J. Dickinson, K. Siddiqi, and S.W. Zucker, “Indexing Using Spectral Encoding of Topological Structure,” Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, June 1999.
[38] K. Siddiqi, A. Shokoufandeh, S. Dickinson, and S. Zucker, “Shock Graphs and Shape Matching,” Proc. Int'l Conf. Computer Vision, pp. 222-229, 1998.
[39] G. Stockman, S. Kopstein, and S. Benett, “Matching Images to Models for Registration and Object Detection via Clustering,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 4, pp. 229-241, 1982.
[40] S. Tirthapura, D. Sharvit, P. Klein, and B. Kimia, “Indexing Based on Edit Distance Matching of Shape Graphs,” SPIE Proc. Multimedia Storage and Archiving Systems III, pp. 25-36, 1998.
[41] W. Tsai and S. Yu, “Attributed String Matching with Merging for Shape Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, pp. 453-462, 1985.
[42] Y. Tsay and W. Tsai, “Attributed String Matching by Split and Merge for On-Line Chinese Character Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, pp. 180-185, 1993.
[43] A. Tversky, “Features of Similarity,” Psychological Review, vol. 84, pp. 327-352, 1977.
[44] N. Ueda and S. Suzuki, "Learning Visual Models from Shape Contours Using Multiscale Convex/Concave Structure Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 4, pp. 337-352, Apr. 1995.
[45] S. Umeyama, "Parameterized Point Pattern Matching and its Application to Recognition of Object Families," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 2, pp. 136-144, 1993.
[46] Y. Wang and T. Pavlidis, “Optimal Correspondence of String Subsequences,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, pp. 1,080-1,086, 1990.
[47] D. Weinshall and M. Werman, “On View Likelihood and Stability,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, pp. 97-108, 1997.
[48] M. Werman and D. Weinshall, “Similarity and Affine Invariant Distances between 2D Point Sets,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 810-814, Aug. 1995.

Index Terms:
Curve matching, syntactic matching, image database, silhouettes.
Citation:
Yoram Gdalyahu, Daphna Weinshall, "Flexible Syntactic Matching of Curves and Its Application to Automatic Hierarchical Classification of Silhouettes," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 12, pp. 1312-1328, Dec. 1999, doi:10.1109/34.817410
Usage of this product signifies your acceptance of the Terms of Use.