TY - GEN

T1 - Computing optical flow.

AU - Lee, D.

AU - Papageorgiou, A.

AU - Wasilkowski, G. W.

PY - 1989

Y1 - 1989

N2 - The authors examine some computational aspects of determining optical flow. Both area- and curve-based approaches are discussed. Necessary and sufficient conditions are investigated for the existence and uniqueness of the smoothing spline from regularization schema prevalent. The authors discuss a variety of boundary constraints: free, Neuman, Dirichlet, and two-point boundary conditions. It is shown that both free and Neuman boundary problems are ill-conditioned, and are not appropriate for optical flow computation. This partly explains why practitioners have attested to the difficulty of computing flow velocities using such regularization scheme. Therefore, it is necessary to use either Dirichlet boundary conditions or design different regularization schema. As a common practice in early vision, a continuous problem is formulated, and a discrete version of the problem is solved instead. The authors estimate the discretization errors, and compute the resulting discrete smoothing splines. They study efficient algorithms for solving the system of linear equations for the discrete smoothing splines.

AB - The authors examine some computational aspects of determining optical flow. Both area- and curve-based approaches are discussed. Necessary and sufficient conditions are investigated for the existence and uniqueness of the smoothing spline from regularization schema prevalent. The authors discuss a variety of boundary constraints: free, Neuman, Dirichlet, and two-point boundary conditions. It is shown that both free and Neuman boundary problems are ill-conditioned, and are not appropriate for optical flow computation. This partly explains why practitioners have attested to the difficulty of computing flow velocities using such regularization scheme. Therefore, it is necessary to use either Dirichlet boundary conditions or design different regularization schema. As a common practice in early vision, a continuous problem is formulated, and a discrete version of the problem is solved instead. The authors estimate the discretization errors, and compute the resulting discrete smoothing splines. They study efficient algorithms for solving the system of linear equations for the discrete smoothing splines.

UR - http://www.scopus.com/inward/record.url?scp=0024865546&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024865546&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024865546

SN - 0818619031

T3 - Proc Workshop Visual Motion

SP - 99

EP - 106

BT - Proc Workshop Visual Motion

A2 - Anon, null

T2 - Proceedings: Workshop on Visual Motion

Y2 - 28 March 1989 through 31 March 1989

ER -