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 Fast Motion Estimation Algorithm using Hybrid Search Patterns for Video Streaming Application

2017 ◽  
Vol 12 (5) ◽  
pp. 715
Author(s):  
Vani Rajamanickam ◽  
Ushabhanu Nageswaran ◽  
Sangeetha Marikkannan
Keyword(s):  
Motion Estimation ◽  
Motion Vector ◽  
Block Matching ◽  
Search Pattern ◽  
Live Streaming ◽  
Hybrid Search ◽  
Fast Motion Estimation ◽  
Streaming Application ◽  
Diamond Search ◽  
Search Patterns

The objective of the paper is to develop new block matching Motion Estimation (ME) algorithm using hybrid search patterns along the direction of best match. The search efficiency for sequences with fast motions and high resolutions is improved by proposing New Cross Diagonal-Hexagon Search (NCDHS) algorithm which involves a novel multi half-hexagon grid global search pattern and a cross diagonal-hexagon local search pattern. The new search pattern enables the proposed algorithm to perform better search using 9.068 search points on an average, to obtain optimal motion vector with slight improvement in quality. This inturn reduces ME Time upto 50.11%, 47.12%, 32.99% and 43.28% on average when compared to the existing Diamond Search (DS), Hexagon Search (HS), New Cross Hexagon Search (NHEXS) and Enhanced Diamond Search (EDS) algorithms respectively. The novelty of the algorithm is further achieved by applying the algorithm proposed for live streaming application. The NCDHS algorithm is run on two MATLAB sessions on the same computer by establishing the connection using Transmission Control Protocol (TCP) /Internet Protocol (IP) network. The ME Time obtained is 14.5986 seconds for a block size 16x16, is less when compared to existing algorithms and that makes the NCDHS algorithm suitable for real time streaming application.

scholarly journals AN EFFICIENT BLOCK MATCHING ALGORITHM FOR FAST MOTION ESTIMATION USING COMBINED THREE STEP SEARCH AND DIAMOND SEARCH ALGORITHM

2016 ◽  
pp. 291-294
Author(s):  
SANTOSH KU. CHHOTRAY ◽  
DHEERAJ KANNOUJIA ◽  
SAMIR KU JHA
Keyword(s):  
Motion Estimation ◽  
Search Algorithm ◽  
Estimation Algorithm ◽  
Search Space ◽  
Block Matching ◽  
Search Pattern ◽  
Dead Cell ◽  
Fast Motion Estimation ◽  
Diamond Search ◽  
Fast Motion

Recent day Communication between ends is facilitated by the development in the area of wired and wireless networks. So many researches are going on the field of motion estimation to achieve the requirement of recent day technology. Block matching algorithms are very useful in achieving the efficient and acceptable motion estimation. Total computation cost and bit budgeting can be efficiently controlled by properly modifying block matching algorithms. Video coding using Orthogonal Logarithmic Search Algorithm (OSA) is one of the best block matching algorithms used now days. Motion estimation is the most time consuming operation in a typical video encoder. This paper presents a novel method by combining modified three step (M3SS) algorithm with a different search pattern and diamond search (DS) based on dead cell for the block based motion estimation. Result shows that from the original Three step Search (3SS/TSS ) method, the PSNR value has increased and the computations time has been reduced effectively by modified 3SS and again to increase the search space we combined diamond search(DS) algorithm. The experimental results based on different video frames were compared to demonstrate the advantages of proposed fast motion estimation algorithm.

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.

PERFORMANCE EVALUATION OF ORTHOGONAL-DIAMOND SEARCH OF BLOCK MATCHING ALGORITHM FOR VIDEO CODING

2015 ◽  
Vol 76 (1) ◽  
Author(s):  
Nurul 'Atiqah Hamid ◽  
Abdul Majid Darsono ◽  
Nurulfajar Abdul Manap ◽  
Redzuan Abdul Manap
Keyword(s):  
Signal To Noise Ratio ◽  
Video Quality ◽  
Motion Vector ◽  
Computational Cost ◽  
Block Matching ◽  
Search Pattern ◽  
Matching Algorithm ◽  
Block Matching Algorithm ◽  
Diamond Search

Several drawbacks of established fast Block Matching Algorithm (BMA) are the reasons why new fast BMAs are being developed and proposed in these recent years in order to reduce the computational cost while maintaining the quality of the video signal. In this paper, a new algorithm is proposed, namely Orthogonal-Diamond Search (ODS) which employs an orthogonal-shaped search pattern in the first step and then is switched into diamond-shaped search pattern for the next step. Few established algorithm, namely Orthogonal Search (OS), Full Search (FS), Diamond Search (DS) and Hexagon-Diamond Search (HDS) are implemented using MATLAB along with the ODS and their performance are being compared and analyzed in terms of computational complexity, peak signal-to-noise ratio (PSNR), and number of search points. Simulation result shows that the proposed algorithm can find motion vector with fewer number of search points while maintains close performance of video quality with other selected algorithms.  

Sign in / Sign up

Export Citation Format

Share Document