This paper shows that the concept of merging several views of a non-changing scene-background into a single background sprite is not necessarily 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, resulting in the minimum coding cost. Moreover, 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.
Dieser Eintrag ist Teil der Universitätsbibliographie.
Search Authors in