Fast block matching using prediction and rejection criteria

機構典藏 > College of Engineering > Graduate Institute & Department of Mechanical and Electro-Mechanical Engineering > Journal Article > Item 987654321/90456

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/90456

Title:	Fast block matching using prediction and rejection criteria
Authors:	Liaw, Yi-Ching;Lai, Jim Z.C;Hong, Zuu-Chang
Contributors:	淡江大學機械與機電工程學系
Keywords:	Motion estimation;Block matching;Sum pyramid;Prediction
Date:	2009-06
Issue Date:	2013-06-26 11:32:52 (UTC+8)
Publisher:	Amsterdam: Elsevier BV
Abstract:	In this paper, we present a fast block matching algorithm by making use of the correlation between layers of the sum pyramid for a block. To speed our method, an algorithm is also developed to predict the initial motion vector for a template block. Using the elimination criteria and predicted motion vector, our method can further reduce the computational complexity significantly. Compared with the full search block matching algorithm, our approach can reduce the computing time by a factor of 9.9–28.2 with the peak signal-to-noise ratio (PSNR) degradation of 0.00–0.03 dB. Compared to WinUpMI, which is the fastest block matching algorithm preserving global optimality as far as we know, our method can reduce the computing time by 4.9–52.5% with the PSNR degradation of 0.00–0.03 dB. Our method can reduce the computing time of predictive search area approach for fast block motion estimation (PSAFBME) by 50–96% with about the same PSNR.
Relation:	Signal Processing 89(6), pp.1115–1120
DOI:	10.1016/j.sigpro.2008.12.012
Appears in Collections:	[Graduate Institute & Department of Mechanical and Electro-Mechanical Engineering] Journal Article

Files in This Item:

File	Description	Size	Format
1-s2.0-S0165168408004118-main.pdf		969Kb	Adobe PDF	1	View/Open
index.html		0Kb	HTML	257	View/Open