Image Analysis Using Multigrid Relaxation Methods
IEEE Transactions on Pattern Analysis and Machine Intelligence
Motion Field and Optical Flow: Qualitative Properties
IEEE Transactions on Pattern Analysis and Machine Intelligence
Direct Analytical Methods for Solving Poisson Equations in Computer Vision Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms and architectures for variational problems in early vision
Algorithms and architectures for variational problems in early vision
Measurement of Visual Motion
Physically Based Adaptive Preconditioning for Early Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.14 |
Simchony, Chellappa, and Shao (1990) proposed a semi-direct method for computing area based optical flow. Their method is based on the iterative application of a direct Poisson solver. This method is restricted to Dirichlet boundary conditions, i.e., it is applicable only when velocity vectors at the boundary of the domain are known a priori. The authors show, both experimentally and through analysis, that the semi-direct method converges only for very large smoothness. At such levels of smoothness, the solution is obtained merely by filling in the known boundary values; the data from the image is almost totally ignored. Next, the authors consider the Concus and Golub method (1973), another semi-direct method, for computing optical flow. This method always converges, but the convergence is too slow to be of any practical value. The authors conclude that semi-direct methods are not suited for the computation of area based optical flow.