Performance Analysis of Generalized Zerotree Coders Varying the Maximum Zerotree Degree
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.
KeywordsMultispectral Image Scalable Video Arithmetic Code Code Machine Action Table
Unable to display preview. Download preview PDF.
- 9.Danyali, H., Mertins, A.: Highly scalable image compression based on spiht for network applications. In: IEEE International Conference on Image Processing, Rochester,NY, USA (September 2002)Google Scholar
- 11.Cho, Y., Pearlman, W.A.: Quantifying the performance of zerotrees of wavelet coefficients: degree-k zerotree model. IEEE Trans. on Signal Processing 55(6), 2425–2431 (2007)Google Scholar
- 12.Cicala, L., Poggi, G.: A generalization of zerotree coding algorithms. In: Picture Coding Symposium, Lisbon, Portugal (November 2007)Google Scholar