H.264视频编码中的帧级复杂度控制

H. Ateş, Y. Altunbasak
{"title":"H.264视频编码中的帧级复杂度控制","authors":"H. Ateş, Y. Altunbasak","doi":"10.1109/SIU.2007.4298619","DOIUrl":null,"url":null,"abstract":"H.264 video coding standard supports several interprediction coding modes that use macroblock partitions with variable block sizes. Unfortunately, searching for optimal motion vectors of each possible partition incurs a heavy computational cost. In this paper, we propose a novel frame-level complexity control algorithm that determines for each macroblock which partitions are likely to be optimal. Motion vector search is carried out for only the selected partitions, thus reducing the complexity of the motion estimation step. The mode selection criteria is based on a measure of spatio-temporal activity within the macroblock. For each frame, the procedure guarantees that an execution time budget is met with minimum loss of coding efficiency. Simulation results show that the algorithm speeds up integerpel motion estimation by a factor of up to 40 with less than 0.2 dB loss in coding efficiency.","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Frame-level Complexity Control in H.264 Video Coding\",\"authors\":\"H. Ateş, Y. Altunbasak\",\"doi\":\"10.1109/SIU.2007.4298619\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"H.264 video coding standard supports several interprediction coding modes that use macroblock partitions with variable block sizes. Unfortunately, searching for optimal motion vectors of each possible partition incurs a heavy computational cost. In this paper, we propose a novel frame-level complexity control algorithm that determines for each macroblock which partitions are likely to be optimal. Motion vector search is carried out for only the selected partitions, thus reducing the complexity of the motion estimation step. The mode selection criteria is based on a measure of spatio-temporal activity within the macroblock. For each frame, the procedure guarantees that an execution time budget is met with minimum loss of coding efficiency. Simulation results show that the algorithm speeds up integerpel motion estimation by a factor of up to 40 with less than 0.2 dB loss in coding efficiency.\",\"PeriodicalId\":315147,\"journal\":{\"name\":\"2007 IEEE 15th Signal Processing and Communications Applications\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE 15th Signal Processing and Communications Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIU.2007.4298619\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE 15th Signal Processing and Communications Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIU.2007.4298619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

H.264视频编码标准支持多种使用可变块大小的宏块分区的互预测编码模式。不幸的是,搜索每个可能分区的最优运动向量会导致大量的计算成本。在本文中,我们提出了一种新的帧级复杂度控制算法,该算法可以确定每个宏块的分区可能是最优的。仅对选定的分区进行运动向量搜索,从而降低了运动估计步骤的复杂性。模式选择标准基于宏块内的时空活动度量。对于每一帧,该过程保证以最小的编码效率损失来满足执行时间预算。仿真结果表明,该算法在编码效率低于0.2 dB的情况下,将整体运动估计速度提高了40倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Frame-level Complexity Control in H.264 Video Coding
H.264 video coding standard supports several interprediction coding modes that use macroblock partitions with variable block sizes. Unfortunately, searching for optimal motion vectors of each possible partition incurs a heavy computational cost. In this paper, we propose a novel frame-level complexity control algorithm that determines for each macroblock which partitions are likely to be optimal. Motion vector search is carried out for only the selected partitions, thus reducing the complexity of the motion estimation step. The mode selection criteria is based on a measure of spatio-temporal activity within the macroblock. For each frame, the procedure guarantees that an execution time budget is met with minimum loss of coding efficiency. Simulation results show that the algorithm speeds up integerpel motion estimation by a factor of up to 40 with less than 0.2 dB loss in coding efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信