JCC  Vol.3 No.5 , May 2015
Image Registration Technique Based on a Fast CPD Algorithm
Abstract

The Coherent Point Drift (CPD) algorithm which based on Gauss Mixture Model is a robust point set registration algorithm. However, the selection of robustness weight which used to describe the noise may directly affect the point set registration efficiency. For resolving the problem, this paper presents a CPD registration algorithm which based on distance threshold constraint. Before the point set registration, the inaccurate template point set by resampling become the initial point set of point set matching, in order to eliminate some points that the distance to target point set is too close and too far in the inaccurate template point set, and set the weights of robustness as . In the simulation experiments, we make two group experiments: the first group is the registration of the inaccurate template point set and the accurate target point set, while the second group is the registration of the accurate template point set and the accurate target point set. The results of comparison show that our method can solve the problem of selection for the weight. And it improves the speed and precision of the original CPD registration.


Cite this paper
Liu, W. and Wang, T. (2015) Image Registration Technique Based on a Fast CPD Algorithm. Journal of Computer and Communications, 3, 182-188. doi: 10.4236/jcc.2015.35023.
References

[1]   Myronenko, A. and Song, X.B. (2010) Point-Set Registration: Coherent Point Drift. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32, 2262-2275. http://dx.doi.org/10.1109/TPAMI.2010.46

[2]   Dai, J.L., Chen, Z.Y. and Ye, X.X. (2007) The Application of ICP Algorithm for Point Cloud Registration. Journal of Image and Graphics, 12, 517-521.

[3]   Chui, H. and Rangarajan, A. (2003) A New Point Matching Algorithm for Non-Rigid Registration. Computer Vision and Image Understanding, 89, 114-141. http://dx.doi.org/10.1016/S1077-3142(03)00009-2

[4]   Belongie, S., Malik, J. and Puzicha, J. (2002) Shape Matching and Object Recognition Using Shape Contexts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24, 509-522. http://dx.doi.org/10.1109/34.993558

[5]   Gope, C. and Kehtarnavaz, N. (2007) Affine Invariant Comparison of Point-Sets Using Convex Hulls and Hausdorff Distances. Pattern Recognition, 40, 309-320.

[6]   Caetano, T.S., McAuley, J.J., Cheng, L., et al. (2009) Learning Graph Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31, 1048-1058. http://dx.doi.org/10.1109/TPAMI.2009.28

[7]   Xie, Z.X., Xu, S. and Li, X.Y. (2010) A High-Accuracy Method for Fine Registration of Overlapping Point Clouds. Image and Vision Computing, 28, 563-570. http://dx.doi.org/10.1016/j.imavis.2009.09.006

[8]   Jian, B. and Vemuri, B.C. (2011) Robust Point Set Registration Using Gaussian Mixture Models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33, 1633-1645. http://dx.doi.org/10.1109/TPAMI.2010.223

[9]   Luo, B. and Hancock, E.R. (2002) Iterative Procrustes Alignment with the EM Algorithm. Image and Vision Computing, 20, 377-396. http://dx.doi.org/10.1016/S0262-8856(02)00010-0

[10]   Myronenko, A. and Song, X.B. (2009) On the Closed-Form Solution of the Rotation Matrix Arising in Computer Vision Problems. Oregon Health and Science Univ., Tech. Rep. arXiv:0904.1613v1.

[11]   Xin, W. and Pu, J.X. (2011) Point Cloud Integration Based on Distances between Points and Their Neighborhood Centroids. Journal of Image and Graphics, 16, 886-891.

[12]   Zhong, Y. and Zhang, M. (2014) Automatic Registration Technology of Point Cloud Based on Improve ICP Algorithm. Control Engineering of China, 21, 112-121.

 
 
Top