Complexity analysis of sprites in MPEG-4

N. C. Raghavendra, A. R. Dasu, Sethuraman Panchanathan

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)69-73
Number of pages5
JournalProceedings of SPIE - The International Society for Optical Engineering
StatePublished - 2001
EventMedia Processors 2001 - San Jose, CA, United States
Duration: Jan 23 2001Jan 23 2001


  • MPEG-4
  • Perspective transformation
  • Sprite
  • Video object plane
  • Warping

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering


Dive into the research topics of 'Complexity analysis of sprites in MPEG-4'. Together they form a unique fingerprint.

Cite this