FAST rate allocation through steepest descent for JPEG2000 video transmission

Francesc Aulí-Llinàs, Ali Bilgin, Michael W Marcellin

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

This work addresses the transmission of pre-encoded JPEG2000 video within a video-on-demand scenario. The primary requirement for the rate allocation algorithm deployed in the server is to match the real-time processing demands of the application. Scalability in terms of complexity must be provided to supply a valid solution by a given instant of time. The FAst rate allocation through STeepest descent (FAST) method introduced in this work selects an initial (and possibly poor) solution, and iteratively improves it until time is exhausted or the algorithm finishes execution. Experimental results suggest that FAST commonly achieves solutions close to the global optimum while employing very few computational resources.

Original languageEnglish (US)
Article number5582283
Pages (from-to)1166-1173
Number of pages8
JournalIEEE Transactions on Image Processing
Volume20
Issue number4
DOIs
StatePublished - Apr 2011

Fingerprint

Steepest descent method
Video on demand
Scalability
Servers
Processing

Keywords

  • Motion JPEG2000
  • rate allocation
  • rate-distortion optimization
  • video transmission

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Medicine(all)

Cite this

FAST rate allocation through steepest descent for JPEG2000 video transmission. / Aulí-Llinàs, Francesc; Bilgin, Ali; Marcellin, Michael W.

In: IEEE Transactions on Image Processing, Vol. 20, No. 4, 5582283, 04.2011, p. 1166-1173.

Research output: Contribution to journalArticle

@article{e282d32df328463797a7e8030345bbe6,
title = "FAST rate allocation through steepest descent for JPEG2000 video transmission",
abstract = "This work addresses the transmission of pre-encoded JPEG2000 video within a video-on-demand scenario. The primary requirement for the rate allocation algorithm deployed in the server is to match the real-time processing demands of the application. Scalability in terms of complexity must be provided to supply a valid solution by a given instant of time. The FAst rate allocation through STeepest descent (FAST) method introduced in this work selects an initial (and possibly poor) solution, and iteratively improves it until time is exhausted or the algorithm finishes execution. Experimental results suggest that FAST commonly achieves solutions close to the global optimum while employing very few computational resources.",
keywords = "Motion JPEG2000, rate allocation, rate-distortion optimization, video transmission",
author = "Francesc Aul{\'i}-Llin{\`a}s and Ali Bilgin and Marcellin, {Michael W}",
year = "2011",
month = "4",
doi = "10.1109/TIP.2010.2077304",
language = "English (US)",
volume = "20",
pages = "1166--1173",
journal = "IEEE Transactions on Image Processing",
issn = "1057-7149",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - FAST rate allocation through steepest descent for JPEG2000 video transmission

AU - Aulí-Llinàs, Francesc

AU - Bilgin, Ali

AU - Marcellin, Michael W

PY - 2011/4

Y1 - 2011/4

N2 - This work addresses the transmission of pre-encoded JPEG2000 video within a video-on-demand scenario. The primary requirement for the rate allocation algorithm deployed in the server is to match the real-time processing demands of the application. Scalability in terms of complexity must be provided to supply a valid solution by a given instant of time. The FAst rate allocation through STeepest descent (FAST) method introduced in this work selects an initial (and possibly poor) solution, and iteratively improves it until time is exhausted or the algorithm finishes execution. Experimental results suggest that FAST commonly achieves solutions close to the global optimum while employing very few computational resources.

AB - This work addresses the transmission of pre-encoded JPEG2000 video within a video-on-demand scenario. The primary requirement for the rate allocation algorithm deployed in the server is to match the real-time processing demands of the application. Scalability in terms of complexity must be provided to supply a valid solution by a given instant of time. The FAst rate allocation through STeepest descent (FAST) method introduced in this work selects an initial (and possibly poor) solution, and iteratively improves it until time is exhausted or the algorithm finishes execution. Experimental results suggest that FAST commonly achieves solutions close to the global optimum while employing very few computational resources.

KW - Motion JPEG2000

KW - rate allocation

KW - rate-distortion optimization

KW - video transmission

UR - http://www.scopus.com/inward/record.url?scp=79952916772&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952916772&partnerID=8YFLogxK

U2 - 10.1109/TIP.2010.2077304

DO - 10.1109/TIP.2010.2077304

M3 - Article

VL - 20

SP - 1166

EP - 1173

JO - IEEE Transactions on Image Processing

JF - IEEE Transactions on Image Processing

SN - 1057-7149

IS - 4

M1 - 5582283

ER -