×

Two-stage multiple description image coding using TCQ. (English) Zbl 1187.68657

Summary: We incorporate Trellis Coded Quantization (TCQ) into a two-stage multiple description coding structure to obtain granular gain over two-stage multiple description Scalar Quantizer (SQ). Analysis and experiment on Gaussian signal show that the performance of the proposed scheme can achieve larger gain than that of the two-stage SQ scheme because of better performance of TCQ. The proposed scheme for image coding is shown to be more effective than other relevant multiple description image coding schemes in terms of central-side-distortion rate performance.

MSC:

68U10 Computing methodologies for image processing
68P30 Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
94A08 Image processing (compression, reconstruction, etc.) in information and communication theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1109/18.651044 · Zbl 0906.94009 · doi:10.1109/18.651044
[2] DOI: 10.1109/18.256491 · Zbl 0784.94009 · doi:10.1109/18.256491
[3] DOI: 10.1109/83.841528 · doi:10.1109/83.841528
[4] DOI: 10.1109/18.930913 · Zbl 0999.94015 · doi:10.1109/18.930913
[5] DOI: 10.1109/TCSVT.2007.898646 · Zbl 05451796 · doi:10.1109/TCSVT.2007.898646
[6] DOI: 10.1016/j.image.2006.04.001 · doi:10.1016/j.image.2006.04.001
[7] DOI: 10.1109/26.46532 · doi:10.1109/26.46532
[8] DOI: 10.1109/76.894278 · Zbl 05450838 · doi:10.1109/76.894278
[9] DOI: 10.1142/S0219691308002641 · Zbl 1154.94327 · doi:10.1142/S0219691308002641
[10] DOI: 10.1109/LSP.2008.2005044 · doi:10.1109/LSP.2008.2005044
[11] DOI: 10.1142/S0219691308002501 · Zbl 1157.68491 · doi:10.1142/S0219691308002501
[12] DOI: 10.1109/TIP.2007.891152 · Zbl 05453770 · doi:10.1109/TIP.2007.891152
[13] DOI: 10.1109/TIP.2006.884935 · Zbl 05453820 · doi:10.1109/TIP.2006.884935
[14] DOI: 10.1109/LSP.2006.883986 · doi:10.1109/LSP.2006.883986
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.