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.

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 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.

An Adaptive Motion Estimation Based on the Temporal Subband Analysis

1997 ◽  
Vol 07 (05) ◽  
pp. 419-431
Author(s):  
Zung Kon Yim ◽  
Jae Ho Chung
Keyword(s):  
Motion Estimation ◽  
Motion Vector ◽  
Cost Effective ◽  
Block Matching ◽  
Scene Change Detection ◽  
Matching Algorithm ◽  
Block Matching Algorithm ◽  
Adaptive Motion ◽  
Estimation Scheme ◽  
Function Blocks

Motion Estimation is one of the key components in video coding like MPEG. In this paper, a new motion estimation scheme for a MPEG-like video coder is suggested. The proposed "adaptive motion estimation" scheme consists of five function blocks: temporal subband analysis (TSBA), extraction of temporal activity distribution (TAD), scene change detection (SCD), picture type replacement (PTR), and temporally adapted block matching algorithm (TABMA). All five function blocks are developed primarily based on the temporal subband analysis. Our new block matching algorithm TABMA is capable of controlling the size of block matching area searched. According to the significance of TAD, TABMA adjusts its nonuniform motion vector searching area. TABMA guarantees accurate and cost-effective performance. Also, newly proposed SCD and PTR together can prevent poor motion prediction for a video sequence containing abruptly changed scenes in it. As a result of that, SCD and PTR contribute to the reduction of overall computational loads, yet maintaining excellent coding quality.

scholarly journals Pattern Based Motion Estimation using Zero Motion Pre-judgement and Quantum behaved Particle Swarm Optimization

2017 ◽  
Vol 11 (1) ◽  
pp. 91-102
Author(s):  
Yogananda Patnaik ◽  
Dipti Patra
Keyword(s):  
Particle Swarm Optimization ◽  
Motion Estimation ◽  
Video Coding ◽  
Particle Swarm ◽  
Search Space ◽  
Block Matching ◽  
Search Pattern ◽  
Estimation Accuracy ◽  
Swarm Optimization ◽  
Fast Motion Estimation

Motion estimation is a fundamental and resource hungry operation in most of the video coding applications. The most popular method used in any video coding application is block matching motion estimation (BMME). This conventional fast motion estimation algorithm adopts a monotonic error surface for faster computation. However, these search techniques may trap at local minima resulting in erroneous motion estimation. To  overcome this issue, various evolutionary swarm intelligence based algorithms were proposed. In this paper, a pattern based motion estimation using zero motion prejudgment and Quantum behaved Particle Swarm Optimization (QPSO) algorithms is proposed, referred to as the Pattern Based Motion Estimation (PBME) algorithm. The notion of QPSO improves the diversity in the search space, which enhances the search efficiency and helps in reduction of the computational burden. At the same time, QPSO needs fewer parameters to control. Therefore, the proposed algorithm enhances the estimation accuracy. An initial search pattern (Hexagonal Based Search) was used which speeds the convergence rate of the algorithm. From the simulation  results, it was found that the proposed method outperformed the existing fast block matching (BMA) algorithms of the search point reduction by 40–75%

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>

scholarly journals A Survey on Block Matching Algorithms for Video Coding

2017 ◽  
Vol 7 (1) ◽  
pp. 216
Author(s):  
Adapa Venkata Paramkusam ◽  
Vuyyuru Arun
Keyword(s):  
Motion Estimation ◽  
Video Coding ◽  
Block Matching ◽  
Motion Prediction ◽  
Matching Algorithm ◽  
Block Matching Algorithm ◽  
Search Patterns ◽  
Temporal Redundancy ◽  
Shape And Size

Block matching algorithm (BMA) for motion estimation (ME) is the heart to many motion-compensated video-coding techniques/standards, such as ISO MPEG-1/2/4 and ITU-T H.261/262/263/264/265, to reduce the temporal redundancy between different frames. During the last three decades, hundreds of fast block matching algorithms have been proposed. The shape and size of search patterns in motion estimation will influence more on the searching speed and quality of performance. This article provides an overview of the famous block matching algorithms and compares their computational complexity and motion prediction quality.

Fast subpel motion estimation for H.264/advanced video coding with an adaptive motion vector accuracy decision

2012 ◽  
Vol 51 (11) ◽  
pp. 117001 ◽  
Author(s):  
Hoyoung Lee ◽  
Bongsoo Jung ◽  
Jooyoung Jung ◽  
Byeungwoo Jeon
Keyword(s):  
Motion Estimation ◽  
Video Coding ◽  
Motion Vector ◽  
Adaptive Motion ◽  
Advanced Video Coding
Sign in / Sign up

Export Citation Format

Share Document