Arithmetic coding for data compression
Communications of the ACM
Progressive geometry compression
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
FAST AND EFFICIENT SPATIAL SCALABLE IMAGE COMPRESSION USING WAVELET LOWER TREES
DCC '03 Proceedings of the Conference on Data Compression
High performance scalable image compression with EBCOT
IEEE Transactions on Image Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
IEEE Transactions on Circuits and Systems for Video Technology
Comparison of wavelet-based three-dimensional model coding techniques
IEEE Transactions on Circuits and Systems for Video Technology
3D game content distributed adaptation in heterogeneous environments
EURASIP Journal on Advances in Signal Processing
Low bit-rate video coding with 3d lower trees (3D-LTW)
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Fast 3D wavelet transform on multicore and many-core computing platforms
The Journal of Supercomputing
| Hi-index | 0.00 |
We perform an in-depth analysis of current state-of-the-art waveletbased 3D model coding techniques and then present a new one that outperforms them in terms of compression efficiency and, more importantly, provides full spatial and SNR scalability: PLTW (Progressive Lower Tree Wavelet) coding. As all SNR scalable bit-streams, ours can be used in heterogeneous networks with a wide range of terminals, both in terms of processing power and bandwidth. But because of being spatially scalable, the PLTW bit-stream does not impose on the less powerful terminals the need of building detail trees as deep as required by the maximum LOD, because the wavelet coefficients are sent on a per-LOD basis, thus achieving a “local” SNR scalability within a “global” spatial scalability. In particular, we show that our technique provides a substantial advantage over the only similar one in a current ISO standard (MPEG-4), and thus suggest that PLTW be considered for its future versions.