| Conference |
| Type of Publication |
| Minimizing MPEG-4 Sprite Coding-Cost Using
Multi-Sprites |
| Title |
|
Peter H. N. de With
|
| Authors |
| SPIE Visual Communications and Image
Processing, San José, CA, January 2004 |
| Published in |
| Object-oriented coding in the MPEG-4 standard
enables the separate processing of foreground objects and the
scene background (sprite). Since the background sprite only has
to be sent once, transmission bandwidth can be saved. This paper
shows that the concept of merging several views of a non-changing
scene background into a single background sprite is usually not
the most efficient way to transmit the background image. We have
found that the counter-intuitive approach of splitting the
background into several independent parts can reduce the overall
amount of data. For this reason, we propose an algorithm that
provides an optimal partitioning of a video sequence into
independent background sprites (a multi-sprite), resulting in a
significant reduction of the involved coding cost. Additionally,
our algorithm results in background sprites with better quality
by ensuring that the sprite resolution has at least the final
display resolution throughout the sequence. Even though our
sprite generation algorithm creates multiple sprites instead of a
single background sprite, it is fully compatible with the
existing MPEG-4 standard. The algorithm has been evaluated with
several test-sequences, including the well-known Table-tennis and
Stefan sequences. The total coding cost could be reduced by
factors of about 2.7 or even higher. |
| Abstract |
|
MPEG-4 video coding
sprite coding
image mosaicing
|
| Keywords |
| [PDF]
[BIB] [XML] |
| Downloads & Bib-Entries |
