Computational Aspects of Determining Optical Flow
Abstract
We study some computational aspects of determining optical flow. Necessary and sufficient con- ditions are investigated for the existence and uniqueness of the smoothing-spline from regularization. We discuss different boundary conditions: free, Neuman, and Dirich- let boundary conditions. We show that both free and Neuman boundary problems are ill-conditioned, and are not appropriate for optical flow computation. We discuss Dirichlet boundary problem in more details. As a com- mon practice in low-level vision, a continuous problem is formulated, and a discrete version of the problem is solved instead. We estimate the discretization errors, and com- pute the resulting discrete smoothing-splines. We study efficient iterative methods for solving the system of linear equations for the discrete smoothing-splines. We propose the Chebyshev method for the computation. The Cheby- shev method converges faster than the Gauss-Seidel and Jacobi methods, and is parallelizable.
Cite
Text
Lee et al. "Computational Aspects of Determining Optical Flow." IEEE/CVF International Conference on Computer Vision, 1988. doi:10.1109/CCV.1988.590041Markdown
[Lee et al. "Computational Aspects of Determining Optical Flow." IEEE/CVF International Conference on Computer Vision, 1988.](https://mlanthology.org/iccv/1988/lee1988iccv-computational/) doi:10.1109/CCV.1988.590041BibTeX
@inproceedings{lee1988iccv-computational,
title = {{Computational Aspects of Determining Optical Flow}},
author = {Lee, David and Papageorgiou, Anargyros and Wasilkowski, Grzegorz W.},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {1988},
pages = {612-618},
doi = {10.1109/CCV.1988.590041},
url = {https://mlanthology.org/iccv/1988/lee1988iccv-computational/}
}