An optimal-joint-coordinate block matching algorithm for motion-compensated coding

C.C. Lin, D. Pease, R. Raje
{"title":"An optimal-joint-coordinate block matching algorithm for motion-compensated coding","authors":"C.C. Lin, D. Pease, R. Raje","doi":"10.1109/DCC.1997.582111","DOIUrl":null,"url":null,"abstract":"Summary form only given. Block matching motion estimation/compensation has emerged as an efficient technique in removing temporal redundancies in video signals. Based on a certain distortion function, this technique searches for the best match between a block of pixels in the current picture frame and a number of blocks in close proximity in the previous frame. Most of the published block matching algorithms reduce the search area surrounding the optimum match at each search step. This paper describes a novel methodology to advance the search towards the joint coordinate of the two optimum matches in each step. A new block matching algorithm, namely optimal joint coordinate (OJC) search method, is built on this methodology to avoid redundant searches. Our algorithm relies on intensive and valid simulation results. The distortion function present in the search region is a convex function with elliptical contours.","PeriodicalId":403990,"journal":{"name":"Proceedings DCC '97. Data Compression Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '97. Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1997.582111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Summary form only given. Block matching motion estimation/compensation has emerged as an efficient technique in removing temporal redundancies in video signals. Based on a certain distortion function, this technique searches for the best match between a block of pixels in the current picture frame and a number of blocks in close proximity in the previous frame. Most of the published block matching algorithms reduce the search area surrounding the optimum match at each search step. This paper describes a novel methodology to advance the search towards the joint coordinate of the two optimum matches in each step. A new block matching algorithm, namely optimal joint coordinate (OJC) search method, is built on this methodology to avoid redundant searches. Our algorithm relies on intensive and valid simulation results. The distortion function present in the search region is a convex function with elliptical contours.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
运动补偿编码的最优关节-坐标块匹配算法
只提供摘要形式。块匹配运动估计/补偿已成为消除视频信号中时间冗余的有效技术。该技术基于一定的失真函数,在当前图像帧中的一个像素块与前一帧中邻近的一些像素块之间搜索最佳匹配。大多数已发布的块匹配算法在每个搜索步骤中都缩小了最优匹配周围的搜索区域。本文描述了一种新的方法,在每一步中向两个最优匹配的联合坐标推进搜索。在此基础上提出了一种新的块匹配算法,即最优联合坐标(OJC)搜索法,以避免冗余搜索。我们的算法依赖于大量有效的仿真结果。在搜索区域中存在的畸变函数是具有椭圆轮廓的凸函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Robust image coding with perceptual-based scalability Image coding based on mixture modeling of wavelet coefficients and a fast estimation-quantization framework Region-based video coding with embedded zero-trees Progressive Ziv-Lempel encoding of synthetic images Compressing address trace data for cache simulations
×
引用
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