Robust correspondence and retrieval of articulated shapes

We consider the problem of shape correspondence and retrieval. Although our focus is on articulated shapes, the methods developed are applicable to any shape specified as a contour, in the 2D case, or a surface mesh, in 3D. We propose separate methods for 2D and 3D shape correspondence and retrieval, but the basic idea for both is to characterize shapes using intrinsic measures, defined by geodesic distances between points, to achieve robustness against bending in articulated shapes. In 2D, we design a local, geodesic-based shape descriptor, inspired by the well-known shape context for image correspondence. For 3D shapes, we first transform them into the spectral domain based on geodesic affinities to normalize bending and other common geometric transformations and compute correspondence and retrieval in the new domain. Various techniques to ensure robustness of results and efficiency are proposed. We present numerous experimental results to demonstrate the effectiveness of our approaches.

[1]  Bernhard Schölkopf,et al.  Nonlinear Component Analysis as a Kernel Eigenvalue Problem , 1998, Neural Computation.

[2]  Peter Schröder,et al.  Consistent mesh parameterizations , 2001, SIGGRAPH.

[3]  Yuefeng Zhang A fuzzy approach to digital image warping , 1996, IEEE Computer Graphics and Applications.

[4]  Jovan Popovic,et al.  Deformation transfer for triangle meshes , 2004, ACM Trans. Graph..

[5]  Jitendra Malik,et al.  Recognizing Objects in Range Data Using Regional Point Descriptors , 2004, ECCV.

[6]  Jitendra Malik,et al.  Shape Context: A New Descriptor for Shape Matching and Object Recognition , 2000, NIPS.

[7]  Alla Sheffer,et al.  Cross-parameterization and compatible remeshing of 3D models , 2004, ACM Trans. Graph..

[8]  Hao Zhang,et al.  Sub-sampling for Efficient Spectral Mesh Processing , 2006, Computer Graphics International.

[9]  Matthias W. Seeger,et al.  Using the Nyström Method to Speed Up Kernel Machines , 2000, NIPS.

[10]  Benjamin B. Kimia,et al.  Symmetry-Based Indexing of Image Databases , 1998, J. Vis. Commun. Image Represent..

[11]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Hao Zhang,et al.  Mesh Segmentation via Recursive and Visually Salient Spectral Cuts , 2005 .

[13]  Heinrich Niemann,et al.  A refined ICP algorithm for robust 3-D correspondence estimation , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).

[14]  Ryutarou Ohbuchi,et al.  Shape-similarity search of 3D models by using enhanced shape functions , 2005, Int. J. Comput. Appl. Technol..

[15]  Edwin R. Hancock,et al.  Spectral correspondence for point pattern matching , 2003, Pattern Recognit..

[16]  Terry Caelli,et al.  An eigenspace projection clustering method for inexact graph matching , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Marcel Körtgen,et al.  3D Shape Matching with 3D Shape Contexts , 2003 .

[18]  Fred L. Bookstein,et al.  Principal Warps: Thin-Plate Splines and the Decomposition of Deformations , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Marc Levoy,et al.  Efficient variants of the ICP algorithm , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.

[20]  Sebastian Thrun,et al.  The Correlated Correspondence Algorithm for Unsupervised Registration of Nonrigid Surfaces , 2004, NIPS.

[21]  Katsushi Ikeuchi,et al.  Determining 3-D object pose using the complex extended Gaussian image , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[22]  C. Eckart,et al.  The approximation of one matrix by another of lower rank , 1936 .

[23]  Jitendra Malik,et al.  Spectral grouping using the Nystrom method , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  W SederbergThomas,et al.  A physically based approach to 2D shape blending , 1992 .

[25]  Anil K. Jain Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.

[26]  Thomas A. Funkhouser,et al.  The Princeton Shape Benchmark , 2004, Proceedings Shape Modeling Applications, 2004..

[27]  Ming Ouhyoung,et al.  On Visual Similarity Based 3D Model Retrieval , 2003, Comput. Graph. Forum.

[28]  Francoise J. Preteux,et al.  3D-shape-based retrieval within the MPEG-7 framework , 2001, IS&T/SPIE Electronic Imaging.

[29]  Dejan V. VraniC An improvement of rotation invariant 3D-shape based on functions on concentric spheres , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).

