{"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}
引用次数: 4
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
