Progressive lower trees of wavelet coefficients: Efficient spatial and SNR scalable coding of 3D models

15Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We perform an in-depth analysis of current state-of-the-art wavelet-based 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 band-width. 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 ́locaĺ SNR scalability within a ́globaĺ 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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Avilés, M., Morán, F., & García, N. (2005). Progressive lower trees of wavelet coefficients: Efficient spatial and SNR scalable coding of 3D models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3767 LNCS, pp. 61–72). Springer Verlag. https://doi.org/10.1007/11581772_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free