Two Access Methods Using Compact Binary Trees
IEEE Transactions on Software Engineering
Real-time, continuous level of detail rendering of height fields
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Introduction to Algorithms
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
Context Modeling based Depth Image Compression for Distributed Virtual Environment
CW '03 Proceedings of the 2003 International Conference on Cyberworlds
Comparative Analysis of Arithmetic Coding Computational Complexity
DCC '04 Proceedings of the Conference on Data Compression
Depth map compression for real-time view-based rendering
Pattern Recognition Letters - Video computing
High-quality video view interpolation using a layered representation
ACM SIGGRAPH 2004 Papers
Image compression by linear splines over adaptive triangulations
Signal Processing
Content adaptive mesh representation of images using binary space partitions
IEEE Transactions on Image Processing
High-accuracy stereo depth maps using structured light
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
A fast approach for accurate content-adaptive mesh generation
IEEE Transactions on Image Processing
IEEE Transactions on Circuits and Systems for Video Technology
Server-based rendering of large 3D scenes for mobile devices using G-buffer cube maps
Proceedings of the 17th International Conference on 3D Web Technology
| Hi-index | 0.00 |
We propose in this paper a new method based on binary space partitions to simultaneously mesh and compress a depth map. The method divides the map adaptively into a mesh that has the form of a binary triangular tree (tritree). The nodes of the mesh are the sparse non-uniform samples of the depth map and are able to interpolate the other pixels with minimal error. We apply differential coding after that to represent the sparse disparities at the mesh nodes. We then use entropy coding to compress the encoded disparities. We finally benefit from the binary tree and compress the mesh via binary tree coding to condense its representation. The results we obtained on various depth images show that the proposed scheme leads to lower depth error rate at higher compression ratios when compared to standard compression techniques like JPEG 2000. Moreover, using our method, a depth map is represented with a compressed adaptive mesh that can be directly applied to render the 3D scene.