Zero-motion vector-biased cross-diamond search algorithm for rapid block matching motion estimation

Author(s):  
Xiaoquan Yi ◽  
Nam Ling

The impact of search pattern is a crucial part in the block-based motion estimation for finding the motion vector. An issue of distortion performance and search speed heavily depends upon the size and shape of search strategy applied. Performing the deep analysis for motion vector distribution on standard test videos, it is desirable to have such type of algorithm that meets the requirement of searching motion vector in less time. Hence, a new kind of Pentagon algorithm is proposed in this paper for fast block-matching motion estimation (BMME). It is an easy and efficient technique for finding motion vector. Experimental results expose the proposed Pentagon algorithm sparsely surpass the noted Diamond search (DS) algorithm. The new Pentagon search algorithm is examined with the previously proposed Diamond search algorithm in terms of performance measure; the proposed algorithm attains better performance with the less complexity. The experimental examination also depicts that the pentagon algorithm is better than the previously proposed Diamond search (DS) in terms of mean-square error performance and required the number of search points. The overall speed improvement rate (SIR) is about 31% with respect to the DS.


2012 ◽  
Vol 433-440 ◽  
pp. 3713-3717
Author(s):  
Wen Jing Hao ◽  
Li Cai Zhang ◽  
Yan Ni Wang

According to the time and space distribution of the video sequence image motion vector and the fact that the horizontal component of the non-zero motion vector is often more than the vertical component, this paper presents a cross-diamond search algorithm for motion estimation based on projection from studying the pre-judgment zero motion vector, the starting point of search prediction, the movement type determinant, search strategy formulation and other aspects. The algorithm ensures the image quality basically unchanged. In this case, the search speed of the proposed algorithm speeds up 95-245 times than full search and 4-6 times than the fast motion estimation algorithm. The proposed algorithm has a strong real-time character and an easy hardware implementation.


Sign in / Sign up

Export Citation Format

Share Document