• 图形图像 •

### 向量相似度可复原三维点云压缩算法

1. 太原理工大学 信息与计算机学院，太原 030000
• 出版日期:2020-04-01 发布日期:2020-04-10

### Recoverable 3D Point Cloud Compression Algorithm Based on Vector Similarity

ZHANG Xukang, NIU Baoning, ZHANG Jinwen

1. College of Information and Computer, Taiyuan University of Technology, Taiyuan 030000, China
• Online:2020-04-01 Published:2020-04-10

Abstract:

Data compression for 3D point cloud suffers from several problems, including difficult to preserve the feature details, over-compress, and difficult to restore a compressed model. To alleviate these problems, CVS (compression based on vector similarity), consisting of a compression algorithm and a restoration algorithm based on vector similarity is proposed. This paper proposes L3A (one length, three angles) for vector similarity metrics. CVS takes a 3D point as a 3D vector connecting its coordinates and origin. According to the reading order of the 3D coordinate points, reference vectors are selected to form sampling areas covering the entire point cloud, and each area is compressed independently. In the sampling area, the least squares surface fitting algorithm is used to perform surface fitting on the point cloud including the curve, the curvature threshold is set to eliminate the coordinate points, and the surface equation parameters are stored for restoration. By controlling the length and angle changing thresholds in the L3A vector similarity, the compression rate of the dense point cloud region is higher than that of the non-dense region, and by controlling the curvature threshold, the compression ratio of the low curvature region is higher than that of the high curvature region. The compression ratio preserves the model’s detail features to the utmost extent. CVS uses the recovery information generated by the compression phase to generate a point cloud to restore the detailed features of the model, making the model features more obvious.