Point Cloud Registrational Computing Based on Hadoop

Article Preview

Abstract:

For the problem of huge computation and requiring high computing resource in point cloud registration, according to the theory of parallel computing, the algorithm of point cloud registration base on MapReduce is designed. Through building a Hadoop cluster consisted by average PCs, four examples have been tested. The experiment results show that point cloud registration algorithm based on MapReduce can register point cloud data with high accuracy.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

4624-4629

Citation:

Online since:

September 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Zhu Yanjuan, Zhou Laishui, Zhang Liyan. Registration of Scattered Cloud Data. Journal of CAD&CG, 2006, 04: 475-481.

Google Scholar

[2] Hadoop[EB/OL]. [2011-12]. http: /hadoop. apache. org.

Google Scholar

[3] Jeffrey Dean. Experiences with MapReduce, an abstraction for large-scale computation. Proc. 15th International Conference on Parallel Architectures and Compilation Techniques, 2006.

DOI: 10.1145/1152154.1152155

Google Scholar

[4] Besl PJ, Mckay ND. A Method for Registration of 3-D Shapes. IEEE Transactions on PAMI. 1992, 14(2): 239-256.

Google Scholar

[5] Jonathan Campbell. Notes on Mathematics for 2D and 3D Graphics. Edition of 17. Letter Kenny Institute of Technology, (2007).

Google Scholar

[6] The Apache Software Foundation. Apache™ Hadoop®. [2013-04-23]. http: /hadoop. apache. org.

Google Scholar