On Poisson Solvers and Semi-Direct Methods for Computing Area Based Optical Flow

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. >

[1]  P. Swarztrauber.  THE METHODS OF CYCLIC REDUCTION, FOURIER ANALYSIS AND THE FACR ALGORITHM FOR THE DISCRETE SOLUTION OF POISSON'S EQUATION ON A RECTANGLE* , 1977 .

[2]  Clive Temperton,et al.  Direct methods for the solution of the discrete Poisson equation: Some comparisons , 1979 .

[3]  Atul Kumar Chhabra.  Algorithms and architectures for variational problems in early vision , 1991 .

[4]  G. Wasilkowski,et al.  Computing optical flow , 1989, [1989] Proceedings. Workshop on Visual Motion.

[5]  Morgan Pickering.  An Introduction to Fast Fourier Transform Methods for Partial Differential Equations, with Applications , 1986 .

[6]  Rama Chellappa,et al.  Direct Analytical Methods for Solving Poisson Equations in Computer Vision Problems , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  G. Golub,et al.  Use of fast direct methods for the efficient numerical solution of nonseparable elliptic equations. , 1972 .

[8]  Demetri Terzopoulos,et al.  Image Analysis Using Multigrid Relaxation Methods , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Ellen C. Hildreth,et al.  Measurement of Visual Motion , 1984 .

[10]  Tomaso A. Poggio,et al.  Motion Field and Optical Flow: Qualitative Properties , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[12]  Timothy A. Grogan,et al.  Uniqueness, the minimum norm constraint, and analog networks for optical flow along contours , 1990, [1990] Proceedings Third International Conference on Computer Vision.

[13]  B. L. Buzbee,et al.  The direct solution of the discrete Poisson equation on irregular regions , 1970 .

[14]  D. Brandt,et al.  Multi-level adaptive solutions to boundary-value problems math comptr , 1977 .

[15]  E. Polak,et al.  Computational methods in optimization : a unified approach , 1972 .

[16]  T. A. Grogan,et al.  On Poisson solvers and semi-direct methods for computing area based optical flow , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[17]  Ye.G. D'yakonov.  The construction of iterative methods based on the use of spectrally equivalent operators , 1966 .

[18]  Berthold K. P. Horn,et al.  Determining Optical Flow , 1981, Other Conferences.