By Topic

An adaptive regularized recursive displacement estimation algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. N. Efstratiadis ; Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA ; A. K. Katsaggelos

An adaptive regularized recursive displacement estimation algorithm is presented. An estimate of the displacement vector field (DVF) is obtained by minimizing the linearized displaced frame difference (DFD) using ν subsets (submasks) of a set of points that belong to a causal neighborhood (mask) around the working point. Assuming that the displacement vector is constant at all points inside the mask, ν systems of equations are formed based on the corresponding submasks. A set theoretic regularization approach is followed for solving this system of equations by using information about the noise and the solution. An expression for the variance of the linearization error is derived in quantifying the information about the noise. Prior information about the solution is incorporated into the algorithm using a causal oriented smoothness constraint (OSC) which also provides a spatially adaptive prediction model for the estimation DVF. It is shown that certain existing regularized recursive algorithms are special cases of the proposed algorithm, if a single mask is considered. Based on experiments with typical videoconferencing scenes, the improved performance of the proposed algorithm with respect to accuracy, robustness to occlusion and smoothness of the estimated DVF is demonstrated

Published in:

IEEE Transactions on Image Processing  (Volume:2 ,  Issue: 3 )