Decoding complexity constrained rate-distortion optimization for the compression of concentric mosaics

Eswar Kalyan Vutukuri, Ingo Bauermann, Eckehard Steinbach

Publikation: KonferenzbeitragPapierBegutachtung

5 Zitate (Scopus)

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.

OriginalspracheEnglisch
Seiten355-360
Seitenumfang6
PublikationsstatusVeröffentlicht - 2004
VeranstaltungPicture Coding Symposium 2004 - San Francisco, CA, USA/Vereinigte Staaten
Dauer: 15 Dez. 200417 Dez. 2004

Konferenz

KonferenzPicture Coding Symposium 2004
Land/GebietUSA/Vereinigte Staaten
OrtSan Francisco, CA
Zeitraum15/12/0417/12/04

Fingerprint

Untersuchen Sie die Forschungsthemen von „Decoding complexity constrained rate-distortion optimization for the compression of concentric mosaics“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren