Study on Improved Point Cloud Compression Algorithm with Features Reserved

Article Preview

Abstract:

We introduce an improved compressing algorithm with features reserved for point cloud. Divided-box method is employed for compressing algorithm to improve the neighbor field searching efficiency, with which normal vector and curvature of points are calculated, and feature points are reserved according to reducing rule, finally, based on the octree theory, the smallest grid is refined until which reaches the minimum requirements, then reserve the most representative point of the smallest grid, remove the other points, and data reduction is done. Experimental results show that the compression algorithm conserved the features of point cloud with high efficiency.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

470-473

Citation:

Online since:

June 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Hongfei Zhang, Xiaojun Cheng and Yintao Shi. Study on 3D Modeling for History Building and Precision Analyzing. 2010 The 2nd Conference on Future Computer and Communication. IEEE, Sep. (2010).

Google Scholar

[2] S-M Hur, H-C Kim, S-H Lee. STL File Generation with Data Reduction by the Delaunay Triangulation Method in Reverse Engineering. The International Journal of Advanced Manufacturing Technology. Vol.19 (2002), pp.669-678.

DOI: 10.1007/s001700200112

Google Scholar

[3] WU Shi-xiong etc. Adaptive data compression for massive scan data. Journal of Zhejiang University (Engineering Science), Vol.38 (2004), pp.1200-1204.

Google Scholar

[4] SHI Zhen-zhong etc. Present cond ition and improvement of calculate way rese arch of point cloud data compression in contrary engineering. Journal of Jiangsu University (Natural Science Edition), , Vol.27(2006),pp.35-39.

Google Scholar

[5] SHAO Zheng-wei, XI Ping. Data Reduction for Point Cloud Using Octree Coding. JOURNAL OF ENGINEERING GRAPHICS, Vol.4 (2010), pp.73-76.

Google Scholar