Abstract
In this paper, a quantitative measure of decoding complexity for compressed image based scene representations is defined and is used to optimize the rate-distortion trade off during encoding subject to a decoding complexity constraint. The image-based representation used in this work is the concentric mosaic. Due to the huge amount of image data to be managed and the demands on just-in-time decoding and rendering of the compressed bit-stream, challenges arise in using concentric mosaics on low-end devices and for streaming applications over the Internet or other low bit-rate networks. Our approach allows for maximizing quality with respect to the available computational resources at the decoder and the bit rate.
| Original language | English |
|---|---|
| Pages | 355-360 |
| Number of pages | 6 |
| State | Published - 2004 |
| Event | Picture Coding Symposium 2004 - San Francisco, CA, United States Duration: 15 Dec 2004 → 17 Dec 2004 |
Conference
| Conference | Picture Coding Symposium 2004 |
|---|---|
| Country/Territory | United States |
| City | San Francisco, CA |
| Period | 15/12/04 → 17/12/04 |
Fingerprint
Dive into the research topics of 'Decoding complexity constrained rate-distortion optimization for the compression of concentric mosaics'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver