Share Email Print

Proceedings Paper

Complexity analysis of sprites in MPEG-4
Author(s): Raghavendra C. Nagaraj; Aravind R. Dasu; Sethuraman Panchanathan
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Sprite encoding/decoding is one of the new tools proposed in the MPEG-4 standard. Sprite encoding operates at the Video Object Plane level. Since the size of a Video Object Plane might change with time, it presents challenges for hardware implementation. This is unlike the other video object coding tools that operate at a fixed-size block level that can be directly mapped to processor structures. Hence there is a need for an analysis that allows a priori estimation of the computational complexity in order to facilitate the following: (1) Assess resources required to implement Sprite Encoding in software. (2) Design of hardware for various modules of Sprite Encoding. (3) Understand the static and dynamic nature of Sprite Encoding operations. This paper presents a detailed complexity analysis of the Sprite Encoding process in terms of basic operations. The computational complexity has been estimated. A modified Sprite encoding algorithm has been proposed. The proposed algorithm provides a similar result in terms of sprite generation but is more amenable to a hardware efficient implementation.

Paper Details

Date Published: 29 March 2001
PDF: 5 pages
Proc. SPIE 4313, Media Processors 2001, (29 March 2001); doi: 10.1117/12.420805
Show Author Affiliations
Raghavendra C. Nagaraj, Arizona State Univ. (United States)
Aravind R. Dasu, Arizona State Univ. (United States)
Sethuraman Panchanathan, Arizona State Univ. (United States)

Published in SPIE Proceedings Vol. 4313:
Media Processors 2001
Sethuraman Panchanathan; V. Michael Bove; Subramania I. Sudharsanan, Editor(s)

© SPIE. Terms of Use
Back to Top