Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published March 7, 1994 | public
Report Open

Robust and Efficient Recovery of Rigid Motion from Subspace Constraints Solved using Recursive Identification of Nonlinear Implicit Systems

Abstract

The problem of estimating rigid motion from projections may be characterized using a nonlinear dynamical system, composed of the rigid motion transformation and the perspective map. The time derivative of the output of such a system, which is also called the "motion field", is bilinear in the motion parameters, and may be used to specify a subspace constraint on either the direction of translation or the inverse depth of the observed points. Estimating motion may then be formulated as an optimization task constrained on such a subspace. Heeger and Jepson [5], who first introduced this constraint, solve the optimization task using an extensive search over the possible directions of translation. We reformulate the optimization problem in a systems theoretic framework as the the identification of a dynamic system in exterior differential form with parameters on a differentiable manifold, and use techniques which pertain to nonlinear estimation and identification theory to perform the optimization task in a principled manner. The general technique for addressing such identification problems [14] has been used successfully in addressing other problems in computational vision [13, 12]. The application of the general method [14] results in a recursive and pseudo-optimal solution of the motion problem, which has robustness properties far superior to other existing techniques we have implemented. By releasing the constraint that the visible points lie in front of the observer, we may explain some psychophysical effects on the nonrigid percept of rigidly moving shapes. Experiments on real and synthetic image sequences show very promising results in terms of robustness, accuracy and computational efficiency.

Additional Information

Research funded by the California Institute of Technology, ONR grant N00014-93-1-0990 and an AT&T Foundation Special Purpose grant. This work is registered as CDS Technical Report CIT-CDS 94-005, California Institute of Technology, January 1994 - revised February 1994 We wish to thank Doug Shy for his help in implementing the scheme using the tensors toolbox of Matlab.

Files

CDS94-005.pdf
Files (1.8 MB)
Name Size Download all
md5:2144cfc3acd05e6a3a9a5524c839934e
919.1 kB Preview Download
md5:bb24e01a112965b418d3112cff337076
899.5 kB Download

Additional details

Created:
August 20, 2023
Modified:
October 24, 2023