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. In this work we show that any zerotree coder can be described by specifying the involved data structures (typically, order-k zerotrees) and a very limited set of tree decomposition rules. This simple grammar allows one to easily design and implement new zerotree coders, with performance sometimes superior to existing algorithms.
A generalization of zerotree coding algorithms / Cicala, Luca; Poggi, Giovanni. - STAMPA. - (2007), pp. 1-4. (Intervento presentato al convegno Picture Coding Symposium tenutosi a Lisbona (Por) nel novembre 2007).
A generalization of zerotree coding algorithms
CICALA, LUCA;POGGI, GIOVANNI
2007
Abstract
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. In this work we show that any zerotree coder can be described by specifying the involved data structures (typically, order-k zerotrees) and a very limited set of tree decomposition rules. This simple grammar allows one to easily design and implement new zerotree coders, with performance sometimes superior to existing algorithms.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.