Abstract | ||
---|---|---|
We propose a generic point cloud encoder that compresses geometry data including positions and normals of point samples corresponding to 3D objects with arbitrary topology. In this work, the coding process is led by an iterative octree cell subdivision of the object space. At each level of subdivision, positions of point samples are approximated by the geometry centers of all tree-front cells while normals are approximated by their statistical average within each of the tree-front cells. With this framework, we employ attribute-dependent encoding techniques to exploit different characteristics of various attributes. As a result, significant improvement in the rate-distortion (R-D) performance has been obtained with respect to the prior art. Furthermore, the proposed point cloud encoder can be potentially used for lossless geometry coding of 3D point clouds, given sufficient levels of octree expansion and normal space partitioning. |
Year | DOI | Venue |
---|---|---|
2006 | 10.2312/SPBG/SPBG06/103-110 | SPBG |
Keywords | Field | DocType |
coding process,octree-based progressive geometry,point sample,geometry center,proposed point cloud encoder,point cloud,iterative octree cell subdivision,lossless geometry,generic point cloud encoder,compresses geometry data,tree-front cell,information theory,generic point | Normal space,Generic point,Algorithm,Theoretical computer science,Subdivision,Encoder,Point cloud,Mathematics,Octree,Encoding (memory),Lossless compression | Conference |
ISBN | Citations | PageRank |
3-905673-32-0 | 28 | 1.29 |
References | Authors | |
26 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yan Huang | 1 | 976 | 35.15 |
Jingliang Peng | 2 | 532 | 27.24 |
C.-C. Jay Kuo | 3 | 7524 | 697.44 |
M. Gopi | 4 | 272 | 24.83 |