TY - JOUR
T1 - An Adaptive Regularized Recursive Displacement Estimation Algorithm
AU - Efstratiadis, Serafim N.
AU - Katsaggelos, Aggelos K.
N1 - Funding Information:
Manuscript received July 26, 1991; revised October 31, 1992. This work was supported in part by NATO under Grant Number 0103188 and by Siemens. The associate editor responsible for coordinating the review of this paper and approving it for publication was Dr. Alan C. Bovik.
PY - 1993/7
Y1 - 1993/7
N2 - In this paper, 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 v 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, v 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 estimated 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.
AB - In this paper, 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 v 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, v 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 estimated 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.
UR - http://www.scopus.com/inward/record.url?scp=0027628079&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027628079&partnerID=8YFLogxK
U2 - 10.1109/83.236533
DO - 10.1109/83.236533
M3 - Article
C2 - 18296222
AN - SCOPUS:0027628079
SN - 1057-7149
VL - 2
SP - 341
EP - 352
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
IS - 3
ER -