Flexible Motion Vector Resolution Prediction for Video Coding

2019 ◽  
Vol 29 (11) ◽  
pp. 3302-3316 ◽  
Author(s):  
Bappaditya Ray ◽  
Mohamed-Chaker Larabi ◽  
Joel Jung
Keyword(s):  
2007 ◽  
Vol 12 (6) ◽  
pp. 565-573
Author(s):  
Won-Jun Choi ◽  
Doug-Young Suh ◽  
Kyu-Heon Kim ◽  
Gwang-Hoon Park

Author(s):  
Amin Zheng ◽  
Yuan Yuan ◽  
Hong Zhang ◽  
Haitao Yang ◽  
Pengfei Wan ◽  
...  

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.


2012 ◽  
Vol 457-458 ◽  
pp. 867-871
Author(s):  
Xi Nan Zhang ◽  
Ai Lin Liu

To reduce the complexity of AVS sub-pixel motion vector search, this paper proposes a new improved algorithm based on little diamond window searching policies according to the law of the general video sequence motion vector focusing on the near of the initial searching point at the time of the subpixel motion estimation on the basis of deeping analysis to HFPS algorithm. Comparing with the sub-pixel HFPS algorithm search algorithm, the time of sub-pixel motion estimation can reduce 51.97% on average and efficiently decrease the computational number of sub-pixel motion estimation on average PSNR lost less than 0.01dB to the video sequences with different motion characteristics.


Sign in / Sign up

Export Citation Format

Share Document