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.