TREE POINT CLOUDS REGISTRATION USING AN IMPROVED ICP ALGORITHM BASED ON KD-TREE

被引：26
|
作者：
Li, Shihua [1 ]
Wang, Jingxian [1 ]
Liang, Zuqin [1 ]
Su, Lian [1 ]
机构：
[1] Univ Elect Sci & Technol China, Sch Resources & Environm, West Hitech Zone, 2006 Xiyuan Ave, Chengdu 611731, Peoples R China
来源：
2016 IEEE INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM (IGARSS) | 2016年
基金：
中国国家自然科学基金;
关键词：
LiDAR; point cloud data; registration; Iterative Closest Point (ICP); k-d tree; LIDAR DATA;
D O I：
10.1109/IGARSS.2016.7730186
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
The light detection and ranging (LiDAR) technology plays an important role in obtaining the three-dimensional information. A large number of point cloud data of the objects can be obtained through the LiDAR technology. The Iterative Closest Point (ICP) algorithm was widely used for registering the point cloud data, which typically only scan an object from one direction at a time. However, massive point cloud data has brought a great number of troubles to this registration method. The k-d tree is similar to the general tree structure and it can store, manage and search data efficiently. Therefore, an improved ICP algorithm which based on k-d tree was presented for tree point cloud data registration in this paper. The results showed that the improved ICP algorithm can improve the speed of registration about 10 times higher, and it also has obvious advantages in accuracy of registration.
引用
收藏
页码：4545 / 4548
页数：4
相关论文
共 50 条
  • [1] Mining Hidden Communities in Social Networks Using KD-Tree and Improved KD-Tree
    Devi, Renuga R.
    Hemalatha, M.
    [J]. 2013 FOURTH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS AND NETWORKING TECHNOLOGIES (ICCCNT), 2013,
  • [2] The quantized kd-tree: Efficient ray tracing of compressed point clouds
    Hubo, Erik
    Mertens, Tom
    Haber, Tom
    Bekaert, Philippe
    [J]. RT 06: IEEE SYMPOSIUM ON INTERACTIVE RAY TRACING 2006, PROCEEDINGS, 2006, : 105 - +
  • [3] FuseFPS: Accelerating Farthest Point Sampling with Fusing KD-tree Construction for Point Clouds
    Han, Meng
    Wang, Liang
    Xiao, Limin
    Zhang, Hao
    Zhang, Chenhao
    Xie, Xilong
    Zheng, Shuai
    Dong, Jin
    [J]. 29TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, ASP-DAC 2024, 2024, : 238 - 243
  • [4] Improved K-Means Clustering Algorithm Based on KD-Tree Approach
    Bhardwaj, Manish
    Adane, Dattatraya
    [J]. BIOSCIENCE BIOTECHNOLOGY RESEARCH COMMUNICATIONS, 2020, 13 (14): : 160 - 163
  • [5] Density Clustering Algorithm Based on KD-Tree and Voting Rules
    Du, Hui
    Hu, Zhiyuan
    Lu, Depeng
    Liu, Jingrui
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2024, 79 (02): : 3239 - 3259
  • [6] cKd-tree: A Compact Kd-tree
    Gutierrez, Gilberto
    Torres-Aviles, Rodrigo
    Caniupan, Monica
    [J]. IEEE ACCESS, 2024, 12 : 28666 - 28676
  • [7] KD-tree based parallel adaptive rendering
    Liu, Xiao-Dan
    Wu, Jia-Ze
    Zheng, Chang-Wen
    [J]. VISUAL COMPUTER, 2012, 28 (6-8): : 613 - 623
  • [8] Texture segmentation algorithm based on wavelet transform and kd-tree clustering
    Yang, GS
    Hou, YL
    Huang, CY
    [J]. 2004 IEEE CONFERENCE ON ROBOTICS, AUTOMATION AND MECHATRONICS, VOLS 1 AND 2, 2004, : 987 - 990
  • [9] KD-tree based parallel adaptive rendering
    Xiao-Dan Liu
    Jia-Ze Wu
    Chang-Wen Zheng
    [J]. The Visual Computer, 2012, 28 : 613 - 623
  • [10] kd-Tree Traversal Techniques
    Tsakok, John A.
    Bishop, William
    Kennings, Andrew
    [J]. RT08: IEEE/EG SYMPOSIUM ON INTERACTIVE RAY TRACING 2008, PROCEEDINGS, 2008, : 190 - 190
12345