{"title":"Improved parabolic prediction-based fractional search for H.264/AVC video coding","authors":"Yashen Lin, Yi Chun Wang","doi":"10.1049/IET-IPR.2008.0192","DOIUrl":null,"url":null,"abstract":"In this study, the authors propose an efficient fractional pixel search algorithm for H.264/AVC video coding to reduce the computational complexity in half/quarter-pixel motion estimation. A prediction for the optimal motion vector is derived under the assumption that the sum of absolute transform differences error surface is a symmetric parabolic function. With the optimal region, a decision rule for half-pixel search is proposed. The experimental result shows that approximately two search points are required. Based on the half-pixel search, a hierarchical quarter-pixel search is described and an extra three search points, on average, are consumed for each quarter-pixel search. Experimental results show that significant reduction in computation can be achieved, while maintaining high coding efficiency.","PeriodicalId":13486,"journal":{"name":"IET Image Process.","volume":"105 1","pages":"261-271"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Image Process.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/IET-IPR.2008.0192","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
In this study, the authors propose an efficient fractional pixel search algorithm for H.264/AVC video coding to reduce the computational complexity in half/quarter-pixel motion estimation. A prediction for the optimal motion vector is derived under the assumption that the sum of absolute transform differences error surface is a symmetric parabolic function. With the optimal region, a decision rule for half-pixel search is proposed. The experimental result shows that approximately two search points are required. Based on the half-pixel search, a hierarchical quarter-pixel search is described and an extra three search points, on average, are consumed for each quarter-pixel search. Experimental results show that significant reduction in computation can be achieved, while maintaining high coding efficiency.