Optimal shape coding under buffer constraints
| Autor: | Jin-Soo Cho, Alexandros Eleftheriadis, Jae-Beom Lee |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Mathematical optimization
Range encoding ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Variable-length code Data_CODINGANDINFORMATIONTHEORY Huffman coding Arithmetic coding symbols.namesake Shannon–Fano coding Computer Science::Multimedia symbols Shape coding Algorithm Context-adaptive binary arithmetic coding Context-adaptive variable-length coding Mathematics |
| Zdroj: | ICIP (1) |
| DOI: | 10.1109/icip.1998.723475 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|