Abstract
Background sprite decoding is an essential part of object-based video coding.The composition and rendering of a final scene involves the placing of individual video objects in a predefined way superimposed on the decoded background image. The MPEG-4 standard includes the decoding algorithm for background image decoding, but this algorithm is not suitable for implementation on a memory-constrained platform. In this paper we present a modification of the decoding algorithm that decodes MPEG-4 sequences while fulfilling the requirements of a memory-constrained multiprocessor system with only 17% extra overhead of computation. Our algorithm reduces the memory cost of such decoding with a factor of four. Additionally, our algorithm offers the possibility of high level data parallelism and consequently contributes to an increase of throughput rate.
| Original language | English |
|---|---|
| Title of host publication | 26th Symposium on Information Theory in the Benelux |
| Editors | J. Cardinal, N. Cerf, O. Delgrnage |
| Place of Publication | Brussels |
| Publisher | Werkgemeenschap voor Informatie- en Communicatietheorie (WIC) |
| Pages | 137-144 |
| ISBN (Print) | 90-71048-21-7 |
| Publication status | Published - 2005 |
| Event | 2005 Symposium on Information Theory in the Benelux (SITB 2005) - Brussels, Belgium Duration: 19 May 2005 → 20 May 2005 Conference number: 26 |
Conference
| Conference | 2005 Symposium on Information Theory in the Benelux (SITB 2005) |
|---|---|
| Country/Territory | Belgium |
| City | Brussels |
| Period | 19/05/05 → 20/05/05 |