We introduce a novel universal refinable trellis quantization scheme (URTCQ) that is suitable for bitplane coding with many reconstruction stages. Existing refinable trellis quantizers either require excessive codebook training and are outperformed by scalar quantization for more than two stages (MS-TCQ, E-TCQ), require a huge computational burden (SR-TCQ) or achieve a good rate distortion performance in the last stage only (UTCQ). The presented quantization technique is a mixture of a scalar quantizer and an improved version of the E-TCQ. For all supported sources only one time training to an i.i.d. uniform source is required and its incremental bitrate is not more than 1 bps for each stage. The complexity is proportional to the number of stages and the number of trellis states. We compare the rate distortion performance of our work on generalized Gaussian i.i.d. sources with the quantizers deployed in JPEG2000 (USDZQ, UTCQ). It turns out that it is in no stage worse than the scalar quantizer and usually outperforms the UTCQ except for the last stage.
%0 Conference Paper
%1 4976475
%A Steger, S.
%A Richter, T.
%B Data Compression Conference, 2009. DCC '09.
%D 2009
%K (signal);trellis coded codes;bitplane coding;Image coding;codebook coding;embedded coding;progressive coding;residual compression;Decoding;Distortion distortion measurement;Image performance;scalar quantisation quantization quantization;Bit quantization;universal quantizer;trellis rate;Data reconstruction;Quantization;Rate refinable theory;Rate-distortion;Transform training;rate trellis
%P 312-321
%R 10.1109/DCC.2009.16
%T Universal Refinable Trellis Coded Quantization
%U http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4976475
%X We introduce a novel universal refinable trellis quantization scheme (URTCQ) that is suitable for bitplane coding with many reconstruction stages. Existing refinable trellis quantizers either require excessive codebook training and are outperformed by scalar quantization for more than two stages (MS-TCQ, E-TCQ), require a huge computational burden (SR-TCQ) or achieve a good rate distortion performance in the last stage only (UTCQ). The presented quantization technique is a mixture of a scalar quantizer and an improved version of the E-TCQ. For all supported sources only one time training to an i.i.d. uniform source is required and its incremental bitrate is not more than 1 bps for each stage. The complexity is proportional to the number of stages and the number of trellis states. We compare the rate distortion performance of our work on generalized Gaussian i.i.d. sources with the quantizers deployed in JPEG2000 (USDZQ, UTCQ). It turns out that it is in no stage worse than the scalar quantizer and usually outperforms the UTCQ except for the last stage.
@inproceedings{4976475,
abstract = {We introduce a novel universal refinable trellis quantization scheme (URTCQ) that is suitable for bitplane coding with many reconstruction stages. Existing refinable trellis quantizers either require excessive codebook training and are outperformed by scalar quantization for more than two stages (MS-TCQ, E-TCQ), require a huge computational burden (SR-TCQ) or achieve a good rate distortion performance in the last stage only (UTCQ). The presented quantization technique is a mixture of a scalar quantizer and an improved version of the E-TCQ. For all supported sources only one time training to an i.i.d. uniform source is required and its incremental bitrate is not more than 1 bps for each stage. The complexity is proportional to the number of stages and the number of trellis states. We compare the rate distortion performance of our work on generalized Gaussian i.i.d. sources with the quantizers deployed in JPEG2000 (USDZQ, UTCQ). It turns out that it is in no stage worse than the scalar quantizer and usually outperforms the UTCQ except for the last stage.},
added-at = {2016-03-03T17:45:04.000+0100},
author = {Steger, S. and Richter, T.},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2129ef12bf4cd76de2771395baf389fb4/rainerreichel},
booktitle = {Data Compression Conference, 2009. DCC '09.},
doi = {10.1109/DCC.2009.16},
interhash = {35306931e0653b50d572d8534660dde9},
intrahash = {129ef12bf4cd76de2771395baf389fb4},
issn = {1068-0314},
keywords = {(signal);trellis coded codes;bitplane coding;Image coding;codebook coding;embedded coding;progressive coding;residual compression;Decoding;Distortion distortion measurement;Image performance;scalar quantisation quantization quantization;Bit quantization;universal quantizer;trellis rate;Data reconstruction;Quantization;Rate refinable theory;Rate-distortion;Transform training;rate trellis},
month = mar,
pages = {312-321},
timestamp = {2016-03-04T09:57:29.000+0100},
title = {{U}niversal {R}efinable {T}rellis {C}oded {Q}uantization},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4976475},
year = 2009
}
