Optimal buffered compression and coding mode selection for MPEG-4 shape coding

  • Authors:
  • J. -B. Lee;J. -S. Cho;A. Eleftheriadis

  • Affiliations:
  • Solid Streaming Inc., New York, NY;-;-

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 2001

Quantified Score

Hi-index 0.01

Visualization

Abstract

We propose an optimal buffered compression algorithm for shape coding as defined in the forthcoming MPEG-4 international standard. The 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. Previously, the fact that a conversion ratio (CR) of 1/4 makes a coded image irritating to human observers for QCIF size was reported for MPEG-4 shape coding. Therefore, careful consideration for small size images such as QCIF should be given to prevent coded images from being unacceptable. To this end, a low bit rate tuned algorithm is proposed in this paper as well. Experimental results are given using an MPEG-4 shape codec