Non-rigid Point Set Registration Based on Iterative Linear Optimization
This paper presents a novel point set registration algorithm based on iterative linear optimization, which can be used to register both rigid and non-rigid point set. Firstly, a new cost function was constructed to evaluate the summation of squared distance between the two point sets, in which rigid transformation, non-rigid elastic deformation and complex deformation were all included for consideration. Secondly, the proposed cost was linearized using to obtain a linear cost function of registration parameters. Thirdly, the registration parameters were solved by iterative optimization using Tikhonov regularization. Experimental results validated the performances of proposed method.
KeywordsPoint set registration Non-rigid point set Cost function Tikhonov regularization Linear optimization
This research was supported by National Natural Science Foundation of China (Grant No. 51305390, 61501394) and Natural Science Foundation of HeBei Province (Grant No. F2016203312).
- 1.Fitsgibbon, A.W.: Robust registration of 2D and 3D point set. Image Vis. Comput. 21(13), 1145–1153 (2001)Google Scholar
- 3.Jian, B., Vemuri, B.: A robust algorithm for point set registration using mixture of Gaussians. In: IEEE International Conference on Computer Vision, vol. 2, pp. 1246–1251(2005)Google Scholar
- 5.Sofien, B., Andrea, T.: Dynamic 2D/3D registration. The Eurographics Association. http://lgg.epfl.ch/2d3dRegistration