1988
DOI: 10.1007/bf00127823
|View full text |Cite
|
Sign up to set email alerts
|

Closed-form solutions to image flow equations for 3D structure and motion

Abstract: A major source of three-dimensional (3D) information about objects in the world is available to the observer in the form of time-varying imagery. Relative motion between textured objects and the observer generates a time-varying optic array at the image, from which image motion of contours, edge fragments, and feature points can be extracted. These dynamic features serve to sample the underlying "image flow" field. New, closed-form solutions are given for the structure and motion of planar and curved surface p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

1990
1990
2009
2009

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 86 publications
(31 citation statements)
references
References 41 publications
(95 reference statements)
0
31
0
Order By: Relevance
“…9 Then we introduce some notation to describe a surface patch up to second order. Many descriptors of shape for the purpose of vision and image processing have been used, but the descriptors that have been used most often are the principal curvatures Kmax and Kmm and the Gaussian and mean curvatures K and H.' 3 The principal curvatures are the maximum and minimum of the normal curvature Kn. The normal curvature is obtained as the curvature of the curve that one gets when one cuts the surface with a plane through the normal of the surface.…”
Section: Description Of Shape Measuresmentioning
confidence: 99%
See 1 more Smart Citation
“…9 Then we introduce some notation to describe a surface patch up to second order. Many descriptors of shape for the purpose of vision and image processing have been used, but the descriptors that have been used most often are the principal curvatures Kmax and Kmm and the Gaussian and mean curvatures K and H.' 3 The principal curvatures are the maximum and minimum of the normal curvature Kn. The normal curvature is obtained as the curvature of the curve that one gets when one cuts the surface with a plane through the normal of the surface.…”
Section: Description Of Shape Measuresmentioning
confidence: 99%
“…From the point of view of human vision, the use of the group of rotations of the plane (corresponding to torsional eye movements or torsional movements of the object) is not so easily defended. It would be more natural to study the invariants of the velocity field under the full rotation group in three dimensions, SO (3). Since this is computationally much more complex and since SO(2) is a subgroup of S0 (3), one can view the current approach as a first step.…”
Section: Introductionmentioning
confidence: 99%
“…In effect, their motion and structure algorithm divides the computation into two steps: use a normal velocity distribution to compute image velocity and its first-and second-order spatial derivatives at an image point and then use these as input to an algorithm that solves the nonlinear equations relating motion and structure to the image velocity and its first-and second-order derivatives. More recently, Subbarao [1986] and Waxman et al [1987] have proposed closed-form solutions for motion and structure. This basically involves solving a cubic equation and a set of decoupled nonlinear equations.…”
Section: Literature Surveymentioning
confidence: 99%
“…In this article the discrepancy between a motion field and the measured optic flow field is considered as another source of input error. Recentl); Waxman et al [1987] and Subbarao [1986] have presented closed-form solutions to motion and structure (at one time) even if the surface is nonplanar. As Subbarao [1986] notes, any such algorithm's error behavior can be predicted analytically.…”
Section: The Sensitivity Analysismentioning
confidence: 99%
“…This problem has also been explored by many researchers: an algorithm was proposed in 1984 by Zhuang et al [20] with a simplified version given in 1986 [21]; and a first order algorithm was given by Waxman et al [8] in 1987. Most of the algorithms start from the basic bilinear constraint relating optical flow to the linear and angular velocities and solve for rotation and translation separately using either numerical optimization techniques (Bruss and Horn [2]) or linear subspace methods (Heeger and Jepson [3,4]).…”
Section: Introductionmentioning
confidence: 99%