Dense non-rigid surface registration using high-order graph matching

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2010, Pages 382-389

  Zeng, Yun ^a   Wang, Chaohui ^b   Wang, Yang ^c   Gu, Xianfeng ^d   Samaras, Dimitris ^d   Paragios, Nikos ^e  

^a STONY BROOK UNIVERSITY   (United States)

^b Ecole Centrale de Paris   (France)

^c CARNEGIE MELLON UNIVERSITY   (United States)

^d Stony Brook University   (United States)

^e INRIA SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

3D SURFACE; DENSE SURFACE; EMBEDDING ENERGY; EMBEDDING INFORMATION; GRAPH MATCHING PROBLEMS; HIGH-ORDER; NON-RIGID; NONCONVEX OPTIMIZATION; SEARCH SPACES; TWO STAGE OPTIMIZATIONS;

COMPUTER VISION; CONVEX OPTIMIZATION; OPTIMIZATION;

PATTERN MATCHING;

EID: 77955989431     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5540189     Document Type: Conference Paper

References (34)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
2. D. Anguelov, P. Srinivasan, H.-C. Pang, D. Koller, S. Thrun, and J. Davis. The correlated correspondence algorithm for unsupervised registration of nonrigid surfaces. In NIPS, 2004.
3. E. Boros and P. L. Hammer. Pseudo-boolean optimization. Discrete Applied Mathematics, 123(1-3):155-225, 2002.
4. S. P. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
5. A. M. Bronstein, M. M. Bronstein, and R. Kimmel. Generalized multidimensional scaling: a framework for isometry-invariant partial surface matching. Proc. National Academy of Sciences, 103:1168-1172, 2006. (Pubitemid 43191136)
6. A. M. Bronstein, M. M. Bronstein, and R. Kimmel. Expression-invariant representations of faces. IEEE TPAMI, 2004:1042-1053, 2007.
7. L. Buatois, G. Caumon, and B. Levy. Concurrent number cruncher: a GPU implementation of a general sparse linear solver. Int. J. Parallel Emerg. Distrib. Syst., 24(3):205-223, 2009.
8. T. S. Caetano, J. J. McAuley, L. Cheng, Q. V. Le, and A. J. Smola. Learning graph matching. IEEE TPAMI, 31(6):1048-1058, 2009.
9. R. J. Campbell and P. J. Flynn. A survey of free-form object representation and recognition techniques. Comput. Vis. Image Underst., 81(2), 2001.
10. D. Comaniciu and P. Meer. Mean shift: A robust approach toward feature space analysis. IEEE TPAMI, 24(5):603-619, 2002.
11. M. de Berg, M. van Krefeld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, 2 edition, 2000.
12. M. P. do Carmo. Differential Geometry of Curves and Surfaces. Prentice Hall, 1976.
13. O. Duchenne, F. Bach, I. Kweon, and J. Ponce. A tensor-based algorithm for high-order graph matching. In CVPR, 2009.
14. H. M. Farkas and I. Kra. Riemann Surfaces. Springer, 2004.
15. H. Ishikawa. Higher-order clique reduction in binary graph cut. In CVPR, 2009.
16. A. Johnson. Spin-Images: A Representation for 3-D Surface Matching. PhD thesis, CMU, 1997.
17. V. Kolmogorov and C. Rother. Minimizing nonsubmodular functions with graph cuts-a review. IEEE TPAMI, 29(7):1274-1279, 2007.
18. N. Komodakis and N. Paragios. Beyond pairwise energies: Efficient optimization for higher-order MRFs. In CVPR, 2009.
19. N. Komodakis, N. Paragios, and G. Tziritas. MRF optimization via dual decomposition: Message-passing revisited. In ICCV, 2007.
20. N. Komodakis, G. Tziritas, and N. Paragios. Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual strategies. Comput. Vis. Image Underst., 112(1):14-29, 2008.
21. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. In ICCV, pages 1482-1489, 2005.
22. Y. Lipman and T. Funkhouser. Möbius voting for surface correspondence. ACM Trans. Graph., 28(3):1-12, 2009.
23. U. Pinkall and K. Polthier. Computing discrete minimal surfaces and their conjugates. Experimental Mathematics, 2(1):15-36, 1993.
24. A. Sheffer, E. Praun, and K. Rose. Mesh parameterization methods and their applications. Found. Trends. Comput. Graph. Vis., 2(2):105-171, 2006. (Pubitemid 46732197)
25. R. W. Sumner and J. Popović. Deformation transfer for triangle meshes. In SIGGRAPH, pages 399-405, 2004.
26. A. Tevs, M. Bokeloh, M. Wand, A. Schilling, and H.-P. Seidel. Isometric registration of ambiguous and partial data. In CVPR, 2009.
27. N. Thorstensen and R. Keriven. Non-rigid shape matching using geometry and photometry. In ACCV, 2009.
28. L. Torresani, V. Kolmogorov, and C. Rother. Feature correspondence via graph matching: Models and global optimization. In ECCV, 2008.
29. S. Wang, Y. Wang, M. Jin, X. D. Gu, and D. Samaras. Conformal geometry and its applications on 3D shape matching, recognition, and stitching. IEEE TPAMI, 29(7):1209-1220, 2007.
30. Y. Wang, M. Gupta, S. Zhang, S. Wang, X. Gu, D. Samaras, and P. Huang. High resolution tracking of non-rigid 3D motion of densely sampled data using harmonic maps. In ICCV, 2005.
31. R. Zass and A. Shashua. Probabilistic graph and hypergraph matching. In CVPR, 2008.
32. W. Zeng, Y. Zeng, Y. Wang, X. Yin, X. Gu, and D. Samaras. 3D non-rigid surface matching and registration based on holomorphic differentials. In ECCV, 2008.
33. D. Zhang and M. Hebert. Harmonic maps and their applications in surface matching. In CVPR, 1999.
34. H. Zhang, A. Sheffer, D. Cohen-Or, Q. Zhou, O. van Kaick, and A. Tagliasacchi. Deformation-driven shape correspondence. Computer Graphics Forum (SGP), 27(5):1431-1439, 2008.