Published August 1, 2004
| public
Journal Article
Open
Network vector quantization
- Creators
- Fleming, Michael
- Zhao, Qian
- Effros, Michelle
Chicago
An error occurred while generating the citation.
Abstract
We present an algorithm for designing locally optimal vector quantizers for general networks. We discuss the algorithm's implementation and compare the performance of the resulting "network vector quantizers" to traditional vector quantizers (VQs) and to rate-distortion (R-D) bounds where available. While some special cases of network codes (e.g., multiresolution (MR) and multiple description (MD) codes) have been studied in the literature, we here present a unifying approach that both includes these existing solutions as special cases and provides solutions to previously unsolved examples.
Additional Information
© Copyright 2004 IEEE – All Rights Reserved Manuscript received January 22, 2002; revised July 31, 2003. Posted online: 2004-07-26. This material is based upon work supported by the F.W.W. Rhodes Memorial Scholarship, a Redshaw Award, the National Science Foundation under Grant CCR-9909026, the Lee Center for Advanced Networking at Caltech, and the Intel Technology for Education 2000 program. The material in this paper was presented in part at the IEEE Data Compression Conference, Snowbird, UT, 1999, 2000, 2001; the 2000 Conference on Information Sciences and Systems, Princeton, NJ, 2000; and the 33rd Asilomar Conference on Signals, Systems, and Computers, Asilomar, CA, 2000.Files
FLEieeetit04.pdf
Files
(677.0 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:417187902ee9c7be087931f7ccedcd27
|
677.0 kB | Preview Download |
Additional details
- Eprint ID
- 1339
- Resolver ID
- CaltechAUTHORS:FLEieeetit02
- Created
-
2006-01-11Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field