Fast block matching using prediction and rejection criteria

淡江大學機構典藏 > 工學院 > 機械與機電工程學系暨研究所 > 期刊論文 > Item 987654321/90456

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/90456

題名:	Fast block matching using prediction and rejection criteria
作者:	Liaw, Yi-Ching;Lai, Jim Z.C;Hong, Zuu-Chang
貢獻者:	淡江大學機械與機電工程學系
關鍵詞:	Motion estimation;Block matching;Sum pyramid;Prediction
日期:	2009-06
上傳時間:	2013-06-26 11:32:52 (UTC+8)
出版者:	Amsterdam: Elsevier BV
摘要:	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.
關聯:	Signal Processing 89(6), pp.1115–1120
DOI:	10.1016/j.sigpro.2008.12.012
顯示於類別:	[機械與機電工程學系暨研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
1-s2.0-S0165168408004118-main.pdf		969Kb	Adobe PDF	1	檢視/開啟
index.html		0Kb	HTML	258	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章