High Speed Search Algorithms for Block-Based Motion Estimation Video Compression

Author(s):  
Modukuri Sushmitha ◽  
Maher Rizkalla ◽  
Paul Salama ◽  
Mohamed El-Sharkawy

Video compression is a very complex and time consuming task which generally pursuit high performance. Motion Estimation (ME) process in any video encoder is responsible to primarily achieve the colossal performance which contributes to significant compression gain. Summation of Absolute Difference (SAD) is widely applied as distortion metric for ME process. With the increase in block size to 64×64 for real time applications along with the introduction of asymmetric mode motion partitioning(AMP) in High Efficiency Video Encoding (HEVC)causes variable block size motion estimation very convoluted. This results in increase in computational time and demands for significant requirement of hardware resources. In this paper parallel SAD hardware circuit for ME process in HEVC is propound where parallelism is used at various levels. The propound circuit has been implemented using Xilinx Virtex-5 FPGA for XC5VLX20T family. Synthesis results shows that the propound circuit provides significant reduction in delay and increase in frequency in comparison with results of other parallel architectures.


10.14311/668 ◽  
2005 ◽  
Vol 45 (1) ◽  
Author(s):  
S. Usama ◽  
M. Montaser ◽  
O. Ahmed

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. 


2006 ◽  
Vol 06 (04) ◽  
pp. 533-549
Author(s):  
WEITING CAI ◽  
MALEK ADJOUADI

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.


2001 ◽  
Vol 01 (02) ◽  
pp. 231-250
Author(s):  
TIHAO CHIANG ◽  
YA-QIN ZHANG

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


2013 ◽  
Vol 284-287 ◽  
pp. 2915-2920
Author(s):  
Li Chang Liu ◽  
Jong Chih Chien ◽  
Yu Wei Hsu

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.


2011 ◽  
Vol 145 ◽  
pp. 277-281
Author(s):  
Vaci Istanda ◽  
Tsong Yi Chen ◽  
Wan Chun Lee ◽  
Yuan Chen Liu ◽  
Wen Yen Chen

As the development of network learning, video compression is important for both data transmission and storage, especially in a digit channel. In this paper, we present the return prediction search (RPS) algorithm for block motion estimation. The proposed algorithm exploits the temporal correlation and characteristic of returning origin to obtain one or two predictive motion vector and selects one motion vector, which presents better result, to be the initial search center. In addition, we utilize the center-biased block matching algorithms to refine the final motion vector. Moreover, we used adaptive threshold technique to reduce the computational complexity in motion estimation. Experimental results show that RPS algorithm combined with 4SS, BBGDS, and UCBDS effectively improves the performance in terms of mean-square error measure with less average searching points. On the other hand, accelerated RPS (ARPS) algorithm takes only 38% of the searching computations than 3SS algorithm, and the reconstruction image quality of the ARPS algorithm is superior to 3SS algorithm about 0.30dB in average overall test sequences. In addition, we create an asynchronous learning environment which provides students and instructors flexibility in learning and teaching activities. The purpose of this web site is to teach and display our researchable results. Therefore, we believe this web site is one of the keys to help the modern student achieve mastery of complex Motion Estimation.


Sign in / Sign up

Export Citation Format

Share Document