Samenvatting
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.
Originele taal-2 | Engels |
---|---|
Titel | 26th Symposium on Information Theory in the Benelux |
Redacteuren | J. Cardinal, N. Cerf, O. Delgrnage |
Plaats van productie | Brussels |
Uitgeverij | Werkgemeenschap voor Informatie- en Communicatietheorie (WIC) |
Pagina's | 137-144 |
ISBN van geprinte versie | 90-71048-21-7 |
Status | Gepubliceerd - 2005 |
Evenement | 2005 Symposium on Information Theory in the Benelux (SITB 2005) - Brussels, België Duur: 19 mei 2005 → 20 mei 2005 Congresnummer: 26 |
Congres
Congres | 2005 Symposium on Information Theory in the Benelux (SITB 2005) |
---|---|
Land/Regio | België |
Stad | Brussels |
Periode | 19/05/05 → 20/05/05 |