Abstract
In this paper we introduce a principled approach to modeling the image brightness constraint for optical flow algorithms. Using a simple noise model, we derive a probabilistic representation for optical flow. This representation subsumes existing approaches to flow modeling, provides insights into the behaviour and limitations of existing methods and leads to modified algorithms that outperform other approaches that use the brightness constraint. Based on this representation we develop algorithms for flow estimation using different smoothness assumptions, namely constant and affine flow. Experiments on standard data sets demonstrate the superiority of our approach.
Chapter PDF
References
Barron, J., Fleet, D., Beauchemin, S.: Performance of optical flow techniques. International Journal of Computer Vision 12, 43–77 (1994)
Horn, B., Schunck, B.: Determining optical flow. Artificial Intelligence 17, 185–203 (1981)
Lucas, B., Kanade, T.: An iterative image registration technique with an application to stereo vision. In: Proc. of DARPA Workshop, pp. 121–130 (1981)
Farneback, G.: Very high accuracy velocity estimation using orientation tensors, parametric motion, and simultaneous segmentation of the motion field. In: Proc. International Conf. on Computer Vision, vol. 1, pp. 77–80 (2001)
Papenberg, N., Bruhn, A., Brox, T., Didas, S., Weickert, J.: Highly accurate optic flow computation with theoretically justified warping. International Journal of Computer Vision. International Journal of Computer Vision (to appear)
Bruhn, A., Weickert, J., Schnorr, C.: Lucas/kanade meets horn/schunck: Combining local and global optic flow methods. International Journal of Computer Vision 61, 211–231 (2005)
Memin, E., Perez, P.: Hierarchical estimation and segmentation of dense motion fields. International Journal of Computer Vision 46, 129–155 (2002)
Weber, J., Malik, J.: Robust computation of optical-flow in a multiscale differential framework. International Journal of Computer Vision 14, 67–81 (1995)
Nestares, O., Fleet, D., Heeger, D.: Likelihood functions and confidence bounds for totalleast- squares problems. In: Proc. of IEEE Conf. on Computer Vision and Pattern Recognition, vol. I, pp. 523–530 (2000)
Wang, S., Markandey, V., Reid, A.: Total least squares fitting spatiotemporal derivatives to smooth optical flow field. In: Proc. of the SPIE: Signal and Data processing of Small Targets, vol. 1698, pp. 42–55 (1992)
Weiss, Y., Fleet, D.J.: Velocity likelihoods in biological and machine vision. In: Probabilistic Models of the Brain: Perception and Neural Function, pp. 77–96. MIT Press, Cambridge (2002)
Simoncelli, E.P., Adelson, E.H., Heeger, D.J.: Probability distributions of optical flow. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 310–315 (1991)
Bergen, J., Anandan, P., Hanna, K., Hingorani, R.: Hierarchical model- based motion estimation. In: Proc. of European Conference on Computer Vision, pp. 237–252 (1992)
Wang, J., Adelson, E.: Representing moving images with layers. IEEE Transactions on Image Processing 3, 625–638 (1994)
Ju, S., Black, M., Jepson, A.: Skin and bones: Multi-layer, locally affine, optical flow and regularization with transparency. In: IEEE Conf. on Computer Vision and Pattern Recognition, pp. 307–314 (1996)
Van Huffel, S., Vandewalle, J.: The Total Least Squares Problem: Computational Aspects and Analysis. SIAM, Philadelphia (1991)
Golub, G.H., Hansen, P.C., O’Leary, D.P.: Tikhonov regularization and total least squares. SIAM Journal on Matrix Analysis and Applications 21, 185–194 (1999)
Liu, H., Chellappa, R., Rosenfeld, A.: Accurate dense optical flow estimation using adaptive structure tensors and a parametric model. IEEE Transactions on Image Processing 12, 1170–1180 (2003)
Chojnacki, W., Brooks, M., van den Hengel, A.: Rationalising the renormalisation method of kanatani. Journal of Mathematical Imaging and Vision 14, 21–38 (2001)
Farneback, G.: Fast and accurate motion estimation using orientation tensors and parametric motion models. In: Proc. of 15th International Conference on Pattern Recognition vol. 1, pp. 135–139 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Govindu, V.M. (2006). Revisiting the Brightness Constraint: Probabilistic Formulation and Algorithms. In: Leonardis, A., Bischof, H., Pinz, A. (eds) Computer Vision – ECCV 2006. ECCV 2006. Lecture Notes in Computer Science, vol 3953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11744078_14
Download citation
DOI: https://doi.org/10.1007/11744078_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33836-9
Online ISBN: 978-3-540-33837-6
eBook Packages: Computer ScienceComputer Science (R0)