New fast-search algorithm for block matching motion estimation using temporal and spatial correlation of motion vector

2000 ◽  
Vol 46 (4) ◽  
pp. 934-942 ◽  
Author(s):  
Jae-Yeal Nam ◽  
Jae-Soo Seo ◽  
Jin-Suk Kwak ◽  
Myoung-Ho Lee ◽  
Yeong Ho Ha
Keyword(s):  
Motion Estimation ◽  
Spatial Correlation ◽  
Search Algorithm ◽  
Motion Vector ◽  
Block Matching ◽  
Fast Search ◽  
Fast Search Algorithm ◽  
Temporal And Spatial

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.

scholarly journals A New Pentagon Search Algorithm for Fast Block-Matching Motion Estimation

2019 ◽  
Vol 8 (10) ◽  
pp. 4125-4130
Keyword(s):  
Motion Estimation ◽  
Search Algorithm ◽  
Motion Vector ◽  
Performance Measure ◽  
Block Matching ◽  
Search Pattern ◽  
Error Performance ◽  
Improvement Rate ◽  
Diamond Search ◽  
The Impact

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.

scholarly journals A Three-Point Directional Search Block Matching Algorithm

2017 ◽  
Vol 7 (1) ◽  
pp. 230 ◽  
Author(s):  
A.V. Paramkusam ◽  
D. Laxma Reddy
Keyword(s):  
Motion Estimation ◽  
Motion Vector ◽  
Block Matching ◽  
Search Pattern ◽  
Fast Search ◽  
Block Matching Algorithm ◽  
Estimation Algorithms ◽  
Search Patterns ◽  
Search Speed ◽  
Minimum Block

<p>This paper proposes compact directional asymmetric search patterns, which we have named as three-point directional search (TDS). In most fast search motion estimation algorithms, a symmetric search pattern is usually set at the minimum block distortion point at each step of the search. The design of the symmetrical pattern in these algorithms relies primarily on the assumption that the direction of convergence is equally alike in each direction with respect to the search center. Therefore, the monotonic property of real-world video sequences is not properly used by these algorithms. The strategy of TDS is to keep searching for the minimum block distortion point in the most probable directions, unlike the previous fast search motion estimation algorithms where all the directions are checked. Therefore, the proposed method significantly reduces the number of search points for locating a motion vector. Compared to conventional fast algorithms, the proposed method has the fastest search speed and most satisfactory PSNR values for all test sequences.</p>

Sign in / Sign up

Export Citation Format

Share Document