Robust nonrigid registration by convex optimization

Proceedings of the IEEE International Conference on Computer Vision

Volumn 2015 International Conference on Computer Vision, ICCV 2015, Issue , 2015, Pages 2039-2047

  Chen, Qifeng ^a   Koltun, Vladlen ^b  

^a STANFORD UNIVERSITY   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVEX OPTIMIZATION; GLOBAL OPTIMIZATION; LINEAR PROGRAMMING; MARKOV PROCESSES; OPTIMIZATION;

EFFICIENT GLOBAL OPTIMIZATION; ISOMETRIC EMBEDDINGS; LINEAR PROGRAMMING RELAXATION; MARKOV RANDOM FIELDS; MRF OPTIMIZATIONS; NONRIGID REGISTRATION; REGISTRATION PRECISION; ROBUST STATISTICS;

COMPUTER VISION;

EID: 84973912636     PISSN: 15505499     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2015.236     Document Type: Conference Paper

References (52)

1. A. Aldoma, Z. Marton, F. Tombari, W. Wohlkinger, C. Potthast, B. Zeisl, R. B. Rusu, S. Gedikli, and M. Vincze. Point cloud library: Three-dimensional object recognition and 6 DoF pose estimation. IEEE Robotics and Automation Magazine, 19 (3), 2012. 2
2. D. Anguelov, P. Srinivasan, H. Pang, D. Koller, S. Thrun, and J. Davis. The correlated correspondence algorithm for unsupervised registration of nonrigid surfaces. In NIPS, 2004. 1, 3
3. M. Aubry, U. Schlickewei, and D. Cremers. The wave kernel signature: A quantum mechanical approach to shape analysis. In ICCV Workshops, 2011. 2
4. M. J. Black and A. Rangarajan. On the unification of line processes, outlier rejection, and robust statistics with applications in early vision. IJCV, 19 (1), 1996. 2
5. A. Blake, P. Kohli, and C. Rother. Markov Random Fields for Vision and Image Processing. MIT Press, 2011. 3
6. F. Bogo, J. Romero, M. Loper, and M. J. Black. FAUST: dataset and evaluation for 3D mesh registration. In CVPR, 2014. 1, 2, 5
7. A. M. Bronstein, M. M. Bronstein, and R. Kimmel. Efficient computation of isometry-invariant distances between surfaces. SIAM J. Scientific Computing, 28 (5), 2006. 2
8. A. M. Bronstein, M. M. Bronstein, and R. Kimmel. Generalized multidimensional scaling: A framework for isometryinvariant partial surface matching. Proceedings of the National Academy of Sciences, 103 (5), 2006. 1, 5, 6
9. A. M. Bronstein, M. M. Bronstein, and R. Kimmel. Topology-invariant similarity of nonrigid shapes. IJCV, 81 (3), 2009. 4
10. A. M. Bronstein, M. M. Bronstein, R. Kimmel, M. Mahmoudi, and G. Sapiro. A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching. IJCV, 89 (2-3), 2010. 2
11. A. Dubrovina and R. Kimmel. Approximately isometric shape correspondence by matching pointwise spectral features and global geodesic structures. Advances in Adaptive Data Analysis, 3 (1-2), 2011. 2, 3
12. A. Elad and R. Kimmel. On bending invariant signatures for surfaces. PAMI, 25 (10), 2003. 1
13. T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38, 1985. 4
14. Q. Huang, V. Koltun, and L. J. Guibas. Joint shape segmentation with linear programming. ACM Trans. Graph., 30 (6), 2011. 7
15. J. H. Kappes, B. Andres, F. A. Hamprecht, C. Schnörr, S. Nowozin, D. Batra, S. Kim, B. X. Kausler, T. Kröger, J. Lellmann, N. Komodakis, B. Savchynskyy, and C. Rother. A comparative study of modern inference techniques for structured discrete energy minimization problems. IJCV, 2014. 4
16. J. H. Kappes, B. Savchynskyy, and C. Schnörr. A bundle approach to efficient MAP-inference by Lagrangian relaxation. In CVPR, 2012. 4
17. M. M. Kazhdan, M. Bolitho, and H. Hoppe. Poisson surface reconstruction. In Symposium on Geometry Processing, 2006. 4, 5
18. V. G. Kim, W. Li, N. J. Mitra, S. DiVerdi, and T. A. Funkhouser. Exploring collections of 3D models using fuzzy correspondences. ACM Trans. Graph., 31 (4), 2012. 7
19. V. G. Kim, Y. Lipman, and T. A. Funkhouser. Blended intrinsic maps. ACM Trans. Graph., 30 (4), 2011. 1, 2, 5, 6
20. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. PAMI, 28 (10), 2006. 3, 4
21. V. Kolmogorov. A new look at reweighted message passing. PAMI, 37 (5), 2015. 4
22. V. Kolmogorov and C. Rother. Minimizing nonsubmodular functions with graph cuts-a review. PAMI, 29 (7), 2007. 5
23. V. S. Lempitsky, C. Rother, S. Roth, and A. Blake. Fusion moves for Markov random field optimization. PAMI, 32 (8), 2010. 5
24. Y. Lipman and T. A. Funkhouser. Möbius voting for surface correspondence. ACM Trans. Graph., 28 (3), 2009. 1, 5, 6
25. R. Litman and A. M. Bronstein. Learning spectral descriptors for deformable shape correspondence. PAMI, 36 (1), 2014. 2
26. A. F. T. Martins, M. A. T. Figueiredo, P. M. Q. Aguiar, N. A. Smith, and E. P. Xing. AD3: Alternating directions dual decomposition for MAP inference in graphical models. Journal of Machine Learning Research, 16, 2015. 4
27. T. Meltzer, A. Globerson, and Y. Weiss. Convergent message passing algorithms-a unifying view. In UAI, 2009. 4
28. F. Mémoli and G. Sapiro. A theoretical and computational framework for isometry invariant recognition of point cloud data. Foundations of Computational Mathematics, 5 (3), 2005. 1
29. M. Ovsjanikov, M. Ben-Chen, J. Solomon, A. Butscher, and L. J. Guibas. Functional maps: A flexible representation of maps between shapes. ACM Trans. Graph., 31 (4), 2012. 2
30. J. Pokrass, A. M. Bronstein, M. M. Bronstein, P. Sprechmann, and G. Sapiro. Sparse modeling of intrinsic correspondences. Comput. Graph. Forum, 32 (2), 2013. 5, 6
31. D. Raviv, A. Dubrovina, and R. Kimmel. Hierarchical framework for shape correspondence. Numerical Mathematics: Theory, Methods and Applications, 6, 2013. 2, 3
32. E. Rodolà, A. M. Bronstein, A. Albarelli, F. Bergamasco, and A. Torsello. A game-theoretic approach to deformable shape matching. In CVPR, 2012. 2, 3
33. E. Rodolà, S. R. Bulò, T. Windheuser, M. Vestner, and D. Cremers. Dense non-rigid shape correspondence using random forests. In CVPR, 2014. 2, 5, 6
34. E. Rodolà, A. Torsello, T. Harada, Y. Kuniyoshi, and D. Cremers. Elastic net constraints for shape matching. In ICCV, 2013. 2, 3, 5, 6
35. R. M. Rustamov. Laplace-Beltrami eigenfunctions for deformation invariant shape representation. In Symposium on Geometry Processing, 2007. 2
36. Y. Sahillioglu and Y. Yemez. Coarse-to-fine combinatorial matching for dense isometric shape correspondence. Comput. Graph. Forum, 30 (5), 2011. 2, 5, 6
37. Y. Sahillioglu and Y. Yemez. Minimum-distortion isometric shape correspondence using EM algorithm. PAMI, 34 (11), 2012. 5, 6
38. Y. Sahillioglu and Y. Yemez. Coarse-to-fine isometric shape correspondence by tracking symmetric flips. Comput. Graph. Forum, 32 (1), 2013. 2, 5, 6
39. B. Savchynskyy, S. Schmidt, J. H. Kappes, and C. Schnörr. Efficient MRF energy minimization via adaptive diminishing smoothing. In UAI, 2012. 4
40. D. Sontag, D. K. Choe, and Y. Li. Efficiently searching for frustrated cycles in MAP inference. In UAI, 2012. 4
41. D. Sontag, A. Globerson, and T. Jaakkola. Introduction to dual decomposition for inference. In S. Sra, S. Nowozin, and S. J. Wright, editors, Optimization for Machine Learning. MIT Press, 2011. 3
42. J. Sun, M. Ovsjanikov, and L. J. Guibas. A concise and provably informative multi-scale signature based on heat diffusion. Comput. Graph. Forum, 28 (5), 2009. 2
43. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. F. Tappen, and C. Rother. A comparative study of energy minimization methods for Markov random fields with smoothness-based priors. PAMI, 30 (6), 2008. 4
44. L. Torresani, V. Kolmogorov, and C. Rother. A dual decomposition approach to feature correspondence. PAMI, 35 (2), 2013. 3
45. M. J. Wainwright, T. Jaakkola, and A. S. Willsky. MAP estimation via agreement on trees: message-passing and linear programming. IEEE Transactions on Information Theory, 51 (11), 2005. 3
46. M. J. Wainwright and M. I. Jordan. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, 1 (1-2), 2008. 4
47. C. Wang, M. M. Bronstein, A. M. Bronstein, and N. Paragios. Discrete minimum distortion correspondence problems for non-rigid shape matching. In Scale Space and Variational Methods in Computer Vision, 2011. 3
48. T. Werner. A linear programming approach to max-sum problem: A review. PAMI, 29 (7), 2007. 3, 4
49. T. Windheuser, U. Schlickewei, F. R. Schmidt, and D. Cremers. Geometrically consistent elastic matching of 3D shapes: A linear programming solution. In ICCV, 2011. 2
50. T. Windheuser, M. Vestner, E. Rodolà, R. Triebel, and D. Cremers. Optimal intrinsic descriptors for non-rigid shape analysis. In BMVC, 2014. 2
51. C. Yanover, T. Meltzer, and Y. Weiss. Linear programming relaxations and belief propagation-an empirical study. Journal of Machine Learning Research, 7, 2006. 4
52. Y. Zeng, C. Wang, Y. Wang, X. Gu, D. Samaras, and N. Paragios. Dense non-rigid surface registration using high-order graph matching. In CVPR, 2010. 1