首页> 外文期刊>Multimedia, IEEE Transactions on >Dynamic Sub-GOP Forward Error Correction Code for Real-Time Video Applications
【24h】

Dynamic Sub-GOP Forward Error Correction Code for Real-Time Video Applications

机译:实时视频应用的动态Sub-GOP前向纠错码

获取原文
获取原文并翻译 | 示例
           

摘要

Reed-Solomon erasure codes are commonly studied as a method to protect the video streams when transmitted over unreliable networks. As a block-based error correcting code, on one hand, enlarging the block size can enhance the performance of the Reed-Solomon codes; on the other hand, large block size leads to long delay which is not tolerable for real-time video applications. In this paper a novel Dynamic Sub-GOP FEC (DSGF) approach is proposed to improve the performance of Reed-Solomon codes for video applications. With the proposed approach, the Sub-GOP, which contains more than one video frame, is dynamically tuned and used as the RS coding block, yet no delay is introduced. For a fixed number of extra introduced packets, for protection, the length of the Sub-GOP and the redundancy devoted to each Sub-GOP becomes a constrained optimization problem. To solve this problem, a fast greedy algorithm is proposed. Experimental results show that the proposed approach outperforms other real-time error resilient video coding technologies.
机译:人们普遍研究了里德-所罗门擦除码作为一种在不可靠的网络上传输时保护视频流的方法。一方面,作为基于块的纠错码,增大块大小可以提高Reed-Solomon码的性能;另一方面,大的块尺寸导致较长的延迟,这对于实时视频应用是不能容忍的。本文提出了一种新颖的动态Sub-GOP FEC(DSGF)方法,以提高视频应用的Reed-Solomon码的性能。利用所提出的方法,动态地调谐了包含多个视频帧的Sub-GOP,并将其用作RS编码块,但是没有引入延迟。对于固定数量的额外引入的数据包,为了保护起见,Sub-GOP的长度和分配给每个Sub-GOP的冗余成为约束优化问题。为了解决这个问题,提出了一种快速贪婪算法。实验结果表明,该方法优于其他实时抗错视频编码技术。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号