Published 2002
| public
Book Section - Chapter
Open
Quantization as histogram segmentation: globally optimal scalar quantizer design in network systems
- Creators
- Muresan, Dan
- Effros, Michelle
- Others:
- Storer, James A.
- Cohn, Martin
Abstract
We propose a polynomial-time algorithm for optimal scalar quantizer design on discrete-alphabet sources. Special cases of the proposed approach yield optimal design algorithms for fixed-rate and entropy-constrained scalar quantizers, multi-resolution scalar quantizers, multiple description scalar quantizers, and Wyner-Ziv scalar quantizers. The algorithm guarantees globally optimal solutions for fixed-rate and entropy-constrained scalar quantizers and constrained optima for the other coding scenarios. We derive the algorithm by demonstrating the connection between scalar quantization, histogram segmentation, and the shortest path problem in a certain directed acyclic graph.
Additional Information
© Copyright 2002 IEEE. Reprinted with permission. This work was supported in part by the Lee Center for Advanced Networking at Caltech.Files
MURdcc02.pdf
Files
(405.9 kB)
Name | Size | Download all |
---|---|---|
md5:c7323d4af84a73ddb07bdd176140c9e0
|
405.9 kB | Preview Download |
Additional details
- Eprint ID
- 7432
- Resolver ID
- CaltechAUTHORS:MURdcc02
- Created
-
2007-02-13Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field