Share Email Print

Proceedings Paper

Optimal reverse frame selection for stored video delivery under constrained resources
Author(s): Dayong Tao; Jianfei Cai
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In this paper, we present an optimal reverse frame selection (RFS) algorithm based on dynamic programming for delivering stored video under both bandwidth and buffer size constraints. Our objective is to find a feasible set of frames that can maximize the video's accumulated motion metrics without violating any constraint. We further extend RFS to solve the problem of video delivery over VBR channels where the channel bandwidth is both limited and time-varying. In particular, we first run RFS offline for several bandwidth samples, and the computation complexity is modest and scalable with the aids of frame size stuffing and non-optimal state elimination. During online streaming, we only need to retrieve the optimal frame selection path from the pre-generated offline results, and it can be applied to any VBR channels that can be modelled as piecewise CBR channels. Experimental results show the good performance of our proposed algorithm.

Paper Details

Date Published: 29 January 2007
PDF: 7 pages
Proc. SPIE 6508, Visual Communications and Image Processing 2007, 65082G (29 January 2007); doi: 10.1117/12.704594
Show Author Affiliations
Dayong Tao, Nanyang Technological Univ. (Singapore)
Jianfei Cai, Nanyang Technological Univ. (Singapore)

Published in SPIE Proceedings Vol. 6508:
Visual Communications and Image Processing 2007
Chang Wen Chen; Dan Schonfeld; Jiebo Luo, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?