3D shape registration using spectral graph embedding and probabilistic matching

Image Processing and Analysis with Graphs: Theory and Practice

Volumn , Issue , 2012, Pages 441-474

  Sharma, Avinash ^a   Horaud, Radu ^a   Mateus, Diana ^b  

^a INRIA   (France)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85026697425     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/b12281     Document Type: Chapter

References (54)

1. J.-S. Franco and E. Boyer, “Efficient Polyhedral Modeling from Silhouettes,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 3, pp. 414-427, 2009.
2. J. Starck and A. Hilton, “Surface capture for performance based animation,” IEEE Computer Graphics and Applications, vol. 27, no. 3, pp. 21-31, 2007.
3. G. Slabaugh, B. Culbertson, T. Malzbender, and R. Schafer, “A survey of methods for volumetric scene reconstruction from photographs,” in International Workshop on Volume Graphics, 2001, pp. 81-100.
4. S. M. Seitz, B. Curless, J. Diebel, D. Scharstein, and R. Szeliski, “A comparison and evaluation of multi-view stereo reconstruction algorithms,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2006, pp. 519-528.
5. D. Vlasic, I. Baran, W. Matusik, and J. Popovic, “Articulated mesh animation from multi-view silhouettes,” ACM Transactions on Graphics (Proc. SIGGRAPH), vol. 27, no. 3, pp. 97:1-97:9, 2008.
6. A. Zaharescu, E. Boyer, and R. P. Horaud, “Topology-adaptive mesh deformation for surface evolution, morphing, and multi-view reconstruction,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 4, pp. 823-837, April 2011.
7. Y. Chen and G. Medioni, “Object modelling by registration of multiple range images,” Image Vision Computing, vol. 10, pp. 145-155, April 1992.
8. P. J. Besl and N. D. McKay, #x201C;A method for registration of 3-d shapes,#x201D; IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 14, pp. 239-256, February 1992.
9. S. Rusinkiewicz and M. Levoy, “Efficient variants of the ICP algorithm,” in International Conference on 3D Digital Imaging and Modeling, 2001, pp. 145-152.
10. S. Umeyama, “An eigendecomposition approach to weighted graph matching problems,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695-703, May 1988.
11. J. H. Wilkinson, “Elementary proof of the Wielandt-Hoffman theorem and of it generalization,” Stanford University, Tech. Rep. CS150, January 1970.
12. A. Bronstein, M. Bronstein, and R. Kimmel, “Generalized multidimensional scaling: a framework for isometry-invariant partial surface matching,” Proceedings ofNational Academy ofSciences, vol. 103, pp. 1168-1172,2006.
13. S. Wang, Y. Wang, M. Jin, X. Gu, D. Samaras, and P. Huang, “Conformal geometry and its application on 3d shape matching,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, no. 7, pp. 1209-1220, 2007.
14. V. Jain, H. Zhang, and O. van Kaick, “Non-rigid spectral correspondence of triangle meshes,” International Journal ofShape Modeling, vol. 13, pp. 101-124, 2007.
15. W. Zeng, Y. Zeng, Y. Wang, X. Yin, X. Gu, and D. Samras, “3D non-rigid surface matching and registration based on holomorphic differentials,” in European Conference on Computer Vision, 2008, pp. 1-14.
16. D. Mateus, R. Horaud, D. Knossow, F. Cuzzolin, and E. Boyer, “Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2008, pp. 1-8.
17. M. R. Ruggeri, G. Patane, M. Spagnuolo, and D. Saupe, “Spectral-driven isometry-invariant matching of 3d shapes,” International Journal of Computer Vision, vol. 89, pp. 248-265, 2010.
18. Y. Lipman and T. Funkhouser, “Mobius voting for surface correspondence,” ACM Transactions on Graphics (Proc. SIGGRAPH), vol. 28, no. 3, pp. 72:1-72:12, 2009.
19. A. Dubrovina and R. Kimmel, “Matching shapes by eigendecomposition of the Laplace-Beltrami operator,” in International Symposium on 3D Data Processing, Visualization and Transmission, 2010.
20. G. Scott and C. L. Higgins, “An Algorithm for Associating the Features of Two Images,” Biological Sciences, vol. 244, no. 1309, pp. 21-26, 1991.
21. L. S. Shapiro and J. M. Brady, “Feature-based correspondence: an eigenvector approach,” Image Vision Computing, vol. 10, pp. 283-288, June 1992.
22. B. Luo and E. R. Hancock, “Structural graph matching using the em algorithm and singular value decomposition,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, pp. 1120-1136, October 2001.
23. F. Wang and E. R. Hancock, “Correspondence matching using kernel principal components analysis and label consistency constraints,” Pattern Recognition, vol. 39, pp. 1012-1025, June 2006.
24. H. Qiu and E. R. Hancock, “Graph simplification and matching using commute times,” Pattern Recognition, vol. 40, pp. 2874-2889, October 2007.
25. M. Leordeanu and M. Hebert, “A spectral technique for correspondence problems using pairwise constraints,” in International Conference on Computer Vision, 2005, pp. 1482-1489.
26. O. Duchenne, F. Bach, I. Kweon, and J. Ponce, “A tensor based algorithm for high order graph matching,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2009, pp. 1980-1987.
27. L. Torresani, V. Kolmogorov, and C. Rother, “Feature correspondence via graph matching: Models and global optimazation,” in European Conference on Computer Vision, 2008, pp. 596-609.
28. R. Zass and A. Shashua, “Probabilistic graph and hypergraph matching,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2008, pp. 1-8.
29. J. Maciel and J. P. Costeira, #x201C;A global solution to sparse correspondence problems,;#x201D; IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, pp. 187-199, 2003.
30. Q. Huang, B. Adams, M. Wicke, and L. J. Guibas, “Non-rigid registration under isometric deformations,” Computer Graphics Forum, vol. 27, no. 5, pp. 1449-1457, 2008.
31. Y. Zeng, C. Wang, Y. Wang, X. Gu, D. Samras, and N. Paragios, “Dense non-rigid surface registration using high order graph matching,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010, pp. 382-389.
32. Y. Sahillioglu and Y. Yemez, “3d shape correspondence by isometry-driven greedy optimization,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010, pp. 453-458.
33. A. M. Bronstein, M. M. Bronstein, U. Castellani, A. Dubrovina, L. J. Guibas, R. P. Horaud, R. Kim- mel, D. Knossow, E. v. Lavante, M. D. M. Ovsjanikov, and A. Sharma, “Shrec 2010: robust correspondence benchmark,” in Eurographics Workshop on 3D Object Retrieval, 2010.
34. M. Ovsjanikov, Q. Merigot, F. Memoli, and L. Guibas, “One point isometric matching with the heat kernel,” Computer Graphics Forum (Proc. SGP), vol. 29, no. 5, pp. 1555-1564, 2010.
35. A. Sharma and R. Horaud, “Shape matching based on diffusion embedding and on mutual isometric consistency,” in NORDIA workshop IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010.
36. A. Sharma, R. Horaud, J. Cech, and E. Boyer, “Topologically-robust 3D shape matching based on diffusion geometry and seed growing,” in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2011.
37. D. Knossow, A. Sharma, D. Mateus, and R. Horaud, “Inexact matching of large and sparse graphs using laplacian eigenvectors,” in Graph-Based Representations in Pattern Recognition, 2009, pp. 144-153.
38. R. P. Horaud, F. Forbes, M. Yguel, G. Dewaele, and J. Zhang, “Rigid and articulated point registration with expectation conditional maximization,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 3, pp. 587-602, 2011.
39. M. Belkin and P. Niyogi, “Laplacian eigenmaps for dimensionality reduction and data representation,” Neural computation, vol. 15, no. 6, pp. 1373-1396, 2003.
40. U. von Luxburg, “A tutorial on spectral clustering,” Statistics and Computing, vol. 17, no. 4, pp. 395-416, 2007.
41. F. R. K. Chung, Spectral Graph Theory. American Mathematical Society, 1997.
42. L. Grady and J. R. Polimeni, Discrete Calculus: Applied Analysis on Graphs for Computational Science. Springer, 2010.
43. C. Godsil and G. Royle, Algebraic Graph Theory. Springer, 2001.
44. A. J. Hoffman and H. W. Wielandt, “The variation of the spectrum of a normal matrix,” Duke Mathematical Journal, vol. 20, no. 1, pp. 37-39, 1953.
45. J. H. Wilkinson, The Algebraic Eigenvalue Problem. Oxford: Clarendon Press, 1965.
46. R. A. Horn and C. A. Johnson, Matrix Analysis. Cambridge: Cambridge University Press, 1994.
47. R. Burkard, Assignment Problems. Philadelphia: SIAM, Society for Industrial and Applied Mathematics, 2009.
48. J. Ham, D. D. Lee, S. Mika, and B. Scholkopf, “A kernel view of the dimensionality reduction of manifolds,” in International Conference on Machine Learning, 2004, pp. 47-54.
49. H. Qiu and E. R. Hancock, “Clustering and embedding using commute times,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, no. 11, pp. 1873-1890, 2007.
50. M. Grinstead and L. J. Snell, Introduction to Probability. American Mathematical Society, 1998.
51. W. Scott, “On optimal and data-based histograms,” Biometrika, vol. 66, no. 3, pp. 605-610, 1979.
52. M. M. Zavlanos and G. J. Pappas, “A dynamical systems approach to weighted graph matching,” Automatica, vol. 44, pp. 2817-2824, 2008.
53. J. Sun, M. Ovsjanikov, and L. Guibas, “A concise and provably informative multi-scale signature based on heat diffusion,” in SGP, 2009.
54. C. Luo, I. Safa, and Y. Wang, “Approximating gradients for meshes and point clouds via diffusion metric,” Computer Graphics Forum (Proc. SGP), vol. 28, pp. 1497-1508, 2009.