This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Representation and Detection of Deformable Shapes
February 2005 (vol. 27 no. 2)
pp. 208-220
Pedro F. Felzenszwalb, IEEE Computer Society
We describe some techniques that can be used to represent and detect deformable shapes in images. The main difficulty with deformable template models is the very large or infinite number of possible nonrigid transformations of the templates. This makes the problem of finding an optimal match of a deformable template to an image incredibly hard. Using a new representation for deformable shapes, we show how to efficiently find a global optimal solution to the nonrigid matching problem. The representation is based on the description of objects using triangulated polygons. Our matching algorithm can minimize a large class of energy functions, making it applicable to a wide range of problems. We present experimental results of detecting shapes in medical images and images of natural scenes. Our method does not depend on initialization and is very robust, yielding good matches even in images with high clutter. We also consider the problem of learning a nonrigid shape model for a class of objects from examples. We show how to learn good models while constraining them to be in the form required by the matching algorithm.

[1] Y. Amit and A. Kong, “Graphical Templates for Model Registration,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 3, pp. 225-236, Mar. 1996.
[2] R. Basri, L. Costa, D. Geiger, and D.W. Jacobs, “Determining the Similarity of Deformable Shapes,” Vision Research, vol. 38, pp. 2365-2385, 1998.
[3] M.W. Bern and D. Eppstein, “Mesh Generation and Optimal Triangulation,” Computing in Euclidean Geometry, second ed., Lecture Notes Series on Computing, D.-Z. Du and F. Hwang, eds., World Scientific, pp. 47-123, 1995.
[4] U. Bertele and F. Brioschi, Nonserial Dynamic Programming. Academic Press, 1972.
[5] I. Biederman, “Recognition by Components: A Theory of Human Image Understanding,” Psychological Rev., vol. 94, no. 2, pp. 115-147, 1987.
[6] H. Blum, “Biological Shape and Visual Science,” Theoretical Biology, vol. 38, pp. 205-287, 1973.
[7] F.L. Bookstein, “Size and Shape Spaces for Landmark Data in Two Dimensions,” Statistical Science, vol. 1, no. 2, May 1986.
[8] T.F. Cootes, C.J. Taylor, D.H. Cooper, and J. Graham, “Active Shape Models: Their Training and Application,” Computer Vision and Image Understanding, vol. 61, no. 1, pp. 38-59, 1995.
[9] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press and McGraw-Hill, 1989.
[10] J. Coughlan, A. Yuille, C. English, and D. Snow, “Efficient Deformable Template Detection and Localization without User Initialization,” Computer Vision and Image Understanding, vol. 78, no. 3, pp. 303-319, 2000.
[11] M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry. Springer-Verlag, 1997.
[12] I.L. Dryden and K.V. Mardia, Statistical Shape Analysis. John Wiley & Sons, 1998.
[13] P.F. Felzenszwalb and D.P. Huttenlocher, “Efficient Matching of Pictorial Structures,” Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR '00), pp. 66-73, 2000.
[14] M.A. Fischler and R.A. Elschlager, “The Representation and Matching of Pictorial Structures,” IEEE Trans. Computers, vol. 22, no. 1, pp. 67-92, Jan. 1973.
[15] D. Geiger, A. Gupta, L.A. Costa, and J. Vlontzos, “Dynamic-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] D. Geiger, T.L. Liu, and R.V. Kohn, “Representation and Self-Similarity of Shapes,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 1, pp. 86-99, Jan. 2003.
[17] M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.
[18] C. Goodall, “Procrustes Methods in the Statistical Analysis of Shape,” J. Royal Statistical Soc., Series B, vol. 52, no. 2, pp. 285-339, 1991.
[19] U. Grenander, Elements of Pattern Theory. Johns Hopkins Univ. Press, 1996.
[20] U. Grenander, Y. Chow, and D.M. Keenan, HANDS: A Pattern-Theoretic Study of Biological Shapes. Springer-Verlag, 1991.
[21] F. Harary and E.M. Palmer, “On Acyclic Simplicial Complexes,” Mathematika, vol. 15, no. 1, pp. 115-122, 1968.
[22] D.D. Hoffman and W.A. Richards, “Parts of Recognition,” Cognition, vol. 18, pp. 65-96, 1985.
[23] D.P. Huttenlocher and S. Ullman, “Recognizing Solid Objects by Alignment with an Image,” Int'l J. Computer Vision, vol. 5, no. 2, pp. 195-212, 1990.
[24] A.K. Jain, Y. Zhong, and S. Lakshmanan, “Object Matching Using Deformable Templates,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 3, pp. 267-278, Mar. 1996.
[25] M. Kass, A.P. Witkin, and D. Terzopoulos, “Snakes: Active Contour Models,” Int'l J. Computer Vision, vol. 1, no. 4, pp. 321-331, 1988.
[26] M. Leventon, W. Grimson, and O. Faugeras, “Statistical Shape Influence in Geodesic Active Contours,” Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR '00), pp. 316-323, 2000.
[27] D. Marr and H.K. Nishihara, “Representation and Recognition of the Spatial Organization of Three-Dimensional Shapes,” Proc. Royal Soc. London, Series B, Biological Sciences, vol. 200, pp. 269-294, 1978.
[28] D.J. Rose, “On Simple Characterizations of $k{\hbox{-}}{\rm trees}$ ,” Discrete Math., vol. 7, nos. 3-4, pp. 317-322, 1974.
[29] T.B. Sebastian and B.B. Kimia, “Curves vs Skeletons in Object Recognition,” Proc. IEEE Int'l Conf. of Image Processing, 2001.
[30] T.S. Sebastian, P.N. Klein, and B.B. Kimia, “Recognition of Shapes by Editing Shock Graphs,” Proc. IEEE Int'l Conf. Computer Vision (ICCV '01), pp. 755-762, 2001.
[31] K. Siddiqi and B.B. Kimia, “Parts of Visual Form: Computational Aspects,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 3, pp. 239-251, Mar. 1995.
[32] K. Siddiqi and B.B. Kimia, “A Shock Grammar for Recognition,” Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR '96), pp. 507-513, 1996.
[33] C.G. Small, The Statistical Theory of Shape. Springer-Verlag, 1996.
[34] M.B. Stegmann, B.K. Ersbøll, and R. Larsen, “FAME— A Flexible Appearance Modelling Environment,” IEEE Trans. Medical Imaging, May 2003.
[35] M.B. Stegmann and D.D. Gomez, “A Brief Introduction to Statistical Shape Analysis,” technical report, Informatics and Mathematical Modelling, Technical Univ. of Denmark, DTU, Mar. 2002.
[36] S. Ullman and R. Basri, “Recognition by Linear Combinations of Models,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 10, pp. 992-1005, Oct. 1991.
[37] B. Widrow, “The Rubber Mask Technique,” Pattern Recognition, vol. 5, no. 3, pp. 174-211, 1973.
[38] S.C. Zhu and A.L. Yuille, “Forms: A Flexible Object Recognition and Modelling System,” Int'l J. Computer Vision, vol. 20, no. 3, pp. 187-212, 1996.

Index Terms:
Shape representation, object recognition, deformable templates, chordal graphs, dynamic programming.
Citation:
Pedro F. Felzenszwalb, "Representation and Detection of Deformable Shapes," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 2, pp. 208-220, Feb. 2005, doi:10.1109/TPAMI.2005.35
Usage of this product signifies your acceptance of the Terms of Use.