A modified ICP algorithm based on dynamic adjustment factor for registration of point cloud and CAD model

被引:57
作者
Li, Weimin [1 ]
Song, Pengfei [1 ]
机构
[1] Univ Sci & Technol China, Dept Accuracy Machinery & Accuracy Instrumentat, Hefei 230026, Anhui, Peoples R China
基金
中国国家自然科学基金;
关键词
Point cloud; Registration; CAD model; ICP algorithm; STL triangular mesh;
D O I
10.1016/j.patrec.2015.07.019
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a modified ICP algorithm based On dynamic adjustment factor to speed up registration of point cloud and CAD model with high accuracy. The algorithm comes from a two-step optimization on the basic of original ICP. First, aiming at original ICP algorithm's time consuming in searching for corresponding point, we present a novel solution to search for the corresponding point based on STL (STereo Lithography) triangular mesh in CAD model. The solution makes full use of the advantages of STL file which consists of lists of facet data and vector information of triangular mesh to search for point cloud's corresponding points. Second, aiming at the algorithm's very slow iterative process, we put forward a kind of dynamic adjustment factor the factor of dynamically adjusting the rigid transformation parameters which can make point cloud over-travel by rigid transformation along original trend in each iteration. When adding dynamic adjustment factor, the algorithm could search more effective corresponding points in next iteration, thus reducing the number of iterations and speeding up the registration. Experiments show that the modified ICP can effectively reduce time consuming in registration of point cloud and CAD model, meanwhile iinproving the registration accuracy. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:88 / 94
页数:7
相关论文
共 14 条
[1]  
Al-Durgham M, 2011, INT ARCH PHOTOGRAMM, V38-5, P61
[2]   MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517
[3]   Towards a general multi-view registration technique [J].
Bergevin, R ;
Soucy, M ;
Gagnon, H ;
Laurendeau, D .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1996, 18 (05) :540-547
[4]   Repeated surface registration for on-line use [J].
Bergstrom, Per ;
Edlund, Ove ;
Soderkvist, Inge .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 54 (5-8) :677-689
[5]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[6]   REGISTERING MULTIVIEW RANGE DATA TO CREATE 3D COMPUTER OBJECTS [J].
BLAIS, G ;
LEVINE, MD .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1995, 17 (08) :820-824
[7]   OBJECT MODELING BY REGISTRATION OF MULTIPLE RANGE IMAGES [J].
CHEN, Y ;
MEDIONI, G .
IMAGE AND VISION COMPUTING, 1992, 10 (03) :145-155
[8]   Approximate k-d tree search for efficient ICP [J].
Greenspan, M ;
Yurick, M .
FOURTH INTERNATIONAL CONFERENCE ON 3-D DIGITAL IMAGING AND MODELING, PROCEEDINGS, 2003, :442-448
[9]   A nearest neighbor method for efficient ICP [J].
Greenspan, M ;
Godin, G .
THIRD INTERNATIONAL CONFERENCE ON 3-D DIGITAL IMAGING AND MODELING, PROCEEDINGS, 2001, :161-168
[10]   An accurate and fast point-to-plane registration technique [J].
Park, SY ;
Subbarao, M .
PATTERN RECOGNITION LETTERS, 2003, 24 (16) :2967-2976