An Advanced Center Biased Search Algorithm for Motion Estimation
نویسندگان
چکیده
Recent studies show that the motion vector distribution within the search window shows a center biased behavior. Based on this fact, an advanced center biased search algorithm for fast block motion estimation has been proposed in this paper. The algorithm drastically reduces the computational complexity by strict application of the Unimodal Error Surface Assumption. Improved error performance has been achieved by an efficient center biased search strategy that improves the chances of getting correct motion vector. Half stop technique has been adopted to speed up the block matching process. Experimental results show that proposed algorithm has improved performance as compared to the three step search algorithm. A good predicted image quality is also achieved.
منابع مشابه
A novel unrestricted center-biased diamond search algorithm for block motion estimation
The widespread use of block-based interframe motion estimation for video sequence compression in both MPEG and H.263 standards is due to its effectiveness and simplicity of implementation. Nevertheless, the high computational complexity of the full-search algorithm has motivated a host of suboptimal but faster search strategies. A popular example is the three-step search (TSS) algorithm. Howeve...
متن کاملA Novel Hexagonal Search Algorithm for Fast Block Matching Motion Estimation
Based on real-world image sequence characteristics of center-biased motion vector distribution, a Hexagonal (HS) algorithm with center-biased checking point pattern for fast block motion estimation is proposed. The HS is compared with full search (FS), four-step search (4SS), new three-step search (NTSS), and recently proposed diamond search (DS) methods. Experimental results show that the prop...
متن کاملA Center-Biased Hybrid Search (CBHS) Method for Block Motion Estimation
This paper proposes a new method for block motion estimation based on center-biased hybrid search (CBHS) that employ a hybrid of a compact X-shaped search and a diamond search. It has only 9 search points per block for the best case and, on average, 10.2 search points. CBHS is about 22.2 times faster than the fullsearch algorithm. This paper compares the popular suboptimal block-matching techni...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملAdaptive Search Center Non-Linear Three Step Search
This paper presents a new motion estimation algorithm using an adaptive search center predicted from its adjacent blocks, and a non-linear center biased search point pattern. It does not have the problem of being trapped by local minimum, and is characterized by finding the majority motion vector in one step. When compared with six other block-based search algorithms including the full-search a...
متن کامل