A new prediction search algorithm for block motion estimation in video coding

1997 ◽  
Vol 43 (1) ◽  
pp. 56-61 ◽  
Author(s):  
Lijun Luo ◽  
Cairong Zou ◽  
Xiqi Gao ◽  
Zhenya He
Keyword(s):  
Motion Estimation ◽  
Video Coding ◽  
Search Algorithm ◽  
Block Motion ◽  
Block Motion Estimation

scholarly journals A Fast Fractal Video Coding Algorithm Using Cross-Hexagon Search for Block Motion Estimation

2011 ◽  
Vol 2011 ◽  
pp. 1-10 ◽  
Author(s):  
Kamel Belloulata ◽  
Shiping Zhu ◽  
Zaikuo Wang
Keyword(s):  
Motion Estimation ◽  
Video Coding ◽  
Search Algorithm ◽  
Motion Vector ◽  
Block Matching ◽  
Block Motion ◽  
Search Patterns ◽  
Vector Distribution ◽  
Search Speed ◽  
Block Motion Estimation

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.

Sign in / Sign up

Export Citation Format

Share Document