Fast Block-Based Motion Estimation Techniques in Video Compression

2008 ◽  
Author(s):  
Zi-yin Li ◽  
Xi-yong Zou
Keyword(s):  
Motion Estimation ◽  
Video Compression ◽  
Estimation Techniques ◽  
Block Based

scholarly journals A Complexity and Quality Evaluation of Block Based Motion Estimation Algorithms

10.14311/668 ◽  
2005 ◽  
Vol 45 (1) ◽  
Author(s):  
S. Usama ◽  
M. Montaser ◽  
O. Ahmed
Keyword(s):  
Performance Evaluation ◽  
Motion Estimation ◽  
Video Compression ◽  
Quality Evaluation ◽  
Point Of View ◽  
Video Sequences ◽  
Compression Algorithms ◽  
Estimation Algorithms ◽  
Block Based ◽  
A Performance

Motion estimation is a method, by which temporal redundancies are reduced, which is an important aspect of video compression algorithms. In this paper we present a comparison among some of the well-known block based motion estimation algorithms. A performance evaluation of these algorithms is proposed to decide the best algorithm from the point of view of complexity and quality for noise-free video sequences and also for noisy video sequences. 

DESIGN AND IMPLEMENTATION OF WAVELET-DOMAIN VIDEO COMPRESSION USING MULTIRESOLUTION MOTION ESTIMATION AND COMPENSATION

2006 ◽  
Vol 06 (04) ◽  
pp. 533-549
Author(s):  
WEITING CAI ◽  
MALEK ADJOUADI
Keyword(s):  
Motion Estimation ◽  
Video Compression ◽  
Discrete Wavelet ◽  
Wavelet Domain ◽  
Blocking Artifacts ◽  
Bandwidth Utilization ◽  
Video Codecs ◽  
Block Based ◽  
Entropy Encoding ◽  
Multiresolution Motion Estimation

Video compression techniques have been applied routinely in order to conserve storage space and minimize bandwidth utilization in various video applications. To reduce inter-pixel redundancies inside and between video frames, video codecs (coder/decoder or compression/decompression) are mainly characterized by applying motion estimation and motion compensation (MEMC) in combination with discrete cosine transform (DCT). However, blocking artifacts are obvious from the block-based motion estimation and transformation, especially at low bit rates. Due to the intrinsic advantages of multiresolution and scalability of discrete wavelet transform (DWT), video compression techniques have been infused with exciting prospects by the beneficial integration of motion estimation and wavelet transformation. The contributions of this paper are in (1) proposing a design architecture of the wavelet-domain encoder and decoder; (2) implementing the multiresolution motion estimation and compensation method; and in (3) realizing the dynamic entropy encoding and decoding, so as to achieve more efficient video compression than the conventional spatial domain methods for low bit rate applications without the annoying blocking artifacts.

STEREOSCOPIC VIDEO CODING USING A FAST AND ROBUST AFFINE MOTION SEARCH

2001 ◽  
Vol 01 (02) ◽  
pp. 231-250
Author(s):  
TIHAO CHIANG ◽  
YA-QIN ZHANG
Keyword(s):  
Motion Estimation ◽  
Video Compression ◽  
Exchange Process ◽  
Mode Selection ◽  
Estimation Technique ◽  
Stereoscopic Video ◽  
Compression Scheme ◽  
Selection Scheme ◽  
Affine Motion ◽  
Block Based

This paper presents a stereoscopic video compression scheme using a novel fast affine motion estimation technique. A temporal scalable approach is used to achieve backward compatibility with a standard definition TV. We use an adaptive mode selection scheme from three temporal locations in both channels. Both block-based and affine-motion based approaches are used to achieve two levels of improvements with different complexities. An innovative motion estimation technique using Gauss–Newton optimization and pyramid processing is implemented to efficiently estimate affine parameters. Unlike other Gauss–Newton approaches, our search technique uses only addition, subtraction and multiplication and it converges within four iterations, which implies great complexity reduction. An efficient and robust affine motion prediction yields significant over the disparity-based approach. Part of the disparity-based approach has been tested in the rigorous MPEG-2 bitstream exchange process, and adopted in the MPEG-2 Multi-View Profile (MVP).

A Generalized Frame-Level FSBM FLSA Architecture

2013 ◽  
Vol 284-287 ◽  
pp. 2915-2920
Author(s):  
Li Chang Liu ◽  
Jong Chih Chien ◽  
Yu Wei Hsu
Keyword(s):  
Motion Estimation ◽  
Video Compression ◽  
Block Size ◽  
Block Matching ◽  
Full Detail ◽  
Pipelined Architectures ◽  
Block Level ◽  
Generalized Frame ◽  
Block Based ◽  
Memory Accesses

Block-based motion estimation plays important roles in video applications such as video compression to detect movements as well as remove temporal redundancies between successive frames. Full-search block-matching (FSBM) is the preferred algorithm for accurate motion estimation. Frame-level pipelined systolic array (FLSA) FSBM architectures have advantages over block-level pipelined architectures in their simpler control and reduced number of memory accesses. In this paper, a frame-level pipelined FSBM motion estimation architecture using array processor for any square, N×N, block size is presented in full detail.

scholarly journals Literature survey on motion estimation techniques

2018 ◽  
Vol 7 (2.12) ◽  
pp. 394
Author(s):  
S Mahaboob Basha ◽  
M Kannan
Keyword(s):  
Motion Estimation ◽  
Video Compression ◽  
Motion Compensation ◽  
Literature Survey ◽  
Block Matching ◽  
Estimation Techniques ◽  
Compression Performance ◽  
Diamond Search ◽  
Full Search

Motion Estimation (ME) is one of the most intensive computational operations in video compression techniques. Video compression algo-rithm utilizes numerous standards such as MPEG1, MPEG4 AND H.261, H.264. Compression performance can be increased drastically by efficient motion estimation techniques by which energy is reduced within the residual frames involved in motion compensation. In this paper literature survey of motion estimation especially considering block matching ME (Motion Estimation). In this paper, comparison is made between the already existing block matching algorithms and their limitations in motion estimation along with their applications. Many algorithms including Three Step Search (TSS), Improved Three Step Search (ITSS), New Three Step Search (NTSS), Four Step Search (4SS), Diamond Search (DS), Flexible Triangle Search(FTS), Full Search(FS), Modified Full Search(MDF) are compared and their per-formance measures are discussed in this paper.  

Sign in / Sign up

Export Citation Format

Share Document