Share Email Print

Proceedings Paper

Rate-distortion-based scheduling of video with multiple decoding paths
Author(s): Huisheng Wang; Antonio Ortega
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

We present a general rate-distortion based scheduling framework that can accommodate cases where multiple encoded versions for the same video are available for transmission. Previous work on video scheduling is mostly focused on those encoding techniques, such as layered coding, which generate only one set of dependent packets. However, it is sometimes preferred to have a codec that produces redundant video data, where multiple different decoding paths are possible. Examples of these scenarios are multiple description layered coding and multiple independently encoded video streams. A new source model called Directed Acyclic HyperGraph (DAHG) is introduced to describe the relationship between different video data units with multiple decoding paths. Based on this model, we propose two low-complexity scheduling algorithms: the greedy algorithm and the M-T algorithm. Experiments are made to compare the performance of these algorithms. It is shown that, in the case of multiple decoding paths, the M-T algorithm outperforms the greedy algorithm by taking into account some of the transmission possibilities available in the near future before making a decision.

Paper Details

Date Published: 14 March 2005
PDF: 12 pages
Proc. SPIE 5685, Image and Video Communications and Processing 2005, (14 March 2005); doi: 10.1117/12.588862
Show Author Affiliations
Huisheng Wang, Univ. of Southern California (United States)
Antonio Ortega, Univ. of Southern California (United States)

Published in SPIE Proceedings Vol. 5685:
Image and Video Communications and Processing 2005
Amir Said; John G. Apostolopoulos, Editor(s)

© SPIE. Terms of Use
Back to Top