Video Block Motion Estimation Based on Walsh-Hadamard Projection Kernels

2014 ◽  
Vol 971-973 ◽  
pp. 1847-1852
Author(s):  
Jia Ge ◽  
Jia Song Wu ◽  
Zhi Fang Dong ◽  
Hua Zhong Shu
Keyword(s):  
Computational Complexity ◽  
Motion Estimation ◽  
Absolute Difference ◽  
Integral Image ◽  
Block Basis ◽  
Block Motion ◽  
Diamond Search ◽  
Estimation Scheme ◽  
Block Motion Estimation ◽  
Full Search

In modern video coders, motion is estimated using an algorithm that calculates the distance and direction of motion on a block-by-block basis. In this paper, a new motion estimation scheme is proposed. This scheme uses the sum of absolute difference between the Walsh-Hadamard projections of two blocks as measurement. And integral image is used to perform the scheme. Different from other methodologies using WH projections, the method proposed in this paper does not require iteration over every position to effectively calculate the WH projections of a block at any location. And the complexity of this scheme is regardless of the size (2N×2N) of the block. Comparing to the methods (Full Search, Three Step Search and Diamond Search) based on sum of absolute differences (SAD), experiments show that the proposed scheme significantly reduces computational complexity with little increase in the bit-rate.

A novel diamond search algorithm for fast block motion estimation

2010 ◽  
Author(s):  
Jin-xiao Yang ◽  
Yong-bo Zhang ◽  
Li-hao Huang ◽  
De-chun Guo ◽  
Yong-kun Yang
Keyword(s):  
Motion Estimation ◽  
Search Algorithm ◽  
Block Motion ◽  
Diamond Search ◽  
Diamond Search Algorithm ◽  
Block Motion Estimation

FAST MOTION ESTIMATION SCHEME FOR VIDEO CODING USING FEATURE VECTOR MATCHING AND MOTION VECTOR'S CORRELATIONS

1999 ◽  
Vol 09 (01n02) ◽  
pp. 67-82
Author(s):  
TINGRONG ZHAO ◽  
MASAO YANAGISAWA ◽  
TATSUO OHTSUKI
Keyword(s):  
Computational Complexity ◽  
Motion Estimation ◽  
Block Matching ◽  
Boolean Logic ◽  
Phase Matching ◽  
Data Set ◽  
Pixel Intensity ◽  
Binary Phase ◽  
Estimation Scheme ◽  
Full Search

In this paper, we propose a fast block motion estimation scheme by exploiting the correlations of motion vectors (MV) existing in spatially- and temporally-adjacent as well as hierarchically-related blocks. The basic idea is to use the information obtained from the corresponding block at a coarser resolution level and spatio-temporal neighboring blocks at the same level in order to select a good set of initial MV candidates and then perform further local search to find the best matching MV. In order to further reduce computational complexity, the sign pattern vector (SPV) is defined and used for block matching, as opposed to the pixel intensity values used in the conventional block matching methods. By using the SPV definition, a data block can be presented by a mean and a set of binary sign patterns with a much reduced data set. The block matching motion estimation is then divided into mean matching and binary phase matching. The proposed technique enables a significant reduction in computational complexity compared with the conventional block matching motion estimation (ME) because binary phase matching only involves Boolean logic operations. This scheme also significantly reduces the data transfer time between the frame buffer and motion estimator. Our test results indicate that the performance of the proposed scheme is comparable with the full-search block matching under the same search ranges, however, the proposed scheme has a speed-up factor ranging from 250 to 370 in comparison with full search.

Sign in / Sign up

Export Citation Format

Share Document