Optimal shape coding under buffer constraints

Author

Lee, Jae-Beom ; Cho, Jin-Soo ; Eleftheriadis, Alexandros

Author_Institution

Dept. of Electr. Eng., Columbia Univ., New York, NY, USA

Volume

1

fYear

1998

fDate

4-7 Oct 1998

Firstpage

290

Abstract

In this paper, we derive an optimal rate control algorithm for shape coding as defined in the forthcoming MPEG-4 international standard. The current MPEG-4 shape coding scheme consists of two steps: first, distortion is introduced by down and up scaling; then, context-based arithmetic encoding is applied. Since arithmetic coding is “lossless”, the down up scaling step is considered as a virtual quantizer. We first formulate the buffer-constrained adaptive quantization problem for shape coding, and then propose an algorithm for the optimal solution under buffer constraints. Experimental results are given using an MPEG-4 shape codec

Keywords

arithmetic codes; buffer storage; code standards; data compression; image coding; image sequences; optimisation; quantisation (signal); telecommunication standards; MPEG-4 international standard; MPEG-4 shape codec; buffer constraints; buffer-constrained adaptive quantization; context-based arithmetic encoding; distortion; down scaling; experimental results; fast approximation algorithm; image sequence; lossless coding; optimal buffered compression; optimal rate control algorithm; optimal shape coding; up scaling; virtual quantizer; Arithmetic; Codecs; Cost function; Distortion measurement; Linear programming; MPEG 4 Standard; Optimal control; Quantization; Rate distortion theory; Shape control;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on

Conference_Location

Chicago, IL

Print_ISBN

0-8186-8821-1

Type

conf

DOI

10.1109/ICIP.1998.723475

Filename

723475