Approximately isometric shape correspondence by matching pointwise spectral features and global geodesic structures

Advances in Adaptive Data Analysis

Volumn 3, Issue 1-2, 2011, Pages 203-228

  Dubrovina, Anastasia ^a   Kimmel, Ron ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

LaplaceBeltrami; Shape correspondence; surface descriptors

Indexed keywords

DESCRIPTORS; EIGEN DECOMPOSITION; GEODESIC STRUCTURE; ISOMETRY INVARIANT; LAPLACE-BELTRAMI OPERATOR; LAPLACEBELTRAMI; MINIMIZATION PROBLEMS; PRACTICAL METHOD; QUADRATIC MINIMIZATION; SHAPE CORRESPONDENCE; SPECTRAL FEATURE;

SURFACE PROPERTIES;

EID: 80052623363     PISSN: 17935369     EISSN: 17937175     Source Type: Journal    
DOI: 10.1142/S1793536911000829     Document Type: Conference Paper

References (61)

1. Anguelov, D., Srinivasan, P., Pang, H.-C., Koller, D. and Thrun, S. (2004). The correlated correspondence algorithm for unsupervised registration of nonrigid surfaces, Proceedings of the Neural Information Processing Systems (NIPS) Conference, pp. 33-40.
2. Bemporad, A. (2004). Hybrid Toolbox-User's Guide. http://www.dii.unisi. it/hybrid/toolbox.
3. Ben-Chen, M., Butscher, A., Solomon, J. and Guibas, L. J. (2010). On discrete killing vector fields and patterns on surfaces. Comput. Graph. Forum (Proc. SGP), 29(5): 1701-1711.
4. B́erard, P., Besson, G. and Gallot, S. (1994). Embedding Riemannian manifolds by their heat kernel, in Geometric Find Functional Analysis, 4(4): 373-398.
5. Borg, I. and Groenen, P. J. F. (2005). Modern Multidimensional Scaling: Theory and Applications (Springer Series in Statistics), 2nd Edition, Springer, Berlin.
6. Bronstein, A. M. and Bronstein, M. M. (2010). Analysis of diffusion geometry methods for shape recognition. IEEE Trans. Patt. Anal. Mach. Intell. (PA M I ) (submitted).
7. Bronstein, A. M., Bronstein, M. M., Castellani, U., Dubrovina, A., Guibas, L. J., Horaud, R. P., Kimmel, R., Knossow, D., von Lavante, E., Mateus, D., Ovsjanikov, M. and Sharma, A. (2010 (to appear)). Shrec 2010: Robust correspondence benchmark. Proceedings of the EUROGRAPHICS Workshop on 3D Object Retrieval (3DOR).
8. Bronstein, A. M., Bronstein, M. M. and Kimmel, R. (2006). Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching, Proceedings National Academy of Sciences (PNAS), pp. 1168-1172. (Pubitemid 43191136)
9. Bronstein, A. M., Bronstein, M. M. and Kimmel, R. (2008). Numerical Geometry of Non-Rigid Shapes, Springer, New York.
10. Bronstein, M. M. and Kokkinos, I. (2010). Scale-invariant heat kernel signatures for non-rigid shape recognition. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
11. Bronstein, A. M., Bronstein, M. M., Kimmel, R., Mahmoudi, M. and Sapiro, G. (2009). A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching. Int. J. Comput. Vis. (IJCV ).
12. Chang, W. and Zwicker, M. (2008). Automatic registration for articulated shapes. Comput. Graph. Forum (Proc. SGP), 27: 1459-1468.
13. Coifman, R. R. and Lafon, S. (2006). Diffusion maps. Appl. Comput. Harmonic Anal., 21: 5-30. (Pubitemid 43947619)
14. Dubrovina, A. and Kimmel, R. (2010). Matching shapes by eigendecomposition of the Laplace-Beltrami operator. International Symposium on 3D Data Processing Visualization and Transmission.
15. d'Amico, M., Frosini, P. and Landi, C. (2006). Using matching distance in size theory: A survey. Int. J. Imag. Syst. Technol., 16(5): 154-161. (Pubitemid 46588678)
16. Elad, A. and Kimmel, R. (2003). On bending invariant signatures for surfaces. IEEE Trans. Patt. Anal. Mach. Intell. (PA M I ), 25: 1285-1295.
17. Garland, M. (1999). Quadric-Based Polygonal Surface Simplification. PhD thesis, School of Computer Science, Carnegie Mellon University.
18. Gonzalez, T. F. (1985). Clustering to minimize the maximum intercluster distance. The-oret. Comput. Sci., 38: 293-306.
19. Gromov, M. (1981). Structures Metriques Pour les Varietes Riemanniennes, Textes Math-ematiques, no. 1.
20. Hochbaum, D. S. and Shmoys, D. B. (1985). A best possible heuristic for the k-center problem. Math. Oper. Res., 10(2): 180-184.
21. Hu, J. and Hua, J. (2009). Salient spectral geometric features for shape matching and retrieval. Vis. Comput., 25: 667-675.
22. Huang, Q.-X., Adams, B., Wicke, M. and Guibas, L. J. (2008). Non-rigid registration under isometric deformations. Comput. Graph. Forum, 27: 1449-1457.
23. Jain, V., Zhang, H. and Kaick, O. V. (2007). Non-rigid spectral correspondence of triangle meshes. Int. J. Shape Model., 101-124. (Pubitemid 350131622)
24. Kimmel, R. and Sethian, J. A. (1998). Computing geodesic paths on manifolds. In Proceedings of National Academy of Sciences (PNAS), pp. 8431-8435. (Pubitemid 28350504)
25. Kim, V., Lipman, Y., Chen, X. and Funkhouser, T. (2010). Mobius transformations for global intrinsic symmetry analysis. Proceedi ngs of Eurographics Symposium on Geometry Processing (SGP), 29(5).
26. Knossow, D., Sharma, A., Mateus, D. and Horaud, R. P. (2009). Inexact matching of large and sparse graphs using Laplacian eigenvectors. Proceedi ngs of 7th W orkshop on Graph-based Representations in Pattern Recognition.
27. Leordeanu, M. and Hebert, M. (2005). A spectral technique for correspondence problems using pairwise constraints, Proceedings of International Conference of Computer Vision (ICCV ), pp. 1482-1489. (Pubitemid 44042353)
28. Levy, B. (2006). Laplace-Beltrami eigenfunctions towards an algorithm that "understands" geometry. IEEE International Conference on Shape Modeling and Applications, 13. (Pubitemid 44889044)
29. Levy, B. and Zhang, R. H. (2009). Spectral Geometry Processing. ACM SIGGRAPH ASIA Course Notes.
30. Lipman, Y. and Funkhouser, T. (2009). Mobius voting for surface correspondence. ACM Trans. Graph. (Proc. SIGGRAPH ), 28.
31. Lipman, Y., Chen, X., Daubechies, I. and Funkhouser, T. (2010). Symmetry factored embedding and distance. ACM Trans. Graph. (Proc. SIGGRAPH).
32. Maciel, J. and Costeira, J. P. (2003). A global solution to sparse correspondence problems. IEEE Trans. Patt. Anal. Mach. Intell. (PAMI), 25: 187-199.
33. Macqueen, J. B. (1967). Some methods of classification and analysis of multivariate observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281-297.
34. Mateus, D., Cuzzolin, F., Horaud, R. P. and Boyer, E. (2007). Articulated shape matching using locally linear embedding and orthogonal alignment. Proceedings of the IEEE Workshop on Non-Rigid Registration and Tracking Through Learning (NRTL).
35. Mateus, D., Horaud, R. P., Knossow, D., Cuzzolin, F. and Boyer, E. (2008). Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
36. Memoli, F. and Sapiro, G. (2005). A theoretical and computational framework for isometry invariant recognition of point cloud data. Found. Comput. Math., 5: 313-347. (Pubitemid 43183919)
37. Memoli, F. (2007). On the use of Gromov-Hausdorff distances for shape comparison. Point Based Graph., 81-90.
38. Meyer, M., Desbrun, M., Schr̈oder, P. and Barr, A. (2002). Discrete differential geometry operators for triangulated 2-manifolds. International Workshop on Visualization and Mathematics.
39. Ovsjanikov, M., Sun, J. and Guibas, L. (2008). Global intrinsic symmetries of shapes. Comput. Graph. Forum, 27: 1341-1348.
40. Pardalos, P. M., Rendl, F. and Wolkowicz, H. (1994). The quadratic assignment problem: A survey and recent developments. Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, Vol. 16 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 1-42.
41. Pinkall, U. and Polthier, K. (1993). Computing discrete minimal surfaces and their conjugates. Exp. Math., 2: 15-36.
42. Qiu, H. and Hancock, E. (2007). Clustering and embedding using commute times. IEEE Trans. Patt. Anal. Mach. Intell. (PAMI).
43. Raviv, D., Bronstein, A. M., Bronstein, M. M. and Kimmel, R. (2007). Symmetries of non-rigid shapes. Proceedings of Workshop on Non-Rigid Registration and Tracking Through Learning (NRTL).
44. Raviv, D., Bronstein, A. M., Bronstein, M. M. and Kimmel, R. (2009). Full and partial symmetries of non-rigid shapes. Int. J. Comput. Vis. (IJCV).
45. Raviv, D., Dubrovina, A. and Kimmel, R. (2011). Hierarchical matching of non-rigid shapes. International Conference on Scale Space and Variational Methods in Computer Vision (SSVM'11), submitted.
46. Reuter, M., Wolter, F.-E. and Peinecke, N. (2006). Laplace-Beltrami spectra as "Shape-DNA" of surfaces and solids, Computer-Aided Design, 38: 342-366.
47. Rosenberg, S. (1997). The Laplacian on a Riemannian Manifold: An Introduction to Analysis on Manifolds, Cambridge University Press, Cambridge.
48. Ruggeri, M. R. and Saupe, D. (2008). Isometry-invariant matching of point set surfaces, Proceedings of the Eurographics 2008 Workshop on 3D Object Retrieval.
49. Rustamov, R. M. (2007). Laplace-Beltrami eigenfunctions for deformation invariant shape representation, Proceedings of SGP, pp. 225-233.
50. Shapiro, L. S. and Brady, J. M. (1992). Feature-based correspondence: An eigenvector approach. Image Vision Comput., 10: 283-288.
51. Sun, J., Ovsjanikov, M. and Guibas, L. (2009). A concise and provably informative multi-scale signature based on heat diffusion. Proceedings of the Eurographics Symposium on Geometry Processing (SGP).
52. Tevs, A., Bokeloh, M., Wand, M., Schilling, A. and Seidel, H.-P. (2009). Isometric registration of ambiguous and partial data. Proceedings of the I EE E Conference on Computer Vision and Pattern Recognition (CVPR).
53. Thorstensen, N. and Keriven, R. (2009). Non-rigid shape matching using geometry and photometry. Asian Conference on Computer Vision, pp. 1-12.
54. Torresani, L. and Kolmogorov, V. and Rother, C. (2008). Feature correspondence via graph matching: Models and global optimization. Proceedings of the 10th European Conference on Computer Vision (ECCV '08), pp. 596-609.
55. Umeyama, S. (1988). An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Patt. Anal. Mach. Intell. (PAMI), 10: 695-703.
56. Wang, C., Bronstein, M. M. and Paragios, N. (2010). Discrete minimum distortion correspondence problems for non-rigid shape matching. Technical Report, INRIA Research ́ Report 7333, Math́ematiques Appliqúees aux Syst̀emes, Ecole Centrale Paris.
57. Weber, O., Devir, Y., Bronstein, A. M., Bronstein, M. M. and Kimmel, R. (2008). Parallel algorithms for approximation of distance maps on parametric surfaces. ACM Trans. Graph., 27: 1-16.
58. Xu, G. (2004). Discrete Laplace-Beltrami operators and their convergence. Comput. Aided Geom. Design, 21: 767-784.
59. Zaharescu, A., Boyer, E., Varanasi, K. and Horaud, R. P. (2009). Surface feature detection and description with applications to mesh matching. in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
60. Zhang, H., Sheffer, A., Cohen-Or, D., Zhou, Q., van Kaick, O. and Tagliasacchi, A. (2008). Deformation-driven shape correspondence. Comput. Graph. Forum (Proc. SGP), 27: 1431-1439.
61. Zigelman, G., Kimmel, R. and Kiryati, N. (2008). Texture mapping using surface flattening via multi-dimensional scaling. IEEE Trans. Visual. Comput. Graph., 2(2): 198-207.