A new features-based fast algorithm for motion estimation: decimated integral projection (DIP)

S. Cucchi, D. Grechi
{"title":"A new features-based fast algorithm for motion estimation: decimated integral projection (DIP)","authors":"S. Cucchi, D. Grechi","doi":"10.1109/ICICS.1997.647107","DOIUrl":null,"url":null,"abstract":"Block motion estimation using exhaustive search is computationally intensive. Most of the proposed strategies reduce the algorithm complexity by limiting the number of locations searched or by pixel and motion-field sub-sampling. This is done at the expense of the accuracy of the estimation and without a substantial reduction of the computational cost. A new algorithm based on the features representation of the luminance and chrominance pixels values using integral projection is proposed. The used search strategy has the same performance of the classical exhaustive search with a computation reduction of a factor of 30. In the presented implementation a six-step fast search procedure select a small set of blocks on which exhaustive search is applied to compute the final motion vector. The presented algorithm takes advantage of a statistical partitioning of the search set, in order to progressively reduce the number of matching. A direct comparison in terms of the performance/complexity is reported with respect to other proposed solutions.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"67 1","pages":"297-300 vol.1"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息通信技术","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/ICICS.1997.647107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Block motion estimation using exhaustive search is computationally intensive. Most of the proposed strategies reduce the algorithm complexity by limiting the number of locations searched or by pixel and motion-field sub-sampling. This is done at the expense of the accuracy of the estimation and without a substantial reduction of the computational cost. A new algorithm based on the features representation of the luminance and chrominance pixels values using integral projection is proposed. The used search strategy has the same performance of the classical exhaustive search with a computation reduction of a factor of 30. In the presented implementation a six-step fast search procedure select a small set of blocks on which exhaustive search is applied to compute the final motion vector. The presented algorithm takes advantage of a statistical partitioning of the search set, in order to progressively reduce the number of matching. A direct comparison in terms of the performance/complexity is reported with respect to other proposed solutions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的基于特征的快速运动估计算法:抽取积分投影(DIP)
使用穷举搜索的块运动估计计算量很大。大多数提出的策略通过限制搜索位置的数量或通过像素和运动场子采样来降低算法的复杂度。这样做是以牺牲估计的准确性为代价的,并且没有实质性地减少计算成本。提出了一种基于亮度和色度像素值的积分投影特征表示算法。所使用的搜索策略具有与经典穷举搜索相同的性能,计算量减少了30倍。在本实现中,六步快速搜索程序选择一小组块,对其进行穷举搜索以计算最终的运动矢量。该算法利用对搜索集的统计划分来逐步减少匹配的次数。在性能/复杂性方面,报告了与其他建议的解决方案的直接比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
1369
期刊介绍:
期刊最新文献
HMM speech recognition with reduced training Recovering three dimenensional hand motions of sign language from monocular image sequence A full section overhead processing chip set for 10 Gbit/s SDH-based optical fiber transmission system Processing of sound field signal of a constrained panel by cross-correlation Non-Gaussian signal detection from multiple sensors using the bootstrap
×
引用
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