Algorithm Design of Global Point Cloud Registration Based on BSP Model

DOI

10.2991/meic-15.2015.239How to use a DOI?

Keywords

Point cloud; Registration; Parallel computing; BSP model; Hama

Abstract

Registrations of multi-angle point cloud involve enormous point cloud data, complicated and heavy computation. Previous non-parallel method is strong computing resources demanding and low performance of point cloud global registration. Bulk Synchronous Parallel Computing Model (BSP) processes the data with a parallel computing method, which can be applied to huge computation such as point cloud data processing. We design a point cloud global registration algorithm base on BSP model and build a Hama parallel computing cluster with average PCs. The results of four engineering examples show that the registration algorithm base on BSP model reduces computing resources requirements, accomplishes global registration with acceptable accuracy and improves the efficiency of registration. The Hama computing cluster we built is implementation simplicity and ease of point cloud processing. The improvement thought and implementation method can extend to other point clouds processing like filters, rendering, modeling and so on.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Song Liu
AU  - Xiaoyao Xie
PY  - 2015/04
DA  - 2015/04
TI  - Algorithm Design of Global Point Cloud Registration Based on BSP Model
BT  - Proceedings of the 2015 International Conference on Mechatronics, Electronic, Industrial and Control Engineering
PB  - Atlantis Press
SP  - 1050
EP  - 1054
SN  - 2352-5401
UR  - https://doi.org/10.2991/meic-15.2015.239
DO  - 10.2991/meic-15.2015.239
ID  - Liu2015/04
ER  -