{"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.