1996
DOI: 10.1109/34.544079
|View full text |Cite
|
Sign up to set email alerts
|

Euclidean shape and motion from multiple perspective views by affine iterations

Abstract: Abstract-In this paper, we describe a method for solving the Euclidean reconstruction problem with a perspective camera model by incrementally performing Euclidean reconstruction with either a weak or a paraperspective camera model. With respect to other methods that compute shape and motion from a sequence of images with a calibrated camera, this method converges in a few iterations, is computationally efficient, and solves for the sign (reversal) ambiguity. We give a detailed account of the method, analyze i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
63
0

Year Published

1996
1996
2013
2013

Publication Types

Select...
5
4
1

Relationship

1
9

Authors

Journals

citations
Cited by 104 publications
(63 citation statements)
references
References 8 publications
0
63
0
Order By: Relevance
“…Although the experimental results show that there are little convergence problems, we have been unable to study the convergence of the algorithm from a theoretical point of view. We studied its convergence based on some numerical and practical considerations which allow one to determine in advance the optimal experimental setup under which convergence can be guaranteed [2]. In the future we plan to study more thoroughly the convergence of this type of algorithms.…”
Section: Resultsmentioning
confidence: 99%
“…Although the experimental results show that there are little convergence problems, we have been unable to study the convergence of the algorithm from a theoretical point of view. We studied its convergence based on some numerical and practical considerations which allow one to determine in advance the optimal experimental setup under which convergence can be guaranteed [2]. In the future we plan to study more thoroughly the convergence of this type of algorithms.…”
Section: Resultsmentioning
confidence: 99%
“…If the perspective depths λ ij are known, the perspective factorization problem is identical to the affine factorization problem. Christy & Horaud [19] and Fujiki & Kurata [20] suggested a method that consists in incrementally estimating the depth parameters starting with a weak-perspective (or a paraperspective) approximation (λ ij = 1). Each iteration updates the perspective depths and allows to solve for the reversal ambiguity.…”
Section: Previous Workmentioning
confidence: 99%
“…The factorization algorithm [Tomasi and Kanade, 1992] is a popular approach to the SFM problem, and although initially an orthographic camera was assumed, the approach has been extended to perspective projection as well [Christy and Horaud, 1996].…”
Section: Shape Estimationmentioning
confidence: 99%