Non-rigid point set registration via global and local constraints
- 298 Downloads
Non-rigid point set registration is often encountered in meical image processing, pattern recognition, and computer vision. This paper presents a new method for non-rigid point set registration that can be used to recover the underlying coherent spatial mapping (CSM). Firstly, putative correspondences between two point sets are established by using feature descriptors. Secondly, each point is expressed as a weighted sum of several nearest neighbors and the same relation holds after the transformation. Then, this local geometrical constraint is combined with the global model, and the transformation problem is solved by minimizing an error function. These two steps of recovering point correspondences and transformation are performed iteratively to obtained a promising result. Extensive experiments on various synthetic and real data demonstrate that the proposed approach is robust and outperforms the state-of-the-art methods.
KeywordsPoint set registration Coherent spatial mapping Local geometrical constraint
This work is supported in part by the National Natural Science Foundation of China under Grant 61501120 and 41501505 and in part by 2016 Outstanding Youth Research Talent Cultivation Program in Colleges and Universities in Fujian Province.
- 3.Bishop CM (2006) Pattern rcognition and machine learning. SpringerGoogle Scholar
- 17.Lian W, Zhang L (2012) Robust point matching revisited: a concave optimization approach. In: Proceedings of European conference on computer visionGoogle Scholar
- 20.Ma J, Zhao J, Tian J, Tu Z, Yuille AL (2013) Robust estimation of nonrigid transformation for point set registration. In: IEEE Conference on computer vision and pattern recognition. IEEE, pp 2147–2154Google Scholar
- 26.Ma J, Zhao J, Jiang J, Zhou H (2017) Non-rigid point set registration with robust transformation estimation under manifold regularization. In: Inproceedings of the Thirty-First AAAI conference on artificial intelligence (AAAI). AAAI, pp 4218–4224Google Scholar