快速块匹配算法在运动估计和目标跟踪中的实验比较

Sherief M. Hashimaa, I. Mahmoud, A. A. Elazm
{"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算法在复杂度和平均代价函数方面具有最佳性能。此外,它具有最小的跟踪时间消耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Downlink interference mitigation for two-tier LTE femtocell networks FPGA implementation of LMS adaptive filter Octafilar helical antenna for handheld UHF RFID reader Split ring resonator-based miniaturized antennas Proactive transmit opportunity detection in cognitive radio networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1