Non-rigid registration of point clouds using landmarks and stochastic neighbor embedding

被引:2
作者
Maharjan, Amar [1 ]
Yuan, Xiaohui [1 ]
Lu, Qiang [2 ]
Fan, Yuqi [2 ]
Chen, Tian [2 ]
机构
[1] Univ North Texas, Dept Comp Sci & Engn, Denton, TX 76203 USA
[2] Hefei Univ Technol, Hefei, Peoples R China
关键词
non-rigid registration; landmark; deformation; local neighborhood structure; SET REGISTRATION; FRAMEWORK;
D O I
10.1117/1.JEI.30.3.031202
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Our study presents a probabilistic non-rigid point set registration method to deal with large and uneven deformations. Our method treats the registration as a density estimation problem. In our method, we add two key constraints to enforce landmark correspondences and preserve local neighborhood structure. We assume that the landmarks, which represent the salient points in the point sets, are given or can be detected using keypoint detectors such as scale invariant feature transform or MeshDOG. By enforcing landmark correspondences, we preserve the overall global shape of the point set with significant deformations. Furthermore, by leveraging stochastic neighbor embedding, we incorporate constraints to preserve local neighborhood structure, which penalizes incoherent transformation within a neighborhood. Our experimental results in both 2D and 3D datasets show that our method outperforms state-of-the-art methods in a large degree of deformations. In particular, quantitative results show that the error is 29% better than the second-best result (from the state-of-the-art methods). Our analysis shows that a relatively small number of landmarks is sufficient to deal with large deformations. Finally, our study shows that our method is computationally comparable to state-of-the-art methods. (c) 2021 SPIE and IS&T [DOI: 10.1117/1.JEI.30.3.031202]
引用
收藏
页数:15
相关论文
共 44 条
[1]  
Amberg B, 2007, IEEE I CONF COMP VIS, P1326
[2]  
[Anonymous], ADV NEURAL INF PROCE
[3]  
Belkin M, 2006, J MACH LEARN RES, V7, P2399
[4]   Shape matching and object recognition using shape contexts [J].
Belongie, S ;
Malik, J ;
Puzicha, J .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (04) :509-522
[5]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[6]  
Bishop C.M., 1995, Neural networks for pattern recognition
[7]   Analysis of two-dimensional non-rigid shapes [J].
Bronstein, Alexander M. ;
Bronstein, Michael M. ;
Bruckstein, Alfred M. ;
Kimmel, Ron .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2008, 78 (01) :67-88
[8]  
CHEN Y, 1991, 1991 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-3, P2724, DOI 10.1109/ROBOT.1991.132043
[9]   A new point matching algorithm for non-rigid registration [J].
Chui, HL ;
Rangarajan, A .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2003, 89 (2-3) :114-141
[10]   A feature registration framework using mixture models [J].
Chui, HL ;
Rangarajan, A .
IEEE WORKSHOP ON MATHEMATICAL METHODS IN BIOMEDICAL IMAGE ANALYSIS, PROCEEDINGS, 2000, :190-197