scholarly journals AN EFFICIENT THREE STEP ALGORITHM FOR FAST MOTION ESTIMATION IN MOBILE DOMAIN

2016 ◽  
pp. 231-234
Author(s):  
SANTOSH KU. CHHOTRAY ◽  
MANOJIT PANDA ◽  
SWAPNILA S. DASH
Keyword(s):  
Motion Estimation ◽  
Search Algorithm ◽  
Computation Time ◽  
Block Matching ◽  
Search Pattern ◽  
Dead Cell ◽  
Fast Method ◽  
Fast Motion Estimation ◽  
Block Matching Algorithm ◽  
Step Algorithm

The goal of this work is to find a fast method for motion estimation and motion segmentation using proposed model. Recent day Communication between ends is facilitated by the development in the area of wired and wireless networks. Block matching algorithms are very useful in achieving the efficient and acceptable compression. Block matching algorithm defines the total computation cost and effective bit budget. Recently fast search algorithm for video coding using Orthogonal Logarithmic Search Algorithm (OSA) has been proposed. Motion estimation is the most time consuming operation in a typical video encoder. This paper presents a novel method using three step algorithm with modified search pattern based on dead cell for the block based motion estimation. It has been found that from the original Three step Search (3SS/TSS ) method, the PSNR value has increased and the computations and thus computation time (faster) has been reduced significantly .The experimental results based on the number of video sequences were presented to demonstrate the advantages of proposed motion estimation technique.

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 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 Adaptive Motion Estimation Scheme for Video Coding

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Pengyu Liu ◽  
Yuan Gao ◽  
Kebin Jia
Keyword(s):  
Motion Estimation ◽  
Video Coding ◽  
Motion Vector ◽  
Rate Distortion ◽  
Block Matching ◽  
Search Pattern ◽  
Fast Motion Estimation ◽  
Search Patterns ◽  
Adaptive Motion ◽  
Estimation Scheme

The unsymmetrical-cross multihexagon-grid search (UMHexagonS) is one of the best fast Motion Estimation (ME) algorithms in video encoding software. It achieves an excellent coding performance by using hybrid block matching search pattern and multiple initial search point predictors at the cost of the computational complexity of ME increased. Reducing time consuming of ME is one of the key factors to improve video coding efficiency. In this paper, we propose an adaptive motion estimation scheme to further reduce the calculation redundancy of UMHexagonS. Firstly, new motion estimation search patterns have been designed according to the statistical results of motion vector (MV) distribution information. Then, design a MV distribution prediction method, including prediction of the size of MV and the direction of MV. At last, according to the MV distribution prediction results, achieve self-adaptive subregional searching by the new estimation search patterns. Experimental results show that more than 50% of total search points are dramatically reduced compared to the UMHexagonS algorithm in JM 18.4 of H.264/AVC. As a result, the proposed algorithm scheme can save the ME time up to 20.86% while the rate-distortion performance is not compromised.

An Efficient Motion Estimation Algorithm for H.264/AVC

2013 ◽  
Vol 446-447 ◽  
pp. 997-1001
Author(s):  
Xing Hui Zhang
Keyword(s):  
Motion Estimation ◽  
Estimation Algorithm ◽  
Block Matching ◽  
Search Pattern ◽  
Fast Motion Estimation ◽  
Estimation Algorithms ◽  
Starting Point ◽  
Merging Process ◽  
Fast Motion ◽  
Motion Estimation Algorithm

The efficient motion estimation algorithms are the important research hotspot in the real-time video coding-decoding technology. This paper proposes a novel and simple fast motion estimation algorithm based on adaptive search-pattern. The new algorithm includes three schemes: stationary block prediction, predictive search for non-stationary blocks, choosing a starting point and adaptive refinement search in merging process. Experiments show that the efficient motion estimation algorithm proposed can further reduce the computations of block-matching while improve the compression effect.

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.

Sign in / Sign up

Export Citation Format

Share Document