A fast full search motion estimation algorithm using sequential rejection of candidates from hierarchical decision structure

We propose a new as well as fast full search (FS) motion estimation algorithm for video coding. The computational reduction comes from sequential rejection of impossible candidates with derived formula and subblock norms. Our algorithm reduces more the computations than the FS motion estimation algo...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on broadcasting 2002-03, Vol.48 (1), p.43-46
Main Authors: KIM, Jong-Nam, KANG, Dae-Kap, BYUN, Sung-Cheal, LEE, Il-Lo, AHN, Byung-Ha
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Broadcasting
Coding
Coding, codes
Computation
Digital TV
Equations
Exact sciences and technology
Fading
Image processing
Information, signal and communications theory
Motion estimation
Norms
Probability distribution
Reduction
Rejection
Searching
Signal and communications theory
Signal processing
Statistical distributions
Telecommunications and information theory
Testing
TV broadcasting
Vehicles
Video coding
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a new as well as fast full search (FS) motion estimation algorithm for video coding. The computational reduction comes from sequential rejection of impossible candidates with derived formula and subblock norms. Our algorithm reduces more the computations than the FS motion estimation algorithms previously developed.
ISSN:0018-9316
1557-9611
DOI:10.1109/11.992854