A Riemannian framework for matching point clouds represented by the Schrödinger distance transform

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

Volumn , Issue , 2014, Pages 3756-3761

  Deng, Yan ^a   Rangarajan, Anand ^a   Eisenschenk, Stephan ^a   Vemuri, Baba C ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

non rigid registration; Point clouds matching; Riemannian Manifold; Schrodinger Distance Transform; Unit Hilbert Sphere

Indexed keywords

IMAGE PROCESSING; NONLINEAR PROGRAMMING; PATTERN RECOGNITION; SPHERES;

DISTANCE TRANSFORMS; HILBERT; NONRIGID REGISTRATION; POINT CLOUD; RIEMANNIAN MANIFOLD;

MATHEMATICAL TRANSFORMATIONS;

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

References (18)

1. S. Belongie, J. Malik, and J. Puzicha. Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Analysis and Machine Intelligence, 24(4):509-522, 2002.
2. P. J. Besl and N. D. McKay. A method for registration of 3D shapes. IEEE Trans. Pattern Analysis and Machine Intelligence, 14(2):239-256, 1992.
3. L. M. Bregman. The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Comp. Math. and Math. Phys., 7(3):200-217, 1967.
4. M. Carcassoni and E. R. Hancock. Spectral correspondence for point pattern matching. Pattern Recognition, 36(1):193-204, 2003.
5. H. Chui and A. Rangarajan. A new algorithm for non-rigid point matching. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 2:44-51, 2000.
6. J. Glaunes, A. Trouvé, and L. Younes. Diffeomorphic matching of distributions: A new approach for unlabelled pointsets and sub-manifolds matching. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 712-718, 2004.
7. S. Granger and X. Pennec. Multi-scale EM-ICP: A fast and robust approach for surface registration. In European Conference on Computer Vision (ECCV), pages 418-432, 2002.
8. B. Jian and B. C. Vemuri. Robust point set registration using Gaussian mixture models. IEEE Trans. Pattern Analysis and Machine Intelligence, 33(8):1633-1645, 2011.
9. S. H. Joshi, E. Klassen, A. Srivastava, and I. Jermyn. A novel representation for Riemannian analysis of elastic curves in n R. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 1-7, 2007.
10. J.-H. Lee and C.-H. Won. Topology preserving relaxation labeling for nonrigid point matching. IEEE Trans. Pattern Anal. Mach. Intell., 33(2):427-432, 2011.
11. B. Luo and E. R. Hancock. A unified framework for alignment and correspondence. Computer Vision and Image Understanding, 92:26-55, 2003.
12. J. Ma, J. Zhao, J. Tian, Z. Tu, and A. L. Yuille. Robust estimation of nonrigid transformation for point set registration. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 2147-2154, 2013.
13. A. Myronenko and X. Song. Point-set registration: Coherent point drift. IEEE Trans. on Pattern Analysis and Machine Intelligence, 32(12):2262-2275, 2010.
14. M. Sethi, A. Rangarajan, and K. S. Gurumoorthy. The schrödinger distance transform (SDT) for point-sets and curves. In CVPR, pages 198-205, 2012.
15. Y. Tsin and T. Kanade. A correlation-based approach to robust point set registration. In ECCV (3), pages 558-569, 2004.
16. R. A. Waltz, J. L. Morales, J. Nocedal, and D. Orban. An interior algorithm for nonlinear optimization that combines line search and trust region steps. Mathematical Programming, 107(3):391-408, 2006.
17. L. Younes. Shapes and diffeomorphisms. Springer, 2010.
18. Y. Zheng and D. S. Doermann. Robust point matching for nonrigid shapes by preserving local neighborhood structures. IEEE Trans. Pattern Analysis and Machine Intelligence, 28(4):643-649, 2006.