2021
DOI: 10.3390/s22010197
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Point Cloud Compression Based on Projections, Surface Reconstruction and Video Compression

Abstract: In this paper we will present a new dynamic point cloud compression based on different projection types and bit depth, combined with the surface reconstruction algorithm and video compression for obtained geometry and texture maps. Texture maps have been compressed after creating Voronoi diagrams. Used video compression is specific for geometry (FFV1) and texture (H.265/HEVC). Decompressed point clouds are reconstructed using a Poisson surface reconstruction algorithm. Comparison with the original point clouds… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 37 publications
(49 reference statements)
0
5
0
Order By: Relevance
“…In contrast, geometry-based compression, G-PCC, encodes the content directly in the 3D space. While V-PCC applies the existing 2D video compression approach to a collection of various 2D pictures transformed from the 3D point data, GPCC applies Octree and K-D tree data structures to describe the placement of the points and their vicinities in the 3D space [28][29][30][31] . As V-PCC stands as the current state-of-the-art in dynamic point cloud compression, this section introduces recent literature focused on enhancing the efficiency of V-PCC:…”
Section: Literature Reviewmentioning
confidence: 99%
“…In contrast, geometry-based compression, G-PCC, encodes the content directly in the 3D space. While V-PCC applies the existing 2D video compression approach to a collection of various 2D pictures transformed from the 3D point data, GPCC applies Octree and K-D tree data structures to describe the placement of the points and their vicinities in the 3D space [28][29][30][31] . As V-PCC stands as the current state-of-the-art in dynamic point cloud compression, this section introduces recent literature focused on enhancing the efficiency of V-PCC:…”
Section: Literature Reviewmentioning
confidence: 99%
“…Different methods exist to compress point cloud data [ 33 , 34 , 35 ]; most of them perform compression of point cloud geometry using octree coding [ 36 ], where data are transformed into voxel representation, in order to appropriately exploit volumetric redundancy, and are then partitioned until sub-cubes of dimension one are reached; local approximations called “triangle soups” (trisoup) can be adopted, where the geometry can be represented by a pruned octree plus a surface model [ 36 , 37 ].…”
Section: Related Workmentioning
confidence: 99%
“…To assess the visual quality of the compressed images generated, both objective and subjective methods of image quality evaluation are used [ 8 ]. These two types of methods are mentioned in many studies, and are used both in traditional and learning-based image codecs performance evaluation [ 9 ].…”
Section: Introductionmentioning
confidence: 99%