Computation reduction for motion search in low rate video coders

Authors:
Jar-Ferr Yang;Shih-Cheng Chang;Chin-Yun Chen
Affiliations:
Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan;-;-
Venue:
IEEE Transactions on Circuits and Systems for Video Technology
Year:
2002

Citing 0
Cited 8

A Fast Macroblock Mode Decision Algorithm for the Baseline Profile in the H.264 Video Coding Standard

PSIVT '09 Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology
Selective VS-MRF-ME and intra coding in H.264 based on spatiotemporal continuity of motion field

Image Communication
A search patterns switching algorithm for block motion estimation

IEEE Transactions on Circuits and Systems for Video Technology
Adaptive variable block-size early motion estimation termination algorithm for H.264/AVC video coding standard

IEEE Transactions on Circuits and Systems for Video Technology
Computation reduction in motion search using early zero-block detection

SIP '07 Proceedings of the Ninth IASTED International Conference on Signal and Image Processing
Optimizing the H.264/AVC Video Encoder Application Structure for Reconfigurable and Application-Specific Platforms

Journal of Signal Processing Systems
Fast measuring particle size by using the information of particle boundary and shape

ICMLC'05 Proceedings of the 4th international conference on Advances in Machine Learning and Cybernetics
A new fast motion estimation algorithm based on the loop-epipolar constraint for multiview video coding

Image Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, computation reduction algorithms of motion estimation are developed for low rate video coders. By jointly considering motion estimation, discrete cosine transform, and quantization, the all-zero and zero-motion detection algorithms are suggested to reduce the computation of motion estimation. Simulation results show that many unnecessary computations in motion estimation are greatly reduced. For the Akiyo sequence, the proposed algorithms reduce the average numbers of search points from 28.90 and 4.99 to 2.89 and 1.40 for three-step search and diamond-search algorithms, respectively.