The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2011 vol.33)
pp: 1065-1071
Michael M. Bronstein , Technion - Israel Institute of Technology, Haifa
Alexander M. Bronstein , Tel-Aviv University, Tel-Aviv
ABSTRACT
Recent works have shown the use of diffusion geometry for various pattern recognition applications, including nonrigid shape analysis. In this paper, we introduce spectral shape distance as a general framework for distribution-based shape similarity and show that two recent methods for shape similarity due to Rustamov and Mahmoudi and Sapiro are particular cases thereof.
INDEX TERMS
Diffusion distance, commute time, spectral distance, eigenmap, Laplace-Beltrami operator, heat kernel, distribution, global point signature, nonrigid shapes, similarity.
CITATION
Michael M. Bronstein, Alexander M. Bronstein, "Shape Recognition with Spectral Distances", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.33, no. 5, pp. 1065-1071, May 2011, doi:10.1109/TPAMI.2010.210
REFERENCES
[1] M. Belkin and P. Niyogi, “Laplacian Eigenmaps for Dimensionality Reduction and Data Representation,” Neural Computation, vol. 13, pp. 1373-1396, 2003.
[2] M. Belkin, J. Sun, and Y. Wang, “Discrete Laplace Operator on Meshed Surfaces,” Proc. Symp. Computational Geometry, pp. 278-287, 2009.
[3] P. Bérard, G. Besson, and S. Gallot, “Embedding Riemannian Manifolds by Their Heat Kernel,” Geometric and Functional Analysis, vol. 4, no. 4, pp. 373-398, 1994.
[4] A.M. Bronstein, M.M. Bronstein, and R. Kimmel, Numerical Geometry of Nonrigid Shapes. Springer, 2008.
[5] A.M. Bronstein, M.M. Bronstein, and R. Kimmel, “Topology-invariant Similarity of Nonrigid Shapes,” Int'l J. Computer Vision, vol. 81, no. 3, pp. 281-301, 2009.
[6] A.M. Bronstein, M.M. Bronstein, M. Mahmoudi, R. Kimmel, and G. Sapiro, “A Gromov-Hausdorff Framework with Diffusion Geometry for Topologically-Robust Non-Rigid Shape Matching,” Int'l J. Computer Vision, vol. 89, nos. 2-3, pp. 266-286, 2010.
[7] A.M. Bronstein, M.M. Bronstein, M. Ovsjanikov, and L. Guibas, “Shape Google: A Computer Vision Approach to Invariant Shape Retrieval,” Proc. Workshop Non-Rigid Shapes and Deformable Image Alignment, 2009.
[8] M.M. Bronstein and A.M. Bronstein, “On a Relation between Shape Recognition Algorithms Based on Distributions of Distances,” CIS Technical Report 2009-14, Technion, 2009.
[9] M.M. Bronstein and I. Kokkinos, “Scale-Invariant Heat Kernel Signatures for Non-Rigid Shape Recognition,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2010.
[10] R.R. Coifman and S. Lafon, “Diffusion Maps,” Applied and Computational Harmonic Analysis, vol. 21, pp. 5-30, 2006.
[11] A.B. Hamza and H. Krim, “Geodesic Matching of Triangulated Surfaces,” IEEE Trans. Image Processing, vol. 15, no. 8, pp. 2249-2258, Aug. 2006.
[12] A. Ion, N.M. Artner, G. Peyré, W.G. Kropatsch, and L.D. Cohen, “Matching 2D and 3D Articulated Shapes Using Eccentricity” Int'l J. Computer Vision (IJCV), 2009.
[13] B. Lévy, “Laplace-Beltrami Eigenfunctions towards an Algorithm that ‘Understands’ Geometry,” Int'l Conf. Shape Modeling and Applications, 2006.
[14] H. Ling and K. Okada, “Diffusion Distance for Histogram Comparison,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2006.
[15] M. Mahmoudi and G. Sapiro, “Three-Dimensional Point Cloud Recognition via Distributions of Geometric Distances,” Graphical Models, vol. 71, no. 1, pp. 22-31, 2009.
[16] D. Mateus, R.P. Horaud, D. Knossow, F. Cuzzolin, and E. Boyer, “Articulated Shape Matching Using Laplacian Eigenfunctions and Unsupervised Point Registration,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2008.
[17] F. Mémoli, “Spectral Gromov-Wasserstein Distances for Shape Matching,” Proc. Workshop Non-Rigid Shapes and Deformable Image Alignment, 2009.
[18] R. Osada, T. Funkhouser, B. Chazelle, and D. Dobkin, “Shape Distributions,” ACM Trans. Graphics, vol. 21, no. 4, pp. 807-832, 2002.
[19] M. Ovsjanikov, A.M. Bronstein, M.M. Bronstein, and L.J. Guibas, “Shape Google: A Computer Vision Approach to Invariant Shape Retrieval,” Proc. Workshop Non-Rigid Shapes and Deformable Image Alignment, 2009.
[20] U. Pinkall and K. Polthier, “Computing Discrete Minimal Surfaces and Their Conjugates,” Experimental Math., vol. 2, no. 1, pp. 15-36, 1993.
[21] H. Qiu and E.R. Hancock, “Clustering and Embedding Using Commute Times,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 11, pp. 1873-1890, Nov. 2007.
[22] M. Reuter, S. Biasotti, D. Giorgi, G. Patanè, and M. Spagnuolo, “Discrete Laplace-Beltrami Operators for Shape Analysis and Segmentation,” Computers & Graphics, vol. 33, no. 3, pp. 381-390, 2009.
[23] M.R. Ruggeri and D. Saupe, “Isometry-Invariant Matching of Point Set Surfaces,” Proc. Eurographics Workshop 3D Object Retrieval, 2008.
[24] R.M. Rustamov, “Laplace-Beltrami Eigenfunctions for Deformation Invariant Shape Representation,” Proc. Fifth Eurographics Symp. Geometry Processing, pp. 225-233, 2007.
[25] J. Sun, M. Ovsjanikov, and L. Guibas, “A Concise and Provably Informative Multi-Scale Signature Based on Heat Diffusion,” Proc. Symp. Geometry Processing, 2009.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool