CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1995 vol.17 Issue No.11 - November
Issue No.11 - November (1995 vol.17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.473229
<p><it>Abstract</it>—The standard approach to computing motion relies on pixel correspondence. Computational schemes impose additional constraints, such as smoothness and continuity of the motion vector field, even though these are not directly related to pixel correspondence. This paper proposes an alternative to the multiple constraints approach. By drawing analogy with machine learning, motion is computed as a function that accurately predicts frames. The Occam-Razor principle suggests that among all functions that accurately predict the second frame from the first frame, the best predictor is the “simplest,” and simplicity can be rigorously defined in terms of encoding length. An implementation of a practical algorithm is described. Experiments with real video sequences verify the algorithm assumptions by showing that motion in typical sequences can be accurately described in terms of a few parameters. Our particular choice of predictors produces results that compare very favorably with other image flow algorithms in terms of accuracy and compactness. It may, however, be too constrained to enable accurate recovery of 3D motion and structure.</p>
Image motion, optic flow, video compression, machine learning, Occam algorithms.
Haim (Shvaytser) Schweitzer, "Occam Algorithms for Computing Visual Motion", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.17, no. 11, pp. 1033-1042, November 1995, doi:10.1109/34.473229