一种新的运动估计正交菱形搜索算法

N. A. Hamid, A. M. Darsono, N. A. Manap, R. A. Manap, H. Sulaiman
{"title":"一种新的运动估计正交菱形搜索算法","authors":"N. A. Hamid, A. M. Darsono, N. A. Manap, R. A. Manap, H. Sulaiman","doi":"10.1109/I4CT.2014.6914228","DOIUrl":null,"url":null,"abstract":"Many fast Block Matching Algorithm or BMA have been proposed and developed in recent years in order to reduce the computational cost while maintaining the quality of the video signal. In this paper, a new Orthogonal-Diamond Search (ODS) is proposed which employs an orthogonal-shaped search pattern in the first step and then is switched into small diamond-shaped search pattern for the next step. The proposed algorithm and several established algorithms, namely Full Search (FS), Three-Step Search (TSS) and Diamond Search (DS) are implemented using MATLAB and their performance are being compared and analyzed in terms of computational complexity, peak signal-to-noise ratio (PSNR), and number of search points. Simulation result shows that the proposed algorithm can find motion vector with fewer number of search points while maintains close performance of video quality with other selected algorithms.","PeriodicalId":356190,"journal":{"name":"2014 International Conference on Computer, Communications, and Control Technology (I4CT)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A new Orthogonal - Diamond Search algorithm for Motion Estimation\",\"authors\":\"N. A. Hamid, A. M. Darsono, N. A. Manap, R. A. Manap, H. Sulaiman\",\"doi\":\"10.1109/I4CT.2014.6914228\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many fast Block Matching Algorithm or BMA have been proposed and developed in recent years in order to reduce the computational cost while maintaining the quality of the video signal. In this paper, a new Orthogonal-Diamond Search (ODS) is proposed which employs an orthogonal-shaped search pattern in the first step and then is switched into small diamond-shaped search pattern for the next step. The proposed algorithm and several established algorithms, namely Full Search (FS), Three-Step Search (TSS) and Diamond Search (DS) are implemented using MATLAB and their performance are being compared and analyzed in terms of computational complexity, peak signal-to-noise ratio (PSNR), and number of search points. Simulation result shows that the proposed algorithm can find motion vector with fewer number of search points while maintains close performance of video quality with other selected algorithms.\",\"PeriodicalId\":356190,\"journal\":{\"name\":\"2014 International Conference on Computer, Communications, and Control Technology (I4CT)\",\"volume\":\"112 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Computer, Communications, and Control Technology (I4CT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/I4CT.2014.6914228\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Computer, Communications, and Control Technology (I4CT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I4CT.2014.6914228","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

为了在保持视频信号质量的同时降低计算成本,近年来提出并发展了许多快速块匹配算法(fast Block Matching Algorithm, BMA)。本文提出了一种新的正交菱形搜索(ODS)方法,在第一步中采用正交搜索模式,然后在下一步中切换为小菱形搜索模式。利用MATLAB实现了本文提出的算法和现有的几种算法,即Full Search (FS)、Three-Step Search (TSS)和Diamond Search (DS),并从计算复杂度、峰值信噪比(PSNR)和搜索点数量等方面对它们的性能进行了比较和分析。仿真结果表明,该算法可以用较少的搜索点找到运动矢量,同时保持了与其他选定算法相近的视频质量性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A new Orthogonal - Diamond Search algorithm for Motion Estimation
Many fast Block Matching Algorithm or BMA have been proposed and developed in recent years in order to reduce the computational cost while maintaining the quality of the video signal. In this paper, a new Orthogonal-Diamond Search (ODS) is proposed which employs an orthogonal-shaped search pattern in the first step and then is switched into small diamond-shaped search pattern for the next step. The proposed algorithm and several established algorithms, namely Full Search (FS), Three-Step Search (TSS) and Diamond Search (DS) are implemented using MATLAB and their performance are being compared and analyzed in terms of computational complexity, peak signal-to-noise ratio (PSNR), and number of search points. Simulation result shows that the proposed algorithm can find motion vector with fewer number of search points while maintains close performance of video quality with other selected algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Time series method for machine performance prediction using condition monitoring data Model of competency for personalized training in B2B for sports industry Architecture of software tools for Domain-Specific Mathematical Modelling Region of adaptive threshold segmentation between mean, median and otsu threshold for dental age assessment Simple model following control design methods for a stable and an unstable plant
×
引用
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