On Poisson solvers and semi-direct methods for computing area based optical flow

T. Simchony et al. (1990) proposed a semidirect method for computing area-based optical flow, 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. It is shown, both experimentally and through analysis, that the semidirect method converges only for a very high degree of 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. It is concluded that the semidirect method is not suited for the computation of area-based optical flow.<<ETX>>

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

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

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

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

[5]  Bart W. Stuck,et al.  A Computer and Communication Network Performance Analysis Primer (Prentice Hall, Englewood Cliffs, NJ, 1985; revised, 1987) , 1987, Int. CMG Conference.

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

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

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

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

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

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

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

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

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

[15]  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 .

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

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

[18]  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.