Issue No. 06 - June (1998 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.683770
<p><b>Abstract</b>—The detection of moving objects is important in many tasks. Previous approaches to this problem can be broadly divided into two classes: 2D algorithms which apply when the scene can be approximated by a flat surface and/or when the camera is only undergoing rotations and zooms, and 3D algorithms which work well only when significant depth variations are present in the scene and the camera is translating. In this paper, we describe a unified approach to handling moving-object detection in both 2D and 3D scenes, with a strategy to gracefully bridge the gap between those two extremes. Our approach is based on a stratification of the moving object-detection problem into scenarios which gradually increase in their complexity. We present a set of techniques that match the above stratification. These techniques progressively increase in their complexity, ranging from 2D techniques to more complex 3D techniques. Moreover, the computations required for the solution to the problem at one complexity level become the initial processing step for the solution at the next complexity level. We illustrate these techniques using examples from real-image sequences.</p>
Moving object detection, rigidity constraints, multiframe analysis, planar-parallax, parallax geometry, layers.
M. Irani and P. Anandan, "A Unified Approach to Moving Object Detection in 2D and 3D Scenes," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 20, no. , pp. 577-589, 1998.