This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Matching and Retrieval of Distorted and Occluded Shapes Using Dynamic Programming
November 2002 (vol. 24 no. 11)
pp. 1501-1516

Abstract—We propose an approach for matching distorted and possibly occluded shapes using Dynamic Programming (DP). We distinguish among various cases of matching such as cases where the shapes are scaled with respect to each other and cases where an open shape matches the whole or only a part of another open or closed shape. Our algorithm treats noise and shape distortions by allowing matching of merged sequences of consecutive small segments in a shape with larger segments of another shape, while being invariant to translation, scale, orientation, and starting point selection. We illustrate the effectiveness of our algorithm in retrieval of shapes on two data sets of two-dimensional open and closed shapes of marine life species. We demonstrate the superiority of our approach over traditional approaches to shape matching and retrieval based on Fourier descriptors and moments. We also compare our method with SQUID, a well-known method which is available on the Internet. Our evaluation is based on human relevance judgments following a well-established methodology from the information retrieval field.

[1] S. Loncaric, “A Survey of Shape Analysis Techniques,” Pattern Recognition, vol. 31, no. 8, pp. 983-1001, 1998.
[2] P. Suetens, P. Fua, and A.J. Hanson, "Computational Strategies for Object Recognition," ACM Computing Surveys, Vol. 24, No. 1, Mar. 1992, pp. 5-61.
[3] A.K. Jain and A. Vailaya, ”Shape-Based Retrieval: A Case Study With Trademark Image Databases,” Pattern Recognition, vol. 31, no. 9, pp. 1369-1399, 1998.
[4] B.M. Mehtre, M.S. Kankanhalli, and W.F. Lee, “Content-Based Image Retrieval Using a Composite Color-Shape Approach,” Information Processing and Management, vol. 34, no. 1, pp. 109-120, 1998.
[5] T. Gevers and A.W.M. Smeulders, “Pictoseek: Combining Color and Shape Invariant Features for Image Retrieval,” IEEE Trans. Image Processing, vol. 9, no. 1, pp. 102-119, 2000.
[6] M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker, “Query by Image and Video Content: The QBIC System,” IEEE Computer, 1995.
[7] Y. Gdalyahu and D. Weinshall, “Flexible Syntactic Matching of Curves and its Application to Automatic Hierarchical Classification of Silhouettes,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 12, pp. 1312-1328, Dec. 1999.
[8] 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.
[9] F. Mokhtarian, S. Abbasi, and J. Kittler, “Efficient and Robust Retrieval by Shape Content through Curvature Scale Space,” Proc. Int'l Workshop Image DataBases and MultiMedia Search, pp. 35-42, 1996, http://www.ee.surrey.ac.uk/Research/VSSP/ imagedbdemo.html.
[10] 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.
[11] E. Milios and E.G.M. Petrakis, “Shape Retrieval Based on Dynamic Programming,” IEEE Trans. Image Processing, vol. 9, no. 1, pp. 141-146, 2000.
[12] 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.
[13] T.P. Wallace and P.A. Wintz, “An Efficient Three-Dimensional Aircraft Recognition Algorithm Using Normalized Fourier Descriptors,” Computer Graphics and Image Processing, vol. 13, pp. 99-126, 1980.
[14] M.K. Hu, “Pattern Recognition by Moment Invariants,” Proc. IRE Trans. Information Theory, vol. 8, pp. 179-187, 1962.
[15] L. Gupta and M.D. Srinath, “Contour Sequence Moments for the Classification of Closed Planar Shapes,” Pattern Recognition, vol. 20, pp. 267-272, 1987.
[16] M.W. Koch and R.L. Kashyap, “Matching Polygon Fragments,” Pattern Recognition Letters, vol. 10, no. 5, pp. 297-308, Nov. 1989.
[17] E.M. Voorhees and D.K. Harmann, “Overview of the Seventh Text REtrieval Conference (TREC-7),” NIST Special Publication 500-242: The Seventh Text REtrieval Conf., pp. 1-23, 1998, http://trec.nist.gov/pubs/trec7t7_proceedings.html.
[18] M.-H. Han and D. Jang, “The Use of Maximum Curvature Points for the Recognition of Partially Occluded Objects,” Pattern Recognition, vol. 23, no. 1/2, pp. 21-33, 1990.
[19] K. Siddiqi, A. Shokoufandeh, S. Dickinson, and S. Zucker, Shock Graphs and Shape Matching Int'l J. Computer Vision, vol. 35, no. 1, pp. 13-32, Nov. 1999.
[20] P.G. Gottschalk, J.L. Turney, and T.N. Mudge, “Efficient Recognition of Partially Visible Objects Using a Logarithmic Complexity Matching Technique,” The Int'l J. Robotics Research, vol. 8, no. 6, pp. 110-131, Dec. 1989.
[21] W.-H. Tsai and S.-S. Yu, “Attributed String Matching with Merging for Shape Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, no. 4, pp. 453-462, 1985.
[22] B. Bhanu and O.D. Faugeras, “Shape Matching of Two-Dimensional Objects,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 2, pp. 137-156, 1984.
[23] R.J. Prokop and A.P. Reeves, "A survey of moment-based techniques for unoccluded object representation and recognition," Graphical Models and Image Processing, vol. 54, no. 5, pp. 438-460, Sept. 1992.
[24] J.L. Turney, T. Mudge, and R.A. Volz, “Recognition of Partically Occluded Objects,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, no. 4, pp. 410-421, July 1985.
[25] G. Papadourakis, G. Bebis, and S. Orphanoudakis, “Curvature Scale Space Driven Object Recognition with an Indexing Scheme based on Artificial Neural Networks,” Pattern Recognition, vol. 32, no. 7, pp. 1175-1201, 1999.
[26] A. Witkin, D. Terzopoulos, and M. Kass, “Signal Matching Through Scale Space,” Int'l J. Computer Vision, pp. 133-144, 1987.
[27] M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: Active Contour Models,” Int'l J. Computer Vision, vol. 1, no. 4, pp. 321-331, 1988.
[28] B. C. Vemuri and R. Malladi,“Constructing intrinsic parameters with active models for invariant surface reconstruction,” IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 15, No. 7, pp. 668-681, July 1993.
[29] F. Leymarie and M. Levine, "Tracking deformable objects in the plane using an active contour model, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 6, pp. 617-634, June 1993.
[30] L. Floreby, “A Multiscale Algorithm for Closed Contour Matching in Image Sequence,” IEEE Int'l Conf. Pattern Recognition, pp. 884-888, 1996.
[31] H.D. Tagare, “Deformable 2-D Template Matching Using Orthogonal Curves,” IEEE Trans. Medical Imaging, vol. 16, no. 1, pp. 108-117, 1997.
[32] 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.
[33] L. Shapiro, “A Structural Model of Shape,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 2, Mar. 1980.
[34] D.M. Wuescher and K.L. Boyer,“Robust contour decomposition using a constant curvature criterion,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 1, pp. 41-51, 1991.
[35] F. Mokhtarian, “Silhouette-Based Isolated Object Recognition through Curvature Scale-Space,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 5, pp. 539-544, May 1995.
[36] 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.
[37] J. Yih and P. Mazumder,“Circuit behavior modeling and compact testing performance evaluation,” J. Solid State Circuits, vol. 26, no. 1, pp. 62-66, Jan. 1991.
[38] R. Mehrotra and W. Grosky, “Shape Matching Utilizing Indexed Hypotheses Generation and Testing,” IEEE Trans. Robotics and Automation, vol. 5, no. 1, pp. 70-77, Feb. 1989.
[39] 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.
[40] M. Leyton, "A Process-Grammar for Shape," Artificial Intelligence, vol. 34, pp. 213-247, 1988.
[41] A. Witkin, “Scale Space Filtering,” Proc. IJCAI, pp. 1019-1022, 1983.
[42] E. Saund, “Symbolic Construction of a 2D Scale-Space Image,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 8, pp. 817-830, 1990.
[43] K. Siddiqi and B.B. Kimia, “Parts of Visual Form: Computational Aspects,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 3, Mar. 1995.
[44] J. Baid and E. Milios, “Deformed Shape Matching Using Multiscale Dynamic Programming,” Vision Interface, 1996.
[45] Z. Rao, “Fast Retrieval Algorithms for Shape Databases,” Master's thesis, Dept. Computer Science, York Univ., 1999.
[46] E. Milios and E.G.M. Petrakis, “Efficient Shape Matching and Retrieval at Multiple Scales,” Technical Report CS-1998-11, Dept. Computer Science, York Univ., Toronto, 1998, http://www.cs.yorku.ca/techreports/1998CS-1998-11.html .
[47] A.R. Smith, “Spline Tutorial Notes,” Technical Memo 77, Computer Division, Lucasfilm, also, tutorial notes at SIGGRAPHs 83 and 84, May 1983, http://www.alvyray.com/MemosMemosPixar.htm#SplineTutorial .
[48] A. Kalvin, E. Schonberg, J.T. Schwartz, and M. Sharir, “Two-Dimensional, Model-Based, Boundary Matching Using Footprints,” Int'l J. Robotics Research, vol. 5, no. 4, pp. 38-55, 1986.

Index Terms:
Image database, shape retrieval, query by example, dynamic programming, relevance judgments.
Citation:
Euripides G.M. Petrakis, Aristeidis Diplaros, Evangelos Milios, "Matching and Retrieval of Distorted and Occluded Shapes Using Dynamic Programming," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 11, pp. 1501-1516, Nov. 2002, doi:10.1109/TPAMI.2002.1046166
Usage of this product signifies your acceptance of the Terms of Use.