Computation of optical flow using a neural network

A method for computing optical flow using a neural network is presented. Usually, the measurement primitives used for computing optical flow from successive image frames are the image-intensity values and their spatial and temporal derivatives, and tokens such as edges, corners, and linear features. Conventional methods based on such primitives suffer from edge sparsity, noise distortion, or sensitivity to rotation. The authors first fit a 2-D polynomial to find a smooth continuous image-intensity function in a window and estimate the subpixel intensity values and their principal curvatures. Under the local rigidity assumption and smoothness constraints, a neural network is then used to implement the computing procedure based on the estimated intensity values and their principal curvatures. Owing to the dense measured primitives, a dense optical flow with subpixel accuracy is obtained with only a few iterations. Since intensity values and their principle curvatures are rotation-invariant, this method can detect both rotating and translating objects in the scene. Experimental results using synthetic image sequences demonstrate the efficacy of the method.<<ETX>>

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

[2]  William B. Thompson,et al.  Lower-Level Estimation and Interpretation of Visual Motion , 1981, Computer.

[3]  J. Limb,et al.  Estimating the Velocity of Moving Images in Television Signals , 1975 .

[4]  B. Julesz Binocular depth perception of computer-generated patterns , 1960 .

[5]  Hans-Hellmut Nagel,et al.  Displacement vectors derived from second-order intensity variations in image sequences , 1983, Comput. Vis. Graph. Image Process..

[6]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[7]  Verzekeren Naar Sparen,et al.  Cambridge , 1969, Humphrey Burton: In My Own Time.

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

[9]  J. D. Robbins,et al.  Motion-compensated coding: Some new results , 1980, The Bell System Technical Journal.

[10]  Robert M. Haralick,et al.  Topographic classification of digital image intensity surfaces using generalized splines and the discrete cosine transformation , 1984, Comput. Vis. Graph. Image Process..

[11]  Jin Luo,et al.  Computing motion using analog and binary resistive networks , 1988, Computer.

[12]  N M Grzywacz,et al.  Massively parallel implementations of theories for apparent motion. , 1988, Spatial vision.

[13]  Claude L. Fennema,et al.  Velocity determination in scenes containing several moving objects , 1979 .

[14]  J. D. Robbins,et al.  Motion-compensated television coding: Part I , 1979, The Bell System Technical Journal.

[15]  R. Pogorzelski Orthogonal polynomials for engineers and physicists , 1975, Proceedings of the IEEE.

[16]  Michael A. Arbib,et al.  Computing the optic flow: The MATCH algorithm and prediction , 1983, Comput. Vis. Graph. Image Process..

[17]  B. K. Jenkins,et al.  Image restoration using a neural network , 1988, IEEE Trans. Acoust. Speech Signal Process..

[18]  Robert M. Haralick,et al.  Digital Step Edges from Zero Crossing of Second Directional Derivatives , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.