Share Email Print

Proceedings Paper

Windowing into compressed video without re-encoding
Author(s): Krishna Ratakonda
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Given a high resolution compressed video stream this paper looks at the problem of extracting video from a small window at an arbitrary, but static location, in compressed form, without having to either decode the high resolution video stream or encode the window stream. Since state of the art video compression algorithms use motion compensation in one form or the other, the compressed video stream cannot be parsed to obtain the window stream without decoding the high resolution stream to some extent and subsequent re-encoding. On the other hand storing all possible windows as separate streams on the server is clearly infeasible, at least as of today, as it would lead to an explosion of the storage space requirement. In this paper, it will be shown that with a comparatively small increment in the server's storage requirement, it is possible to obtain compressed window streams out of the high resolution stream with minimal parsing, no decoding or re-encoding and little quality loss. Furthermore, ways to trade off the space required on the server with the compression efficiency of the window stream will be shown. Although the main emphasis of this paper will be on showing why and how this windowing problem is analytically feasible, results obtained from windowing into a standard definition, MPEG-2 compressed video stream using one of the suggested implementations will be shown to prove feasibility.

Paper Details

Date Published: 11 October 2000
PDF: 7 pages
Proc. SPIE 4210, Internet Multimedia Management Systems, (11 October 2000); doi: 10.1117/12.403796
Show Author Affiliations
Krishna Ratakonda, IBM Thomas J. Watson Research Ctr. (United States)

Published in SPIE Proceedings Vol. 4210:
Internet Multimedia Management Systems
John R. Smith; Chinh Le; Sethuraman Panchanathan; C.-C. Jay Kuo, Editor(s)

© SPIE. Terms of Use
Back to Top