Distortion-optimal receiver grouping for MD-FEC coded video streaming

Han Zhang, Adarsh K. Ramasubramonian, K. Kar, J. Woods
{"title":"Distortion-optimal receiver grouping for MD-FEC coded video streaming","authors":"Han Zhang, Adarsh K. Ramasubramonian, K. Kar, J. Woods","doi":"10.1109/VCIP.2012.6410806","DOIUrl":null,"url":null,"abstract":"Multiple Description with Forward Error Correction (MD-FEC) coding provides the flexibility, easy adaptivity and distortion-rate optimality that are desirable for delivering streaming video in a network environment with time-varying bandwidth fluctuations and random packet losses. In this paper, we consider the issue of how diverse receivers of a video stream should be grouped - where each group receives a MD-FEC coded bitstream optimized for that group - so that the average video distortion is minimized across all receivers. We show that a sequential grouping solution is optimal for linear distortion-rate functions. For non-linear distortion-rate functions, while the optimal grouping structure may not be sequential in general, we observe that the approximation factor attained by the best sequential solution can be characterized in terms of the “degree of convexity” of the distortion-rate function. Numerical experiments with realistic distortion-rate functions reveal that the difference between the globally optimal grouping solution and the best sequential solution, is typically small. We provide a dynamic programming based polynomial-time algorithm to compute the best sequential solution.","PeriodicalId":103073,"journal":{"name":"2012 Visual Communications and Image Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Visual Communications and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VCIP.2012.6410806","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Multiple Description with Forward Error Correction (MD-FEC) coding provides the flexibility, easy adaptivity and distortion-rate optimality that are desirable for delivering streaming video in a network environment with time-varying bandwidth fluctuations and random packet losses. In this paper, we consider the issue of how diverse receivers of a video stream should be grouped - where each group receives a MD-FEC coded bitstream optimized for that group - so that the average video distortion is minimized across all receivers. We show that a sequential grouping solution is optimal for linear distortion-rate functions. For non-linear distortion-rate functions, while the optimal grouping structure may not be sequential in general, we observe that the approximation factor attained by the best sequential solution can be characterized in terms of the “degree of convexity” of the distortion-rate function. Numerical experiments with realistic distortion-rate functions reveal that the difference between the globally optimal grouping solution and the best sequential solution, is typically small. We provide a dynamic programming based polynomial-time algorithm to compute the best sequential solution.
MD-FEC编码视频流的失真最优接收机分组
具有前向纠错的多重描述(MD-FEC)编码提供了灵活性,易于自适应和失真率最优性,这对于在具有时变带宽波动和随机数据包丢失的网络环境中传输流视频是理想的。在本文中,我们考虑了视频流的不同接收器应该如何分组的问题-其中每组接收针对该组优化的MD-FEC编码比特流-以便所有接收器的平均视频失真最小。我们证明了序列分组解是线性失真率函数的最优解。对于非线性失真率函数,虽然最优分组结构一般可能不是顺序的,但我们观察到,由最佳顺序解获得的近似因子可以用失真率函数的“凹凸度”来表征。具有真实失真率函数的数值实验表明,全局最优分组解与最优序列解之间的差异通常很小。我们提供了一种基于动态规划的多项式时间算法来计算最佳顺序解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信