By Topic

Novel block-matching algorithms by subsampling both search candidates and pixels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jiang Wenbin ; Dept. of Electronics & Information Engineering, Huazhong Univ. of Science and Technology, Wuhan 430074, P. R. China ; Zhou Manli ; Peng Fuyuan ; Xu Yiping

A new faster block-matching algorithm (BMA) by using both search candidate and pixel subsampling is proposed. Firstly a pixel-subsampling approach used in adjustable partial distortion search (APDS) is adjusted to visit about half points of all search candidates by subsampling them, using a spiral-scanning path with one skip. Two selected candidates that have minimal and second minimal block distortion measures are obtained. Then a fine-tune step is taken around them to find the best one. Some analyses are given to approve the rationality of the approach of this paper. Experimental results show that, as compared to APDS, the proposed algorithm can enhance the block-matching speed by about 30; while rnaintaining its MSE performance very close to that of it. And it performs much better than many other BMAs such as TSS, NTSS, UCDBS and NPDS.

Published in:

Journal of Systems Engineering and Electronics  (Volume:16 ,  Issue: 3 )