{"title":"快速块匹配算法在运动估计和目标跟踪中的实验比较","authors":"Sherief M. Hashimaa, I. Mahmoud, A. A. Elazm","doi":"10.1109/NRSC.2011.5873609","DOIUrl":null,"url":null,"abstract":"In this paper two different Fast Block Matching Algorithms (FBMAs) are introduced and analyzed. They are One Point Pentagon Inner Search (OPPEN) and Predicted One Point Hexagon Inner Search (POPHEX) algorithms. The proposed algorithms are compared with other FBMAs like Diamond Search (DS), and Hexagonal based search (HEX) algorithms using MATLAB environment. The comparison is conducted for both motion estimation and object tracking using group of known test video sequences. The results showed that the proposed OPPEN algorithm has the best performance in terms of complexity and average cost function. Also it have the smallest tracking time consumption.","PeriodicalId":438638,"journal":{"name":"2011 28th National Radio Science Conference (NRSC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Experimental comparison among Fast Block Matching Algorithms (FBMAs) for motion estimation and object tracking\",\"authors\":\"Sherief M. Hashimaa, I. Mahmoud, A. A. Elazm\",\"doi\":\"10.1109/NRSC.2011.5873609\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper two different Fast Block Matching Algorithms (FBMAs) are introduced and analyzed. They are One Point Pentagon Inner Search (OPPEN) and Predicted One Point Hexagon Inner Search (POPHEX) algorithms. The proposed algorithms are compared with other FBMAs like Diamond Search (DS), and Hexagonal based search (HEX) algorithms using MATLAB environment. The comparison is conducted for both motion estimation and object tracking using group of known test video sequences. The results showed that the proposed OPPEN algorithm has the best performance in terms of complexity and average cost function. Also it have the smallest tracking time consumption.\",\"PeriodicalId\":438638,\"journal\":{\"name\":\"2011 28th National Radio Science Conference (NRSC)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 28th National Radio Science Conference (NRSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NRSC.2011.5873609\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 28th National Radio Science Conference (NRSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NRSC.2011.5873609","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
摘要
本文介绍并分析了两种不同的快速块匹配算法。它们是一点五边形内搜索(OPPEN)和预测一点六边形内搜索(POPHEX)算法。在MATLAB环境下,将所提出的算法与其他fbma如Diamond Search (DS)和hexonal based Search (HEX)算法进行了比较。利用一组已知的测试视频序列,对运动估计和目标跟踪进行了比较。结果表明,本文提出的OPPEN算法在复杂度和平均代价函数方面具有最佳性能。此外,它具有最小的跟踪时间消耗。
Experimental comparison among Fast Block Matching Algorithms (FBMAs) for motion estimation and object tracking
In this paper two different Fast Block Matching Algorithms (FBMAs) are introduced and analyzed. They are One Point Pentagon Inner Search (OPPEN) and Predicted One Point Hexagon Inner Search (POPHEX) algorithms. The proposed algorithms are compared with other FBMAs like Diamond Search (DS), and Hexagonal based search (HEX) algorithms using MATLAB environment. The comparison is conducted for both motion estimation and object tracking using group of known test video sequences. The results showed that the proposed OPPEN algorithm has the best performance in terms of complexity and average cost function. Also it have the smallest tracking time consumption.