An adaptive fast search algorithm for block motion estimation in H.264

2010 ◽  
Vol 11 (8) ◽  
pp. 637-644 ◽  
Author(s):  
Cong-dao Han ◽  
Ji-lin Liu ◽  
Zhi-yu Xiang
2002 ◽  
Vol 02 (04) ◽  
pp. 633-653
Author(s):  
SHIH-HAO KE ◽  
TSU-TIAN LEE

Block motion estimation using full search is computationally intensive. Previously proposed fast algorithms reduce computation by limiting the number of search locations and search directions in a predefined search region. This is accomplished at the expense of accuracy of motion estimation and a large mean squared error for motion-compensated images, especially for image sequences with large displacement and rotation. In this paper, a novel efficient search algorithm for block motion estimation is presented to produce better performance than some fast search algorithms that have been developed, such as three step search, orthogonal search, 2D-logarithmic search, four step search, and block-based gradient descent search, in large displacement and rotation image cases. The proposed algorithm is based on the notion of locally multi-scale operation, search of global minimum, and two layer search strategy. Experimental results show that the proposed algorithm produces anticipative performance while costing much less computation power than the full search algorithm.


2018 ◽  
Vol 12 (9) ◽  
pp. 1567-1576 ◽  
Author(s):  
Tushar Shankar Shinde ◽  
Anil Kumar Tiwari

2011 ◽  
Vol 2011 ◽  
pp. 1-10 ◽  
Author(s):  
Kamel Belloulata ◽  
Shiping Zhu ◽  
Zaikuo Wang

We propose a novel fractal video coding method using fast block-matching motion estimation to overcome the drawback of the time-consuming character in the fractal coding. As fractal encoding essentially spends most time on the search for the best-matching block in a large domain pool, search patterns and the center-biased characteristics of motion vector distribution have large impact on both search speed and quality of block motion estimation. In this paper, firstly, we propose a new hexagon search algorithm (NHEXS), and, secondly, we ameliorate, by using this NHEXS, the traditional CPM/NCIM, which is based on Fisher's quadtree partition. This NHEXS uses two cross-shaped search patterns as the first two initial steps and large/small hexagon-shaped patterns as the subsequent steps for fast block motion estimation (BME). NHEXS employs halfway stop technique to achieve significant speedup on sequences with stationary and quasistationary blocks. To further reduce the computational complexity, NHEXS employs modified partial distortion criterion (MPDC). Experimental results indicate that the proposed algorithm spends less encoding time and achieves higher compression ratio and compression quality compared with the traditional CPM/NCIM method.


2010 ◽  
Author(s):  
Jin-xiao Yang ◽  
Yong-bo Zhang ◽  
Li-hao Huang ◽  
De-chun Guo ◽  
Yong-kun Yang

Sign in / Sign up

Export Citation Format

Share Document