Efficient block matching algorithm for fast motion estimation in video compression

M. Ezhilarasan, P. Thambidurai
{"title":"Efficient block matching algorithm for fast motion estimation in video compression","authors":"M. Ezhilarasan, P. Thambidurai","doi":"10.1109/SPCOM.2004.1458406","DOIUrl":null,"url":null,"abstract":"Motion estimation is the most time-consuming module in any video coding standard. Existing block-matching algorithms (BMA) reduce the search time of the motion estimation process with moderate loss in quality. In this paper, a novel block-matching algorithm for fast motion estimation namely direct ion-based block-matching algorithm (DBM) is proposed. Existing BMA initiate its search from the center of the search area for every frame, which is time consuming. The proposed algorithm utilizes the temporal correlation in the motion vectors between successive frames to reduce the search time. The motion vectors of the previous frame imply the direction of motion in the succeeding frames thus minimizing the search domain. Experimental results show that DBM provides faster searching with moderate to low distortion compared to existing BMA.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPCOM.2004.1458406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Motion estimation is the most time-consuming module in any video coding standard. Existing block-matching algorithms (BMA) reduce the search time of the motion estimation process with moderate loss in quality. In this paper, a novel block-matching algorithm for fast motion estimation namely direct ion-based block-matching algorithm (DBM) is proposed. Existing BMA initiate its search from the center of the search area for every frame, which is time consuming. The proposed algorithm utilizes the temporal correlation in the motion vectors between successive frames to reduce the search time. The motion vectors of the previous frame imply the direction of motion in the succeeding frames thus minimizing the search domain. Experimental results show that DBM provides faster searching with moderate to low distortion compared to existing BMA.
视频压缩中快速运动估计的高效块匹配算法
在所有视频编码标准中,运动估计是最耗时的模块。现有的块匹配算法(BMA)减少了运动估计过程的搜索时间,但质量损失不大。本文提出了一种新的快速运动估计的块匹配算法,即基于直接的块匹配算法(DBM)。现有的BMA算法每帧从搜索区域中心开始搜索,耗时较长。该算法利用连续帧之间运动向量的时间相关性来减少搜索时间。前一帧的运动矢量暗示了后续帧中的运动方向,从而使搜索域最小化。实验结果表明,与现有的BMA相比,DBM在中等到低失真的情况下提供了更快的搜索速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信