Entropy-constrained successively refinable scalar quantization

Hamid Jafarkhani; Hugh Brunk; Nariman Farvardin

Entropy-constrained successively refinable scalar quantization

Hamid Jafarkhani
, Hugh Brunk
, Nariman Farvardin

Department of Electrical and Computer Engineering

University of Maryland, College Park

Research output: Contribution to journal › Conference article › peer-review

16 Scopus citations

Abstract

We study the design of entropy-constrained successively refinable scalar quantizers. We propose two algorithms to minimize the average distortion and design such a quantizer. We consider two sets of constraints on the entropy: (i) constraint on the average rate and (ii) constraint on aggregate rates. Both algorithms can be easily extended to design vector quantizers.

Original language	English
Pages (from-to)	337-346
Number of pages	10
Journal	Data Compression Conference Proceedings
State	Published - 1997
Event	Proceedings of the 1997 Data Compression Conference, DCC'97 - Snowbird, UT, USA Duration: 25 Mar 1997 → 27 Mar 1997

Cite this

@article{ab79017221a54f828f40d501825672af,

title = "Entropy-constrained successively refinable scalar quantization",

abstract = "We study the design of entropy-constrained successively refinable scalar quantizers. We propose two algorithms to minimize the average distortion and design such a quantizer. We consider two sets of constraints on the entropy: (i) constraint on the average rate and (ii) constraint on aggregate rates. Both algorithms can be easily extended to design vector quantizers.",

author = "Hamid Jafarkhani and Hugh Brunk and Nariman Farvardin",

year = "1997",

language = "English",

pages = "337--346",

note = "Proceedings of the 1997 Data Compression Conference, DCC'97 ; Conference date: 25-03-1997 Through 27-03-1997",

}

TY - JOUR

T1 - Entropy-constrained successively refinable scalar quantization

AU - Jafarkhani, Hamid

AU - Brunk, Hugh

AU - Farvardin, Nariman

PY - 1997

Y1 - 1997

N2 - We study the design of entropy-constrained successively refinable scalar quantizers. We propose two algorithms to minimize the average distortion and design such a quantizer. We consider two sets of constraints on the entropy: (i) constraint on the average rate and (ii) constraint on aggregate rates. Both algorithms can be easily extended to design vector quantizers.

AB - We study the design of entropy-constrained successively refinable scalar quantizers. We propose two algorithms to minimize the average distortion and design such a quantizer. We consider two sets of constraints on the entropy: (i) constraint on the average rate and (ii) constraint on aggregate rates. Both algorithms can be easily extended to design vector quantizers.

UR - https://www.scopus.com/pages/publications/0030675160

UR - https://www.scopus.com/pages/publications/0030675160#tab=citedBy

M3 - Conference article

AN - SCOPUS:0030675160

SN - 1068-0314

SP - 337

EP - 346

JO - Data Compression Conference Proceedings

JF - Data Compression Conference Proceedings

T2 - Proceedings of the 1997 Data Compression Conference, DCC'97

Y2 - 25 March 1997 through 27 March 1997

ER -

Entropy-constrained successively refinable scalar quantization

Abstract

Other files and links

Fingerprint

Cite this