基于降位的最优运动估计及其低功耗VLSI实现

S. Agha, Farmanullah Jan, Dilshad Sabir, Khurram Saleem, Usman Ali Gulzari, Atif Shakeel
{"title":"基于降位的最优运动估计及其低功耗VLSI实现","authors":"S. Agha, Farmanullah Jan, Dilshad Sabir, Khurram Saleem, Usman Ali Gulzari, Atif Shakeel","doi":"10.1109/ICSIPA.2017.8120620","DOIUrl":null,"url":null,"abstract":"Full search Motion Estimation (M.E.) process is computationally intensive and power consuming, which might be unsuitable for battery powered real time applications. In this work, different M.E. algorithms are being presented. Algorithms 1 to 3 are beneficial for low power and high throughput VLSI implementation while keeping the quality at optimum level. Three VLSI architectures are presented corresponding to the three algorithms. Theoretically, Architecture 1 reduces the pixel accesses from memory and hence power consumption by 23%. Architecture 2 reduces the pixel accesses by 48% and Architecture 3 reduces pixel accesses by 52%. Finally we present a suboptimal fast M.E. algorithm which is a modified form of Diamond Search algorithm, has less complexity and improved quality as compared to standard diamond search M.E. algorithm.","PeriodicalId":268112,"journal":{"name":"2017 IEEE International Conference on Signal and Image Processing Applications (ICSIPA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimal motion estimation using reduced bits and its low power VLSI implementation\",\"authors\":\"S. Agha, Farmanullah Jan, Dilshad Sabir, Khurram Saleem, Usman Ali Gulzari, Atif Shakeel\",\"doi\":\"10.1109/ICSIPA.2017.8120620\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Full search Motion Estimation (M.E.) process is computationally intensive and power consuming, which might be unsuitable for battery powered real time applications. In this work, different M.E. algorithms are being presented. Algorithms 1 to 3 are beneficial for low power and high throughput VLSI implementation while keeping the quality at optimum level. Three VLSI architectures are presented corresponding to the three algorithms. Theoretically, Architecture 1 reduces the pixel accesses from memory and hence power consumption by 23%. Architecture 2 reduces the pixel accesses by 48% and Architecture 3 reduces pixel accesses by 52%. Finally we present a suboptimal fast M.E. algorithm which is a modified form of Diamond Search algorithm, has less complexity and improved quality as compared to standard diamond search M.E. algorithm.\",\"PeriodicalId\":268112,\"journal\":{\"name\":\"2017 IEEE International Conference on Signal and Image Processing Applications (ICSIPA)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Signal and Image Processing Applications (ICSIPA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSIPA.2017.8120620\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Signal and Image Processing Applications (ICSIPA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSIPA.2017.8120620","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

全搜索运动估计(M.E.)过程计算量大,功耗大,可能不适合电池供电的实时应用。在这项工作中,不同的M.E.算法被提出。算法1至算法3有利于低功耗和高吞吐量VLSI实现,同时保持最佳质量水平。针对这三种算法,给出了三种VLSI架构。理论上,架构1减少了内存中的像素访问,从而减少了23%的功耗。架构2减少了48%的像素访问,架构3减少了52%的像素访问。最后,我们提出了一种次优快速M.E.算法,该算法是对钻石搜索算法的改进形式,与标准钻石搜索M.E.算法相比,具有更低的复杂度和更高的质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal motion estimation using reduced bits and its low power VLSI implementation
Full search Motion Estimation (M.E.) process is computationally intensive and power consuming, which might be unsuitable for battery powered real time applications. In this work, different M.E. algorithms are being presented. Algorithms 1 to 3 are beneficial for low power and high throughput VLSI implementation while keeping the quality at optimum level. Three VLSI architectures are presented corresponding to the three algorithms. Theoretically, Architecture 1 reduces the pixel accesses from memory and hence power consumption by 23%. Architecture 2 reduces the pixel accesses by 48% and Architecture 3 reduces pixel accesses by 52%. Finally we present a suboptimal fast M.E. algorithm which is a modified form of Diamond Search algorithm, has less complexity and improved quality as compared to standard diamond search M.E. algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Enhanced forensic speaker verification using multi-run ICA in the presence of environmental noise and reverberation conditions A real-time multi-class multi-object tracker using YOLOv2 Hybrid neural network and regression tree ensemble pruned by simulated annealing for virtual flow metering application Hybrid DWT and MFCC feature warping for noisy forensic speaker verification in room reverberation A deep architecture for face recognition based on multiple feature extraction techniques
×
引用
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