Loading…

Linear approximations for rate control in video coding

An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows advantages over existing methods in that it has polynomial time complexity and handles a class of rate constraints that inclu...

Full description

Saved in:

Bibliographic Details
Main Authors:	Sermadevi, Y., Hemami, S.S.
Format:	Conference Proceeding
Language:	English
Subjects:	Bit rate Decoding Dynamic programming Lagrangian functions Linear approximation Linear programming Optimal control Piecewise linear approximation Polynomials Video coding
Online Access:	Request full text
Tags:	Add Tag No Tags, Be the first to tag this record!

cited_by
cites
container_end_page	809
container_issue
container_start_page	III
container_title
container_volume	3
creator	Sermadevi, Y. Hemami, S.S.
description	An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows advantages over existing methods in that it has polynomial time complexity and handles a class of rate constraints that include common constraints such as the leaky bucket and sliding window constraints. This technique is based on a linear relaxation of rate constraints and a piecewise linear approximation of the frame-level distortion-rate functions. Using linear programming, optimal solutions to the approximated versions of the problems are guaranteed in polynomial time. Moreover, bounds are provided for the deviation of the value of this solution from that of the optimal solution to the initial problem.
doi_str_mv	10.1109/ICIP.2003.1247368
format	conference_proceeding
fullrecord	<record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_1247368</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1247368</ieee_id><sourcerecordid>1247368</sourcerecordid><originalsourceid>FETCH-ieee_primary_12473683</originalsourceid><addsrcrecordid>eNp9jssKwjAURC8-wKr9AHGTH2i9SfpI10Wx4MKF-xJsKpGalKSI_r1ddO3MYuAMDAOwoxhTisWhKqtrzBB5TFmS80zMIGBc0EikSTGHNeYCeZ6nKBYQ0JSxKBECVxB6_8RRSTqaBpBdtFHSEdn3zn70Sw7aGk9a64iTgyJ3awZnO6INeetG2RE02jy2sGxl51U45Qb2p-OtPEdaKVX3bhxy33q6xv-3P2mqOP8</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Linear approximations for rate control in video coding</title><source>IEEE Xplore All Conference Series</source><creator>Sermadevi, Y. ; Hemami, S.S.</creator><creatorcontrib>Sermadevi, Y. ; Hemami, S.S.</creatorcontrib><description>An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows advantages over existing methods in that it has polynomial time complexity and handles a class of rate constraints that include common constraints such as the leaky bucket and sliding window constraints. This technique is based on a linear relaxation of rate constraints and a piecewise linear approximation of the frame-level distortion-rate functions. Using linear programming, optimal solutions to the approximated versions of the problems are guaranteed in polynomial time. Moreover, bounds are provided for the deviation of the value of this solution from that of the optimal solution to the initial problem.</description><identifier>ISSN: 1522-4880</identifier><identifier>ISBN: 0780377508</identifier><identifier>ISBN: 9780780377509</identifier><identifier>EISSN: 2381-8549</identifier><identifier>DOI: 10.1109/ICIP.2003.1247368</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bit rate ; Decoding ; Dynamic programming ; Lagrangian functions ; Linear approximation ; Linear programming ; Optimal control ; Piecewise linear approximation ; Polynomials ; Video coding</subject><ispartof>Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429), 2003, Vol.3, p.III-809</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1247368$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,4050,4051,23930,23931,25140,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1247368$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Sermadevi, Y.</creatorcontrib><creatorcontrib>Hemami, S.S.</creatorcontrib><title>Linear approximations for rate control in video coding</title><title>Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429)</title><addtitle>ICIP</addtitle><description>An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows advantages over existing methods in that it has polynomial time complexity and handles a class of rate constraints that include common constraints such as the leaky bucket and sliding window constraints. This technique is based on a linear relaxation of rate constraints and a piecewise linear approximation of the frame-level distortion-rate functions. Using linear programming, optimal solutions to the approximated versions of the problems are guaranteed in polynomial time. Moreover, bounds are provided for the deviation of the value of this solution from that of the optimal solution to the initial problem.</description><subject>Bit rate</subject><subject>Decoding</subject><subject>Dynamic programming</subject><subject>Lagrangian functions</subject><subject>Linear approximation</subject><subject>Linear programming</subject><subject>Optimal control</subject><subject>Piecewise linear approximation</subject><subject>Polynomials</subject><subject>Video coding</subject><issn>1522-4880</issn><issn>2381-8549</issn><isbn>0780377508</isbn><isbn>9780780377509</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNp9jssKwjAURC8-wKr9AHGTH2i9SfpI10Wx4MKF-xJsKpGalKSI_r1ddO3MYuAMDAOwoxhTisWhKqtrzBB5TFmS80zMIGBc0EikSTGHNeYCeZ6nKBYQ0JSxKBECVxB6_8RRSTqaBpBdtFHSEdn3zn70Sw7aGk9a64iTgyJ3awZnO6INeetG2RE02jy2sGxl51U45Qb2p-OtPEdaKVX3bhxy33q6xv-3P2mqOP8</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Sermadevi, Y.</creator><creator>Hemami, S.S.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2003</creationdate><title>Linear approximations for rate control in video coding</title><author>Sermadevi, Y. ; Hemami, S.S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-ieee_primary_12473683</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Bit rate</topic><topic>Decoding</topic><topic>Dynamic programming</topic><topic>Lagrangian functions</topic><topic>Linear approximation</topic><topic>Linear programming</topic><topic>Optimal control</topic><topic>Piecewise linear approximation</topic><topic>Polynomials</topic><topic>Video coding</topic><toplevel>online_resources</toplevel><creatorcontrib>Sermadevi, Y.</creatorcontrib><creatorcontrib>Hemami, S.S.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sermadevi, Y.</au><au>Hemami, S.S.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Linear approximations for rate control in video coding</atitle><btitle>Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429)</btitle><stitle>ICIP</stitle><date>2003</date><risdate>2003</risdate><volume>3</volume><spage>III</spage><epage>809</epage><pages>III-809</pages><issn>1522-4880</issn><eissn>2381-8549</eissn><isbn>0780377508</isbn><isbn>9780780377509</isbn><abstract>An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows advantages over existing methods in that it has polynomial time complexity and handles a class of rate constraints that include common constraints such as the leaky bucket and sliding window constraints. This technique is based on a linear relaxation of rate constraints and a piecewise linear approximation of the frame-level distortion-rate functions. Using linear programming, optimal solutions to the approximated versions of the problems are guaranteed in polynomial time. Moreover, bounds are provided for the deviation of the value of this solution from that of the optimal solution to the initial problem.</abstract><pub>IEEE</pub><doi>10.1109/ICIP.2003.1247368</doi></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 1522-4880
ispartof	Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429), 2003, Vol.3, p.III-809
issn	1522-4880 2381-8549
language	eng
recordid	cdi_ieee_primary_1247368
source	IEEE Xplore All Conference Series
subjects	Bit rate Decoding Dynamic programming Lagrangian functions Linear approximation Linear programming Optimal control Piecewise linear approximation Polynomials Video coding
title	Linear approximations for rate control in video coding
url	http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T18%3A36%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Linear%20approximations%20for%20rate%20control%20in%20video%20coding&rft.btitle=Proceedings%202003%20International%20Conference%20on%20Image%20Processing%20(Cat.%20No.03CH37429)&rft.au=Sermadevi,%20Y.&rft.date=2003&rft.volume=3&rft.spage=III&rft.epage=809&rft.pages=III-809&rft.issn=1522-4880&rft.eissn=2381-8549&rft.isbn=0780377508&rft.isbn_list=9780780377509&rft_id=info:doi/10.1109/ICIP.2003.1247368&rft_dat=%3Cieee_CHZPO%3E1247368%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-ieee_primary_12473683%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1247368&rfr_iscdi=true