Robust iterative closest point algorithm with bounded rotation angle for 2D registration
Authors:
- Chunjia ZhangCZChunjia Zhang
- Shaoyi DuSDShaoyi Du
- Juan LiuJLJuan Liu
- Yongxin LiYLYongxin Li
- Jianru XueJXJianru Xue
- Yuehu LiuYLYuehu Liu
- 1 June 2016
- journal article
- Published by Elsevier in Neurocomputing
- Vol. 195, 172-180
Abstract
No abstract availableKeywords
Funding Information
- Project 211 (B13043)
- Fundamental Research Funds for the Central Universities (2013jdhz02)
- National Natural Science Foundation of China (61573274, 91320301)
- Natural Science Foundation of Shaanxi Province (2014JM8336)
- National Key Research and Development Program of China (2015CB351703)
- National High-tech Research and Development Program (2013AA014601)
This publication has 34 references indexed in Scilit:
- Affine iterative closest point algorithm for point set registrationPattern Recognition Letters, 2010
- A fast algorithm for ICP-based 3D shape biometricsComputer Vision and Image Understanding, 2007
- Robust registration of 2D and 3D point setsImage and Vision Computing, 2003
- The dual-bootstrap iterative closest point algorithm with application to retinal image registrationIEEE Transactions on Medical Imaging, 2003
- ICP registration using invariant featuresIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- An orientation reliability matrix for the iterative closest point algorithmIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- The quickhull algorithm for convex hullsACM Transactions on Mathematical Software, 1996
- A method for registration of 3-D shapesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1992
- Analysis of a complex of statistical variables into principal components.Journal of Educational Psychology, 1933
- LIII. On lines and planes of closest fit to systems of points in spaceJournal of Computers in Education, 1901