H.264/AVC视频编码的解码器友好Subpel MV选择

Qi Zhang, Yunyang Dai, Siwei Ma, C.-C. Jay Kuo
{"title":"H.264/AVC视频编码的解码器友好Subpel MV选择","authors":"Qi Zhang, Yunyang Dai, Siwei Ma, C.-C. Jay Kuo","doi":"10.1109/IIH-MSP.2006.78","DOIUrl":null,"url":null,"abstract":"A decoder-friendly subpel motion vector (MV) selection scheme for H.264/AVC video encoding is proposed in this work. First, the rate-distortion (RD) relationship with respect to subpel MVs is examined to shed light on the tradeoff of R-D performance degradation and complexity reduction in different block types. It is observed that the R-D gain of some macroblocks (MB) is greatly enhanced by employing subpel MVs while others are not. An SAD-based approach is adopted to decide whether the subpel MV scheme is needed for a certain MB. To enhance the prediction accuracy, the correlation of MVs in the spatial domain is also exploited. Our scheme further introduces decoder complexity budget to aid the designer in making design tradeoffs. Experimental results indicate that our scheme is flexible enough that the actual achieved complexity is very close to the target complexity budget under different QP settings.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Decoder-Friendly Subpel MV Selection for H.264/AVC Video Encoding\",\"authors\":\"Qi Zhang, Yunyang Dai, Siwei Ma, C.-C. Jay Kuo\",\"doi\":\"10.1109/IIH-MSP.2006.78\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A decoder-friendly subpel motion vector (MV) selection scheme for H.264/AVC video encoding is proposed in this work. First, the rate-distortion (RD) relationship with respect to subpel MVs is examined to shed light on the tradeoff of R-D performance degradation and complexity reduction in different block types. It is observed that the R-D gain of some macroblocks (MB) is greatly enhanced by employing subpel MVs while others are not. An SAD-based approach is adopted to decide whether the subpel MV scheme is needed for a certain MB. To enhance the prediction accuracy, the correlation of MVs in the spatial domain is also exploited. Our scheme further introduces decoder complexity budget to aid the designer in making design tradeoffs. Experimental results indicate that our scheme is flexible enough that the actual achieved complexity is very close to the target complexity budget under different QP settings.\",\"PeriodicalId\":272579,\"journal\":{\"name\":\"2006 International Conference on Intelligent Information Hiding and Multimedia\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Intelligent Information Hiding and Multimedia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIH-MSP.2006.78\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Intelligent Information Hiding and Multimedia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIH-MSP.2006.78","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

针对H.264/AVC视频编码,提出了一种解码器友好的子像素运动矢量(MV)选择方案。首先,研究了与子块mv相关的率失真(RD)关系,以阐明在不同块类型中R-D性能下降和复杂性降低的权衡。我们观察到,一些宏块(MB)的R-D增益通过亚细胞mv得到了极大的增强,而另一些则没有。为了提高预测精度,采用了一种基于sar的方法来确定对某一MB是否需要采用subpel MV格式,并利用了MV在空间域中的相关性。我们的方案进一步引入了解码器复杂度预算,以帮助设计人员进行设计权衡。实验结果表明,该方案具有足够的灵活性,在不同的QP设置下,实际实现的复杂度非常接近目标复杂度预算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Decoder-Friendly Subpel MV Selection for H.264/AVC Video Encoding
A decoder-friendly subpel motion vector (MV) selection scheme for H.264/AVC video encoding is proposed in this work. First, the rate-distortion (RD) relationship with respect to subpel MVs is examined to shed light on the tradeoff of R-D performance degradation and complexity reduction in different block types. It is observed that the R-D gain of some macroblocks (MB) is greatly enhanced by employing subpel MVs while others are not. An SAD-based approach is adopted to decide whether the subpel MV scheme is needed for a certain MB. To enhance the prediction accuracy, the correlation of MVs in the spatial domain is also exploited. Our scheme further introduces decoder complexity budget to aid the designer in making design tradeoffs. Experimental results indicate that our scheme is flexible enough that the actual achieved complexity is very close to the target complexity budget under different QP settings.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An adjustable multipath flatted-hexagon search algorithm for block motion estimation An Improved Design and Implementation of Chinese Name Card Recognition System on Mobile Devices A Novel Low-IF Topology for High Performance Integrated Receivers Improved Guided Position Scrambling for Digital Watermarking Decoder-Friendly Subpel MV Selection for H.264/AVC Video Encoding
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1