Abstract
This paper presents a more robust iterative closest point (ICP) approach for 2D point set registration. An inequality constraint of the rotation angle is introduced into the least square registration model which is solved by an extended ICP algorithm. At each iterative step of the algorithm, a closed-form solution for the rotation is obtained according to the monotonicity of the model with respect to the rotation angle. The proposed approach extends the convergence domain of the ICP algorithm, and it can be used much more widely. A series of 2D point set experiments on part B of MPEG-7 CE-shape-1 dataset prove that the proposed method is much more robust than ICP without increasing the computational complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Besl PJ, McKay ND (1992) A method for registration of 3-D shapes. IEEE Trans Pattern Anal Mach Intell 14:239–256
Chen Y, Medioni G (1991) Object modeling by registration of multiple range images. Sacramento, CA, pp 2724–2729
Zhang Z (1994) Iterative point matching for registration of free-form curves and surfaces. Int J Comput Vision 13:119–152
Fitzgibbon AW (2001) Robust registration of 2D and 3D point sets. Image Vis Comput 21:1145–1153
Jost T, Hugli H (2003) A multi-resolution ICP with heuristic closest point search for fast and robust 3D registration of range images. In: Proceedings of 4th international conference on 3-D digital imaging and modeling. pp 427–433
Sharp GC, Lee SW, Wehe DK (2002) ICP registration using invariant features. IEEE Trans Pattern Anal Mach Intell 24:90–102
Silva L, Bellon ORP, Boyer KL (2005) Precision range image registration using a robust surface interpenetration measure and enhanced genetic algorithms. IEEE Trans Pattern Anal Mach Intell 27:762–776
Phillips JM, Ran L, Tomasi C (2007) Outlier robust ICP for minimizing fractional RMSD. In: Proceedings of 6th international conference on 3-D digital imaging and modeling. pp 427–434
Du S, Zheng N, Ying S, Liu J (2010) Affine iterative closest point algorithm for point set registration. Pattern Recogn Lett 31:791–799
Nuchter A, Lingemann K, Hertzberg J (2007) Cached k-d tree search for ICP algorithms. In: Proceedings of 6th international conference on 3-D digital imaging and modeling. pp 419–426
Barber CB, Dobkin DP, Huhdanpaa H (1996) The quickhull algorithm for convex hulls. ACM Trans Math Softw 22:469–483
Database of MPEG-7. http://mpeg.chiariglione.org/
Acknowledgments
This work is supported by the National Basic Research Program of China under Grant No. 2012CB316400 and the National Natural Science Foundation of China under Grant Nos. 61005014, 90920301, and 61005002.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, C., Du, S., Xue, J., Qi, X. (2014). Improved ICP Algorithm with Bounded Rotation Angle for 2D Point Set Registration. In: Sun, F., Hu, D., Liu, H. (eds) Foundations and Practical Applications of Cognitive Systems and Information Processing. Advances in Intelligent Systems and Computing, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37835-5_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-37835-5_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37834-8
Online ISBN: 978-3-642-37835-5
eBook Packages: EngineeringEngineering (R0)