A fast block matching algorithm in the feature domain was proposed by Fok and Au (1993) which achieves a computation reduction factor of N/2 with search block size of N/spl times/N. This paper presents an improved fast block matching algorithm in the integral projections feature domain. This algorithm is based on the fast block matching algorithm in the feature domain and a new motion field sub-sampling scheme. By utilizing the properties of the features and the motion field sub-sampling scheme, with a search block size of N/spl times/N, the improved algorithm can achieve a computation reduction factor of N while retaining close-to-optimal performance in the mean absolute difference (MAD) sense.<>
An improved fast feature-based block motion estimation
Proceedings of 1st International Conference on Image Processing ; 3 ; 741-745 vol.3
1994-01-01
534030 byte
Conference paper
Electronic Resource
English
An Improved Fast Feature-Based Block Motion Estimation
British Library Conference Proceedings | 1994
|Truncated gray coding-based fast block motion estimation
British Library Online Contents | 2013
|A Robust and Fast Block Motion Estimation Algorithm
British Library Conference Proceedings | 1994
|