一种基于菱形和六边形搜索模式的快速运动估计算法

Yun Cheng, Lin Yang, Zhiwen Fang, Hailiang Hou, Ganxin Chen
{"title":"一种基于菱形和六边形搜索模式的快速运动估计算法","authors":"Yun Cheng, Lin Yang, Zhiwen Fang, Hailiang Hou, Ganxin Chen","doi":"10.1109/JCPC.2009.5420113","DOIUrl":null,"url":null,"abstract":"Based on the directional characteristic of SAD(Sum of Absolute Difference) distribution and the center-biased characteristic of motion vectors, a fast BMA(block-matching motion estimation algorithm), DHS(Diamond and Hexagon Search), is proposed in this paper. DHS employs HP to locate the best matching block with large motion vector, and diamond search pattern(DP) to refine the motion vector. Although the proposed DHS may also be trapped in local minima, the experimental results show that it is faster than UMHexagonS(Unsymmetrical-cross multi-hexagon-grid Search), while its encoding efficiency is better than DS and it is almost the same as that of UMHexagonS.","PeriodicalId":284323,"journal":{"name":"2009 Joint Conferences on Pervasive Computing (JCPC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A fast motion estimation algorithm based on Diamond and Hexagon Search patterns\",\"authors\":\"Yun Cheng, Lin Yang, Zhiwen Fang, Hailiang Hou, Ganxin Chen\",\"doi\":\"10.1109/JCPC.2009.5420113\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the directional characteristic of SAD(Sum of Absolute Difference) distribution and the center-biased characteristic of motion vectors, a fast BMA(block-matching motion estimation algorithm), DHS(Diamond and Hexagon Search), is proposed in this paper. DHS employs HP to locate the best matching block with large motion vector, and diamond search pattern(DP) to refine the motion vector. Although the proposed DHS may also be trapped in local minima, the experimental results show that it is faster than UMHexagonS(Unsymmetrical-cross multi-hexagon-grid Search), while its encoding efficiency is better than DS and it is almost the same as that of UMHexagonS.\",\"PeriodicalId\":284323,\"journal\":{\"name\":\"2009 Joint Conferences on Pervasive Computing (JCPC)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Joint Conferences on Pervasive Computing (JCPC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCPC.2009.5420113\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Joint Conferences on Pervasive Computing (JCPC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCPC.2009.5420113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

基于绝对差和(Sum of Absolute Difference, SAD)分布的方向性和运动矢量的中心偏置性,提出了一种快速的块匹配运动估计算法DHS(Diamond and Hexagon Search, Diamond and Hexagon Search)。DHS采用HP定位具有较大运动矢量的最佳匹配块,采用菱形搜索模式(DP)细化运动矢量。虽然提出的DHS也可能陷入局部极小值,但实验结果表明,它比UMHexagonS(不对称交叉多六边形网格搜索)更快,编码效率优于DS,与umhexons几乎相同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A fast motion estimation algorithm based on Diamond and Hexagon Search patterns
Based on the directional characteristic of SAD(Sum of Absolute Difference) distribution and the center-biased characteristic of motion vectors, a fast BMA(block-matching motion estimation algorithm), DHS(Diamond and Hexagon Search), is proposed in this paper. DHS employs HP to locate the best matching block with large motion vector, and diamond search pattern(DP) to refine the motion vector. Although the proposed DHS may also be trapped in local minima, the experimental results show that it is faster than UMHexagonS(Unsymmetrical-cross multi-hexagon-grid Search), while its encoding efficiency is better than DS and it is almost the same as that of UMHexagonS.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信