Optimal rate allocation for entropy-coded uniform scalar quantization of dependent sources in nonbinary hypothesis testing

Ali Tabesh; Michael W. Marcellin; Mark A Neifeld

doi:10.1109/TCOMM.2010.01.080310

Optimal rate allocation for entropy-coded uniform scalar quantization of dependent sources in nonbinary hypothesis testing

Ali Tabesh, Michael W. Marcellin, Mark A Neifeld

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We propose a closed-form rate allocation scheme (RAS) for entropy-coded uniform scalar quantization of dependent sources in classification problems. The proposed RAS is applicable to nonbinary classification with piecewise monotonic unquantized Bayes decision boundaries. The RAS is also extended to joint compression and classification.

Original language	English (US)
Article number	5397889
Pages (from-to)	16-20
Number of pages	5
Journal	IEEE Transactions on Communications
Volume	58
Issue number	1
DOIs	https://doi.org/10.1109/TCOMM.2010.01.080310
State	Published - Jan 2010

Keywords

Entropy-coded uniform scalar quantization
Joint compression and classification
Nonbinary classification
Rate allocation

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/TCOMM.2010.01.080310

Cite this

@article{3f2f3ced484f4823af0bc5afd45d5981,

title = "Optimal rate allocation for entropy-coded uniform scalar quantization of dependent sources in nonbinary hypothesis testing",

abstract = "We propose a closed-form rate allocation scheme (RAS) for entropy-coded uniform scalar quantization of dependent sources in classification problems. The proposed RAS is applicable to nonbinary classification with piecewise monotonic unquantized Bayes decision boundaries. The RAS is also extended to joint compression and classification.",

keywords = "Entropy-coded uniform scalar quantization, Joint compression and classification, Nonbinary classification, Rate allocation",

author = "Ali Tabesh and Marcellin, {Michael W.} and Neifeld, {Mark A}",

year = "2010",

month = jan,

doi = "10.1109/TCOMM.2010.01.080310",

language = "English (US)",

volume = "58",

pages = "16--20",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - Optimal rate allocation for entropy-coded uniform scalar quantization of dependent sources in nonbinary hypothesis testing

AU - Tabesh, Ali

AU - Marcellin, Michael W.

AU - Neifeld, Mark A

PY - 2010/1

Y1 - 2010/1

N2 - We propose a closed-form rate allocation scheme (RAS) for entropy-coded uniform scalar quantization of dependent sources in classification problems. The proposed RAS is applicable to nonbinary classification with piecewise monotonic unquantized Bayes decision boundaries. The RAS is also extended to joint compression and classification.

AB - We propose a closed-form rate allocation scheme (RAS) for entropy-coded uniform scalar quantization of dependent sources in classification problems. The proposed RAS is applicable to nonbinary classification with piecewise monotonic unquantized Bayes decision boundaries. The RAS is also extended to joint compression and classification.

KW - Entropy-coded uniform scalar quantization

KW - Joint compression and classification

KW - Nonbinary classification

KW - Rate allocation

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

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

U2 - 10.1109/TCOMM.2010.01.080310

DO - 10.1109/TCOMM.2010.01.080310

M3 - Article

AN - SCOPUS:76649110225

SN - 0090-6778

VL - 58

SP - 16

EP - 20

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 1

M1 - 5397889

ER -

Optimal rate allocation for entropy-coded uniform scalar quantization of dependent sources in nonbinary hypothesis testing

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this