18CSE357T – BIOMETRICS
Unit –1 : Session –8 : SLO -2
1
SRM Institute of Science and Technology
Hierarchical Motion Estimation
• How can we find its minimum?
• Full search over some range of shifts
– Often used for block matching in motion compensated
video compression
– Simple to implement but slow
• To accelerate the search process
– Hierarchical motion estimation
The hierarchical (pyramid) structure of an image.
In order to create a lower resolution image from
the initial one, two approaches can be used: The
mean intensity or subsampling.
In the case of grey-level images, for the mean
intensity approach, each block of (usually) four
pixels is replaced by one, having their mean
intensity. That is:
In order to compare blocks, a measure of the block difference has to be established. The
most widely used block distance measure is the Mean Absolute Difference:
Flowchart of the generic Hierarchical
Motion Field Estimation algorithm
Hierarchical Motion Estimation
• Steps
– Construct image pyramid
– At coarser levels, search over a smaller number of
discrete pixels
– Motion estimation at coarse level is used to initialize a
smaller local search at the next finer level
• Not guaranteed to produce the same results as
a full search, but works almost as well and much
faster
Hierarchical Motion Estimation
• Image downsampling
• Coarsest level: search for the best that
minimize the difference between
– Full search over the range
• Predict a likely displacement
– Search over displacement is repeated at the finer
level over a much narrower range
– Incremental refinement step with warped image
Fourier-based alignment
• Fourier-based alignment relies on the fact that
the Fourier transform of a shifted signal has the
same magnitude as the original signal but a
linearly varying phase.