Image-flow computation: An estimation-theoretic framework and a unified perspective

Abstract Image flow is a major source of three-dimensional information. This paper describes a new framework for computing image flow from time-varying imagery. In this framework, image-flow information is classified into two categories—conservation information and neighborhood information. Each type of information is recovered in the form of an estimate accompanied by a covariance matrix. Image flow is then computed by fusing the two estimates using estimation-theoretic techniques. This framework offers the following principal advantages. First, it allows estimation of certain types of discontinuous flow fields without any a priori knowledge about the location of discontinuities. The flow fields thus recovered are not blurred at motion boundaries. Second, covariance matrices (or alternatively, confidence measures) are associated with the estimate of image flow at each stage of computation. The estimation-theoretic nature of the framework and its ability to provide covariance matrices make it very useful in the context of applications such as incremental estimation of scene depth using techniques based on Kalman filtering. Finally, this framework serves to unify various existing approaches for image-flow estimation. In this paper, two algorithms based on this framework are described and are used to recover image flow from a variety of image sequences. To illustrate the usefulness of the framework in the context of an application, the image-flow estimates and their covariance matrices recovered from some representative image sequences are also used to recover scene depth.

[1]  Hilary Buxton,et al.  Computation of optic flow from the motion of edge features in image sequences , 1984, Image Vis. Comput..

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

[3]  P. J. Burt,et al.  The Pyramid as a Structure for Efficient Computation , 1984 .

[4]  M. A. Snyder On the mathematical foundations of smoothness constraints for the determination of optical flow and for surface reconstruction , 1989, [1989] Proceedings. Workshop on Visual Motion.

[5]  Janet Aisbett,et al.  Optical Flow with an Intensity-Weighted Smoothing , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Brian G. Schunck,et al.  Image Flow: Fundamentals and Algorithms , 1988 .

[7]  Allen M. Waxman,et al.  Contour Evolution, Neighborhood Deformation, and Global Image Flow: Planar Surfaces in Motion , 1985 .

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

[9]  E H Adelson,et al.  Spatiotemporal energy models for the perception of motion. , 1985, Journal of the Optical Society of America. A, Optics and image science.

[10]  Jake K. Aggarwal,et al.  On the computation of motion from sequences of images-A review , 1988, Proc. IEEE.

[11]  Ajit Singh,et al.  An estimation-theoretic framework for image-flow computation , 1990, [1990] Proceedings Third International Conference on Computer Vision.

[12]  William H. Press,et al.  Numerical Recipes in C, 2nd Edition , 1992 .

[13]  P. Anandan Measuring Visual Motion From Image Sequences , 1987 .

[14]  Wilfried Enkelmann,et al.  Investigations of multigrid algorithms for the estimation of optical flow fields in image sequences , 1988, Comput. Vis. Graph. Image Process..

[15]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[17]  Ajit Singh,et al.  Image-flow computation: estimation-theoretic framework, unification and integration , 1990 .