Multistage storage- and entropy-constrained tree-structured vector quantization

Wen-Jyi Hwang, Haluk Derin

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This paper proposes a new algorithm for the design of a tree-structured vector quantizer that operates under storage and entropy constraints; hence, it is called the storage- and entropy-constrained tree-structured vector quantizer (SECTSVQ). The algorithm uses the tree-growing approach and designs the tree one stage/layer at a time. The constraints on the rate and storage size, i.e., the number of nodes or codewords, at each stage are specified prior to the design procedure. While growing the tree, at each stage the algorithm optimally allocates the rate and the number of nodes available for the current stage to the nodes of the previous stage using the dynamic programming technique. The nodes of the current stage are then determined based on the allocations. In addition to being useful as a tree-structured VQ, SECTSVQ is particularly suited for application in progressive transmission. Moreover, the optimal allocation technique used in the design can be effectively applied to other optimal resource allocation problems. The SECTSVQ algorithm is implemented for various sources and is shown to compare favorably with other VQ's.

Original languageEnglish
Pages (from-to)1801-1810
Number of pages10
JournalIEEE Transactions on Signal Processing
Volume44
Issue number7
DOIs
Publication statusPublished - 1996 Dec 1

Fingerprint

Vector quantization
Entropy
Dynamic programming
Resource allocation

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Multistage storage- and entropy-constrained tree-structured vector quantization. / Hwang, Wen-Jyi; Derin, Haluk.

In: IEEE Transactions on Signal Processing, Vol. 44, No. 7, 01.12.1996, p. 1801-1810.

Research output: Contribution to journalArticle

@article{b09607720542462ca88cb2dd73a563dd,
title = "Multistage storage- and entropy-constrained tree-structured vector quantization",
abstract = "This paper proposes a new algorithm for the design of a tree-structured vector quantizer that operates under storage and entropy constraints; hence, it is called the storage- and entropy-constrained tree-structured vector quantizer (SECTSVQ). The algorithm uses the tree-growing approach and designs the tree one stage/layer at a time. The constraints on the rate and storage size, i.e., the number of nodes or codewords, at each stage are specified prior to the design procedure. While growing the tree, at each stage the algorithm optimally allocates the rate and the number of nodes available for the current stage to the nodes of the previous stage using the dynamic programming technique. The nodes of the current stage are then determined based on the allocations. In addition to being useful as a tree-structured VQ, SECTSVQ is particularly suited for application in progressive transmission. Moreover, the optimal allocation technique used in the design can be effectively applied to other optimal resource allocation problems. The SECTSVQ algorithm is implemented for various sources and is shown to compare favorably with other VQ's.",
author = "Wen-Jyi Hwang and Haluk Derin",
year = "1996",
month = "12",
day = "1",
doi = "10.1109/78.510626",
language = "English",
volume = "44",
pages = "1801--1810",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Multistage storage- and entropy-constrained tree-structured vector quantization

AU - Hwang, Wen-Jyi

AU - Derin, Haluk

PY - 1996/12/1

Y1 - 1996/12/1

N2 - This paper proposes a new algorithm for the design of a tree-structured vector quantizer that operates under storage and entropy constraints; hence, it is called the storage- and entropy-constrained tree-structured vector quantizer (SECTSVQ). The algorithm uses the tree-growing approach and designs the tree one stage/layer at a time. The constraints on the rate and storage size, i.e., the number of nodes or codewords, at each stage are specified prior to the design procedure. While growing the tree, at each stage the algorithm optimally allocates the rate and the number of nodes available for the current stage to the nodes of the previous stage using the dynamic programming technique. The nodes of the current stage are then determined based on the allocations. In addition to being useful as a tree-structured VQ, SECTSVQ is particularly suited for application in progressive transmission. Moreover, the optimal allocation technique used in the design can be effectively applied to other optimal resource allocation problems. The SECTSVQ algorithm is implemented for various sources and is shown to compare favorably with other VQ's.

AB - This paper proposes a new algorithm for the design of a tree-structured vector quantizer that operates under storage and entropy constraints; hence, it is called the storage- and entropy-constrained tree-structured vector quantizer (SECTSVQ). The algorithm uses the tree-growing approach and designs the tree one stage/layer at a time. The constraints on the rate and storage size, i.e., the number of nodes or codewords, at each stage are specified prior to the design procedure. While growing the tree, at each stage the algorithm optimally allocates the rate and the number of nodes available for the current stage to the nodes of the previous stage using the dynamic programming technique. The nodes of the current stage are then determined based on the allocations. In addition to being useful as a tree-structured VQ, SECTSVQ is particularly suited for application in progressive transmission. Moreover, the optimal allocation technique used in the design can be effectively applied to other optimal resource allocation problems. The SECTSVQ algorithm is implemented for various sources and is shown to compare favorably with other VQ's.

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

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

U2 - 10.1109/78.510626

DO - 10.1109/78.510626

M3 - Article

AN - SCOPUS:0030196814

VL - 44

SP - 1801

EP - 1810

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 7

ER -