Adaptive entropy-coded pruned tree-structured predictive vector quantization of images

Yong Han Kim, James W. Modestino

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In recent work, we described an adaptive entropy-coded predictive vector quantization (PVQ) scheme for images which was shown to be capable of excellent rate-distortion performance and to be surprisingly robust when applied to images outside the training set used in its design. This scheme made use of several entropy-constrained vector quantizers (ECVQ's), each with a corresponding Huffman encoder/decoder pair, embedded in a vector predictive feedback loop. The particular entropy-coded ECVQ in effect for any input image block depended upon the instantaneous occupancy state of a buffer used to interface the resulting variable-length codewords to a fixed-rate transmission or storage channel. This entropy-coded PVQ scheme is a vector extension of previous work on adaptive entropy-coded predictive scalar quantization (PSQ); in particular, 2-D DPCM. The embedded ECVQ in this adaptive entropy-coded PVQ scheme made use of a modification of a recently introduced design algorithm, based upon clustering, which resulted in unstructured codebooks. Unfortunately, the computational complexity associated with this unstructured embedded ECVQ can be substantial. In this paper we describe much simpler versions of this adaptive entropy-coded PVQ scheme where the embedded ECVQ is replaced by a pruned tree-structured VQ (PTSVQ). The resulting encoding scheme is shown to result in drastically reduced complexity at only a small cost in performance. We demonstrate coding results on selected real-world images.

Original languageEnglish
Pages (from-to)171-184
Number of pages14
JournalIEEE Transactions on Communications
Volume41
Issue number1
DOIs
StatePublished - Jan 1 1993

Fingerprint

Vector quantization
Entropy
Computational complexity
Feedback

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Adaptive entropy-coded pruned tree-structured predictive vector quantization of images. / Kim, Yong Han; Modestino, James W.

In: IEEE Transactions on Communications, Vol. 41, No. 1, 01.01.1993, p. 171-184.

Research output: Contribution to journalArticle

Kim, Yong Han ; Modestino, James W. / Adaptive entropy-coded pruned tree-structured predictive vector quantization of images. In: IEEE Transactions on Communications. 1993 ; Vol. 41, No. 1. pp. 171-184.
@article{f0bd94602295412bab83a7c0c728db02,
title = "Adaptive entropy-coded pruned tree-structured predictive vector quantization of images",
abstract = "In recent work, we described an adaptive entropy-coded predictive vector quantization (PVQ) scheme for images which was shown to be capable of excellent rate-distortion performance and to be surprisingly robust when applied to images outside the training set used in its design. This scheme made use of several entropy-constrained vector quantizers (ECVQ's), each with a corresponding Huffman encoder/decoder pair, embedded in a vector predictive feedback loop. The particular entropy-coded ECVQ in effect for any input image block depended upon the instantaneous occupancy state of a buffer used to interface the resulting variable-length codewords to a fixed-rate transmission or storage channel. This entropy-coded PVQ scheme is a vector extension of previous work on adaptive entropy-coded predictive scalar quantization (PSQ); in particular, 2-D DPCM. The embedded ECVQ in this adaptive entropy-coded PVQ scheme made use of a modification of a recently introduced design algorithm, based upon clustering, which resulted in unstructured codebooks. Unfortunately, the computational complexity associated with this unstructured embedded ECVQ can be substantial. In this paper we describe much simpler versions of this adaptive entropy-coded PVQ scheme where the embedded ECVQ is replaced by a pruned tree-structured VQ (PTSVQ). The resulting encoding scheme is shown to result in drastically reduced complexity at only a small cost in performance. We demonstrate coding results on selected real-world images.",
author = "Kim, {Yong Han} and Modestino, {James W.}",
year = "1993",
month = "1",
day = "1",
doi = "10.1109/26.212377",
language = "English",
volume = "41",
pages = "171--184",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Adaptive entropy-coded pruned tree-structured predictive vector quantization of images

AU - Kim, Yong Han

AU - Modestino, James W.

PY - 1993/1/1

Y1 - 1993/1/1

N2 - In recent work, we described an adaptive entropy-coded predictive vector quantization (PVQ) scheme for images which was shown to be capable of excellent rate-distortion performance and to be surprisingly robust when applied to images outside the training set used in its design. This scheme made use of several entropy-constrained vector quantizers (ECVQ's), each with a corresponding Huffman encoder/decoder pair, embedded in a vector predictive feedback loop. The particular entropy-coded ECVQ in effect for any input image block depended upon the instantaneous occupancy state of a buffer used to interface the resulting variable-length codewords to a fixed-rate transmission or storage channel. This entropy-coded PVQ scheme is a vector extension of previous work on adaptive entropy-coded predictive scalar quantization (PSQ); in particular, 2-D DPCM. The embedded ECVQ in this adaptive entropy-coded PVQ scheme made use of a modification of a recently introduced design algorithm, based upon clustering, which resulted in unstructured codebooks. Unfortunately, the computational complexity associated with this unstructured embedded ECVQ can be substantial. In this paper we describe much simpler versions of this adaptive entropy-coded PVQ scheme where the embedded ECVQ is replaced by a pruned tree-structured VQ (PTSVQ). The resulting encoding scheme is shown to result in drastically reduced complexity at only a small cost in performance. We demonstrate coding results on selected real-world images.

AB - In recent work, we described an adaptive entropy-coded predictive vector quantization (PVQ) scheme for images which was shown to be capable of excellent rate-distortion performance and to be surprisingly robust when applied to images outside the training set used in its design. This scheme made use of several entropy-constrained vector quantizers (ECVQ's), each with a corresponding Huffman encoder/decoder pair, embedded in a vector predictive feedback loop. The particular entropy-coded ECVQ in effect for any input image block depended upon the instantaneous occupancy state of a buffer used to interface the resulting variable-length codewords to a fixed-rate transmission or storage channel. This entropy-coded PVQ scheme is a vector extension of previous work on adaptive entropy-coded predictive scalar quantization (PSQ); in particular, 2-D DPCM. The embedded ECVQ in this adaptive entropy-coded PVQ scheme made use of a modification of a recently introduced design algorithm, based upon clustering, which resulted in unstructured codebooks. Unfortunately, the computational complexity associated with this unstructured embedded ECVQ can be substantial. In this paper we describe much simpler versions of this adaptive entropy-coded PVQ scheme where the embedded ECVQ is replaced by a pruned tree-structured VQ (PTSVQ). The resulting encoding scheme is shown to result in drastically reduced complexity at only a small cost in performance. We demonstrate coding results on selected real-world images.

UR - http://www.scopus.com/inward/record.url?scp=0027147133&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027147133&partnerID=8YFLogxK

U2 - 10.1109/26.212377

DO - 10.1109/26.212377

M3 - Article

AN - SCOPUS:0027147133

VL - 41

SP - 171

EP - 184

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 1

ER -