Improved Fast Block Matching Algorithm in Feature Domain
Y.H. Fok, O.C. Au · 1994
A fast block matching algorithm in the feature domain was proposed by Fok and Au with a computation reduction factor of N/2 for a search block size of NN. Although the algorithm can achieve close-to-optimal result, it requires a large amount of memory to store the features. This paper presents three improved fast block matching algorithms in the integral projections feature domain which can also reduce the computation significantly but with a considerably lower memory requirement. With a search block size of NN, two of our algorithms retain a computation reduction factor of N/2 while the other one can achieve a computation reduction factor of N. The three algorithms can achieve close-to-optimal performance in mean absolute difference(MAD) sense. Keywords: block matching algorithm, feature domain, integral projections, motion estimation 1. INTRODUCTION The raw data rate of video sequences is usually very large. Video compression is needed to reduce the video data rate for transmissio...