Quantifying the Coding Performance of Zerotrees of Wavelet Coefficients: Degree-k Zerotree
IEEE Transactions on Signal Processing
High performance scalable image compression with EBCOT
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
Region-Based Transform Coding of Multispectral Images
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
Low bit-rate scalable video coding with 3-D set partitioning in hierarchical trees (3-D SPIHT)
IEEE Transactions on Circuits and Systems for Video Technology
Optimal 3-D coefficient tree structure for 3-D wavelet video coding
IEEE Transactions on Circuits and Systems for Video Technology
Efficient, low-complexity image coding with a set-partitioning embedded block coder
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
Despite the release of the JPEG-2000 standard, wavelet-based zerotree coders keep being object of intense research because of their conceptual simplicity and excellent performance. Recently, it has been shown that all zerotree coders can be described by specifying the involved data structures (typically, degree-k zerotrees) and a very limited set of tree decomposition rules, leading to the class of generalized zerotree coders (GZC). Thanks to this abstraction, defining and implementing new coders of this class becomes straightforward. In this work, we then investigate, by means of numerical experiments on various types of visual sources, the performance achievable by such coders as a function of the degree of the underlying zerotrees.