[30]  Haibin Ling,et al.  Using the inner-distance for classification of articulated shapes , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[31]  Michael Garland,et al.  Curvature maps for local shape comparison , 2005, International Conference on Shape Modeling and Applications 2005 (SMI' 05).

[32]  James F. O'Brien,et al.  Spectral surface reconstruction from noisy point clouds , 2004, SGP '04.

[33]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

[34]  Igor Guskov,et al.  Multi-scale features for approximate alignment of point-based surfaces , 2005, SGP '05.

[35]  Hugues Hoppe,et al.  Inter-surface mapping , 2004, ACM Trans. Graph..

[36]  Michael Brady,et al.  Feature-based correspondence: an eigenvector approach , 1992, Image Vis. Comput..

[37]  Szymon Rusinkiewicz,et al.  Rotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors , 2003, Symposium on Geometry Processing.

[38]  B. Kimia,et al.  3D object recognition using shape similiarity-based aspect graph , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[39]  Robert D. Nowak,et al.  Robust contour matching via the order-preserving assignment problem , 2006, IEEE Transactions on Image Processing.

[40]  Ali Shokoufandeh,et al.  Retrieving Articulated 3-D Models Using Medial Surfaces and Their Graph Spectra , 2005, EMMCVPR.

[41]  Baining Guo,et al.  Perceptually based approach for planar shape morphing , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[42]  Hans-Peter Kriegel,et al.  Nearest Neighbor Classification in 3D Protein Databases , 1999, ISMB.

[43]  David P. Dobkin,et al.  A search engine for 3D models , 2003, TOGS.

[44]  Christian Rössl,et al.  Harmonic Guidance for Surface Deformation , 2005, Comput. Graph. Forum.

[45]  Remco C. Veltkamp,et al.  Polyhedral model retrieval using weighted point sets , 2003, 2003 Shape Modeling International..

[46]  Leonidas J. Guibas,et al.  Robust global registration , 2005, SGP '05.

[47]  Remco C. Veltkamp,et al.  A survey of content based 3D shape retrieval methods , 2004, Proceedings Shape Modeling Applications, 2004..

[48]  Andrew E. Johnson,et al.  Recognizing objects by matching oriented points , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[49]  Anand Rangarajan,et al.  A new point matching algorithm for non-rigid registration , 2003, Comput. Vis. Image Underst..

[50]  Andrew E. Johnson,et al.  Using Spin Images for Efficient Object Recognition in Cluttered 3D Scenes , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[51]  Remco C. Veltkamp,et al.  State of the Art in Shape Matching , 2001, Principles of Visual Information Retrieval.

[52]  Szymon Rusinkiewicz,et al.  Shape matching and anisotropy , 2004, ACM Trans. Graph..

[53]  Marc Alexa,et al.  Recent Advances in Mesh Morphing , 2002, Comput. Graph. Forum.

[54]  Hao Zhang,et al.  Robust 3D Shape Correspondence in the Spectral Domain , 2006, IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06).

[55]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[56]  Alla Sheffer,et al.  Fundamentals of spherical parameterization for 3D meshes , 2003, ACM Trans. Graph..

[57]  Alla Sheffer,et al.  Matchmaker: constructing constrained texture maps , 2003, ACM Trans. Graph..

[58]  Guy L. Scott,et al.  Feature grouping by 'relocalisation' of eigenvectors of the proximity matrix , 1990, BMVC.

[59]  Li Yang,et al.  K-edge connected neighborhood graph for geodesic distance estimation and nonlinear data projection , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[60]  Daniel Cohen-Or,et al.  Salient geometric features for partial shape matching and similarity , 2006, TOGS.

[61]  Cordelia Schmid,et al.  A performance evaluation of local descriptors , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[62]  Benjamin B. Kimia,et al.  3D Object Recognition Using Shape Similarity-Based Aspect Graph , 2001, ICCV.

[63]  Jitendra Malik,et al.  Matching Shapes , 2001, ICCV.

[64]  Donald D. Hoffman,et al.  Parts of recognition , 1984, Cognition.

[65]  Edwin R. Hancock,et al.  Correspondence Matching with Modal Clusters , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[66]  Martial Hebert,et al.  On 3D shape similarity , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.