Trellis quantization for L∞-constrained compression with integer wavelets
Although integer wavelets have been successfully used in lossless signal compression, they have not been generalized to near-lossless (Linfin constrained) coding. This paper proposes a new technique of trellis quantization in the framework of lifting integer wavelet as a promising way of near-lossless signal compression. This new technique achieves continuous scalability of the wavelet code stream from highly lossy (low bit rates) to near-lossless (respecting a tight error bound on each decoded sample) reconstruction.