Descriptive Geometry Meets Computer Vision The Geometry of Two Images (# 82)
|
|
- Poppy Ryan
- 5 years ago
- Views:
Transcription
1 Descriptive Geometry Meets Computer Vision The Geometry of Two Images (# 8) Hellmuth Stachel th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
2 Table of contents. Remarks on linear images. Geometry of two images. Numerical reconstruction of two images th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
3 . Remarks on linear images linear image nonlinear (curved) image th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
4 Central projection The central projection (according to A. Dürer) can be generalized by a central axonometry. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
5 Central axonometric principle in space E : U c in the image plane E : U g replacements E PSfrag replacements O E E U U cartesian basis O; E, E, E and points at infinity U, U, U U c E c E c O c E c U c central axonometric reference system O c ; E c, E c, E c ; U c, U c, U c th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
6 Definition of linear images There is a unique collinear transformation κ: E E mit O O c, E i E c i, U i U c i, i =,,. Any two-dimensional image of E under a collinear transformation is called linear. = { collinear points have collinear or coincident images cross-ratios of any four collinear points are preserved. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
7 Definition of linear images There is a unique collinear transformation κ: E E mit O O c, E i E c i, U i U c i, i =,,. Any two-dimensional image of E under a collinear transformation is called linear. = { collinear points have collinear or coincident images cross-ratios of any four collinear points are preserved. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
8 Central projection in coordinates PSfrag replacements Notation: Z... center H... principal point vanishing plane Π v x Π image plane x d... focal length x, x, x... camera frame Z x H c x, x... image coordinate frame x d x th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
9 Central projection in coordinates ( x x ) = d ( ) x, or homogeneous x x ξ 0 ξ ξ = d d 0 ξ 0. ξ. Transformation from the camera frame (x, x, x ) into arbitrary world coordinates (x, x, x ) and translation from the particular image frame (x, x ) into arbitrary (x, x ) gives in homogeneous form ξ 0 ξ ξ = o. R o }{{ } matrix A 0 0 h d f 0 h 0 d f ξ 0. ξ. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
10 Central projection in coordinates ( x x ) = d ( ) x, or homogeneous x x ξ 0 ξ ξ = d d 0 ξ 0. ξ. Transformation from the camera frame (x, x, x ) into arbitrary world coordinates (x, x, x ) and translation from the particular image frame (x, x ) into arbitrary (x, x ) gives in homogeneous form ξ 0 ξ ξ = o. R o }{{ } matrix A 0 0 h d f 0 h 0 d f ξ 0. ξ. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
11 Central projection in coordinates Left hand matrix: (h, h ) are image coordinates of the principal point H, (f, f ) are possible scaling factors, and d is the focal length. These parameters are called the intrinsic calibration parameters. Right hand matrix: R is an orthogonal matrix. The position of the camera frame with respect to the world coordinates defines the extrinsic calibration parameters. Photos with known interior orientation are called calibrated images, others (like central axonometries) are uncalibrated. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil 8
12 Central projection in coordinates Left hand matrix: (h, h ) are image coordinates of the principal point H, (f, f ) are possible scaling factors, and d is the focal length. These parameters are called the intrinsic calibration parameters. Right hand matrix: R is an orthogonal matrix. The position of the camera frame with respect to the world coordinates defines the extrinsic calibration parameters. Photos with known interior orientation are called calibrated images, others (like central axonometries) are uncalibrated. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil 8
13 Unknown interior calibration parameters collinear bundle transformation Z PSfrag replacements Z the bundles Z and Z of the rays of sight are collinear th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil 9
14 . Geometry of two images Given: Two linear images or two photographs. Wanted: Dimensions of the depicted D-object. Historical Stadtbahn station Karlsplatz in Vienna (Otto Wagner, 89) th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil 0
15 . Geometry of two images The geometry of two images is a classical subject of Descriptive Geometry. Its results have become standard (Finsterwalder, Kruppa, Krames, Wunderlich, Hohenberg, Tschupik, Brauner, Havlicek, H.S.,... ). Why now? Advantages of digital images: less distorsion, because no paper prints are needed, exact boundary is available, and precise coordinate measurements are possible using standard software. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
16 . Geometry of two images The geometry of two images is a classical subject of Descriptive Geometry. Its results have become standard (Finsterwalder, Kruppa, Krames, Wunderlich, Hohenberg, Tschupik, Brauner, Havlicek, H.S.,... ). Why now? Advantages of digital images: less distorsion, because no paper prints are needed, exact boundary is available, and precise coordinate measurements are possible using standard software. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
17 Computer Vision Why now? The geometry of two images is important for Computer Vision, a topic with the main goal to endow a computer with a sense of vision. Basic problems: Which information can be extracted from digital images? How to preprocess and represent this information? Sensor-guided robots, automatic vehicle control, Big Brother,... th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
18 Computer Vision Why now? The geometry of two images is important for Computer Vision, a topic with the main goal to endow a computer with a sense of vision. Basic problems: Which information can be extracted from digital images? How to preprocess and represent this information? Sensor-guided robots, automatic vehicle control, Big Brother,... th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
19 Computer Vision Recent textbooks: Yi Ma, St. Soatto, J. Košecká, S.S. Sastry: An Invitation to -D Vision. Springer-Verlag, New York 00 R. Hartley, A. Zisserman: Multiple View Geometry in Computer Vision. Cambridge University Press 000 Fortunately the authors in the cited book refer to some of these standard results (Krames, Kruppa, Wunderlich) th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
20 Geometry of two images (epipolar geometry) Z Z Z Z Z viewing situation π Z Z z l l δ Z π collinear transformations γ γ γ γ γ two images Z l π l π π π Z th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
21 Geometry of two images (epipolar geometry) Notations: line z = Z Z... baseline, Z, Z... epipoles (German: Kernpunkte), δ... epipolar plane (it is twice projecting), Z π γ Z Z Z Z l l δ Z γ γ γ γ π z l, l... pair of epipolar lines (German: Kernstrahlen), (, )... corresponding views. Z l π l π π π Z th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
22 Epipolar constraint Theorem (synthetic version): For any two linear images of a scene, there is a projectivity between two line pencils Z (δ ) Z (δ ) such that the points, are corresponding they are located on (corresponding =) epipolar lines. Theorem (analytic version): Using homogeneous coordinates for both images, there is a bilinear form β of rank such that two points = x R = (ξ 0 : ξ : ξ ) and = x R = (ξ 0 : ξ : ξ ) are corresponding β(x, x ) = i,j=0 b ij ξ i ξ j = (ξ 0 ξ ξ ) (b ij ) ξ 0 ξ ξ A = x T B x = 0. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
23 Epipolar constraint Theorem (synthetic version): For any two linear images of a scene, there is a projectivity between two line pencils Z (δ ) Z (δ ) such that the points, are corresponding they are located on (corresponding =) epipolar lines. Theorem (analytic version): Using homogeneous coordinates for both images, there is a bilinear form β of rank such that two points = x R = (ξ 0 : ξ : ξ ) and = x R = (ξ 0 : ξ : ξ ) are corresponding β(x, x ) = i,j=0 b ij ξ i ξ j = (ξ 0 ξ ξ ) (b ij ) ξ 0 ξ ξ A = x T B x = 0. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
24 Epipolar constraint Proof (analytic version): Using homogeneous line coordinates, the projectivity between the line pencils can be expressed as β : (u λ + u λ )R (u λ + u λ )R for all (λ, λ ) R \ {(0, 0)}. x and x are corresponding there is a nontrivial pair (λ, λ ) such that (u λ + u λ ) x = 0 (u λ + u λ ) x = 0. These two linear homogeneous equations in the unknowns (λ, λ ) have a nontrivial solution the determinant vanishes, i.e., β(x, x ) := (u x )(u x ) (u x )(u x ) = i,j=0 b ij ξ i ξ j = 0. There are singular points of this correspondance: Z corresponds to all, and vice versa all points correspond to Z = rk(b ij ) =. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
25 Epipolar constraint in the calibrated case Theorem: In the calibrated case the essential matrix B = (b ij ) is the product of a skew symmetric matrix and an orthogonal one, i.e., B = S R. Z Z π Z z Z Z δ Z π l x x l π Proof: We use both camera frames and the homogeneous coordinates x = Z, x = Z. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil 8
26 Epipolar constraint in the calibrated case For transforming the coordinates from the second camera frame into the first one, there is an orthogonal matrix R such that x = z + R x with R T = R and z = (z, z, z ) T = Z Z. The points,, Z, Z are coplanar the triple product of the vectors x, z and x = Z vanishes, i.e., det(x, z, x ) = x (z x ) = 0. Z Z π Z z Z Z δ Z π l x x l π th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil 9
27 Epipolar constraint in the calibrated case For transforming the coordinates from the second camera frame into the first one, there is an orthogonal matrix R such that x = z + R x with R T = R and z = (z, z, z ) T = Z Z. The points,, Z, Z are coplanar the triple product of the vectors x, z and x = Z vanishes, i.e., det(x, z, x ) = x (z x ) = 0. Z Z π Z z Z Z δ Z π l x x l π th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil 9
28 Epipolar constraint in the calibrated case We replace the vector product (z x ) by z (z + R x ) = z R x = S R x mit S = Matrix S is skew symmetric and R is orthogonal. 0 z z z 0 z z z 0 A. Hence, the coplanarity of x, x and z is equivalent to 0 = x (z x ) = x T S R }{{} B x, also B = S R. The decomposition of the fundamental matrix B into these two factors defines the relative position of the second camera frame against the first one! th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil 0
29 Epipolar constraint in the calibrated case We replace the vector product (z x ) by z (z + R x ) = z R x = S R x mit S = Matrix S is skew symmetric and R is orthogonal. 0 z z z 0 z z z 0 A. Hence, the coplanarity of x, x and z is equivalent to 0 = x (z x ) = x T S R }{{} B x, also B = S R. The decomposition of the fundamental matrix B into these two factors defines the relative position of the second camera frame against the first one! th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil 0
30 Essential matrix Theorem: The essential matrix B has two equal PSfrag replacements singular values σ := σ = σ. z Proof: We have B = S R with orthogonal R. The vector S x = z x is orthogonal zu the orthogonal view x n, where z x = sin ϕ x z = = x n z = σ x n. x ϕ x n z x Π z th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
31 Singular value decomposition Theorem: [Singular value decomposition] Any matrix A M(m, n; R) can be decomposed into a product A = U D V T with orthogonal U, V and D = diag(σ,..., σ p ) with D M(m, n; R), σ i 0, and p = min{m, n}. The positive entries in the main diagonal of D are called singular values of A. The singular values of A can be seen as principal distortion factors of the affine transformation represented by A, i.e., the semiaxes of the affine image of the unit sphere. Hence the singular values of an orthogonal projection are (, ). th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
32 Singular value decomposition Theorem: [Singular value decomposition] Any matrix A M(m, n; R) can be decomposed into a product A = U D V T with orthogonal U, V and D = diag(σ,..., σ p ) with D M(m, n; R), σ i 0, and p = min{m, n}. The positive entries in the main diagonal of D are called singular values of A. The singular values of A can be seen as principal distortion factors of the affine transformation represented by A, i.e., the semiaxes of the affine image of the unit sphere. Hence the singular values of an orthogonal projection are (, ). th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil
33 Singular value decomposition A a x A a 0 a LinAlg U D V T A α(a ) α(a 0 ) α(x) LinAlg α(a ) PSfrag replacements a 0 a a xa th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil α(a 0 ) α(a ) α(a ) α(x) A U D V T A
34 x A α(a 0 ) α(a ) α(a ) α(x) A U D V T A a 0 a a x A α(a 0 ) α(a ) α(a ) α(x) A A a Singular value decomposition x a 0 a rotation V T Lin LinAlg U D V T A D scaling th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil A α(a ) α(a 0 ) α(a 0 ) α(a α(x) ) α(a ) α(a α(x) ) A U D V T A rotation U a 0 a a xa LinAlg α(a 0 ) α(a ) α(a ) α(x) A U D V T A a 0 a a xa LinAlg α(a 0 ) α(a ) α(a ) α(x) A D scaling
35 Given: Two either calibrated A or uncalibrated images. a x aa α(a 0 x) α(aa ) α(a ) α(a α(x) ) α(a A ) U D V α(x) T Wanted: viewing situation, i.e., determine the relative position of the two camera frames, and the location of any space point from its images (, ). What means α(a 0 ) reconstruction A D a 0 scaling π a a x A α(a 0 ) α(a ) α(a ) α(x) A D scaling π π π Z π Z Z Z a 0 a Z Z π l α(a l 0 ) π th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil α(a 0 ) α(a ) α(a ) α(x) A U D V T A a 0 a a xa α(a 0 ) α(a ) α(a ) α(x) A U D V T A δ a xa z α(a ) α(a ) α(x) A D scaling
36 A α(a 0 ) α(a ) α(a ) First fundamental theorem α(x) A U D V T Theorem: A a xa From two uncalibrated images with given projectivity between epipolar lines the depicted object can be reconstructed up to a collinear transformation. α(a 0 ) Sketch of the proof: The two images can be placed in space such that pairs of epipolar lines are intersecting. Then for arbitrary Z, Z on the baseline z = ZZ there is a reconstructed D object. Any other choice of the D viewing situation gives a collinear transform of the D object. a 0 a a x A α(a 0 ) α(a ) α(a ) α(x) scaling A Z π Z Z Z a 0 Z Z π l l π th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil α(a 0 ) α(a ) α(a ) α(x) A U D V T A a 0 a α(a ) α(a ) α(x) A U D V T A δ a a xa z α(a 0 ) α(a ) α(a ) α(x) A D scaling
37 A α(a 0 ) α(a ) α(a ) Second fundamental theorem α(x) U D V T Theorem (S. Finsterwalder, A 899): a xa From two calibrated images with given projectivity between epipolar lines the depicted object can be reconstructed a 0 up to a similarity. Sketch of the proof: Now in the two bundles of rays the pencils of epipolar planes δ are congruent, and they can be made coincident by a rigid motion. Then relative to the first bundle Z for any Z z there is a reconstructed D object. Any other choice of Z gives a similar D object. A a a x A α(a 0 ) α(a ) α(a ) α(x) A D scaling Z π Z Z Z a 0 Z Z π l l π th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil α(a 0 ) α(a ) α(a ) α(x) A U D V T A a 0 a α(a 0 ) α(a ) α(a ) α(x) A U D V T A δ a a xa z α(a 0 ) α(a ) α(a ) α(x) A D scaling
38 A D scaling a Determination of epipoles geometric meaning xa Problem of Projectivity: Given: pairs of corresponding points (, ),..., (, ). Wanted: A pair of points (S, S ) (= epipoles) such that there isscaling a projectivity S ([S ],..., [S ]) S ([S ],..., [S ]). S S π th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil U D V T A a 0 a α(a 0 ) α(a ) α(a ) α(x) A D π S S π π
39 S π π Determination of epipoles geometric meaning Problem of Projectivity: Given: pairs of corresponding points (, ),..., (, ). Wanted: A pair of points (S, S π ) (= epipoles) such that there is a projectivity S S ([S ],..., [S ]) S ([S ],..., [S ]). π th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S π S S π S S π π
40 Determination of epipoles analytic solution Theorem: If pairs of corresponding points (, ),..., (, the determination of the epipoles is a cubic problem. ) are given, Proof: pairs of corresponding points give linear homogeneous equations β(x i, x i ) = xt i B x i = 0, i =,...,, for the 9 entries in the ( )-matrix B = (b ij ) called essential matrix. det(b ij ) = 0 gives an additional cubic equation which fixes all b ij up to a common factor. For noisy image points it is recommended to use more than points and methods of least square approximation for obtaining the best fitting matrix B: th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π π S S π π 8
41 Determination of epipoles analytic solution Theorem: If pairs of corresponding points (, ),..., (, the determination of the epipoles is a cubic problem. ) are given, Proof: pairs of corresponding points give linear homogeneous equations β(x i, x i ) = xt i B x i = 0, i =,...,, for the 9 entries in the ( )-matrix B = (b ij ) called essential matrix. det(b ij ) = 0 gives an additional cubic equation which fixes all b ij up to a common factor. For noisy image points it is recommended to use more than points and methods of least square approximation for obtaining the best fitting matrix B: th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π π S S π π 8
42 Determination of epipoles analytic solution ) Let A denote the coefficient matrix in the linear system for the entries of B. Then the least square fit for this overdetermined system is an eigenvector for the smallest eigenvalue of the symmetric matrix A T A. ) As an essential matrix needs to have rank, we use the projection into the essential space. This means, the singular value decomposition of B gives a representation B = U diag(σ, σ, σ ) V T with orthogonal U, V and σ σ σ. Then in the uncalibrated case B = U diag(σ, σ, 0) V to the Frobenius norm) and in the calibrated case B = U diag(σ, σ, 0) V T with σ = (σ + σ )/. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π π S S π π 9 is optimal (with respect
43 Determination of epipoles analytic solution ) Let A denote the coefficient matrix in the linear system for the entries of B. Then the least square fit for this overdetermined system is an eigenvector for the smallest eigenvalue of the symmetric matrix A T A. ) As an essential matrix needs to have rank, we use the projection into the essential space. This means, the singular value decomposition of B gives a representation B = U diag(σ, σ, σ ) V T with orthogonal U, V and σ σ σ. Then in the uncalibrated case B = U diag(σ, σ, 0) V is optimal (with respect to the Frobenius norm) and in the calibrated case B = U diag(σ, σ, 0) V T with σ = (σ + σ )/. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π π S S π π 9
44 π S S π π Step : 8. Numerical reconstruction of two images Specify at least reference points π S S π π th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π π S S π π 0
45 S S π π Step : Compute the essential matrix S S π π Step : Compute the essential matrix B including the pairs of epipolar lines th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π π S S π π
46 Step : Factorize B = S.R Theorem: There are exactly two ways of decomposing B = U D V T with D = diag(σ, σ, 0) into a product S R with skew-symmetric S and orthogonal R : Proof: S = ±U R + D U T and R = ±U R T + V T with R + = a) It is sufficient to factorize U D = S R which implies B = S (R V T ), i.e., R = R V T. b) D represents the product of the orthogonal projection into the x x -plane and the scaling with factor σ. The rotation U transforms the x x -plane into the image plane of U D. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π π A. S S π π
47 Step : Factorize B = S.R Theorem: There are exactly two ways of decomposing B = U D V T with D = diag(σ, σ, 0) into a product S R with skew-symmetric S and orthogonal R : Proof: S = ±U R + D U T and R = ±U R T + V T with R + = a) It is sufficient to factorize U D = S R which implies B = S (R V T ), i.e., R = R V T. b) D represents the product of the orthogonal projection into the x x -plane and the scaling with factor σ. The rotation U transforms the x x -plane into the image plane of U D. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π π A. S S π π
48 Step : Factorize B = S.R c) Any skew symmetric matrix S represents the product of an orthogonal projection parallel to z, a 90 -rotation about z and a scaling with factor z. d) R + D is skew-symmetric with z = (0, 0, σ). We transform it by U to obtain the required position, i.e., S = ±U (R + D) U T. R + commutes with D, = U D = [ ±U R + D U T ] [±U R T ] +. }{{}}{{} S R e) B represents an orthogonal axonometry; its column vectors are images of an orthonormal frame. We know from Descriptive Geometry that apart from translations there are not more than two different frames with given images. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π π S S π π
49 Step : Factorize B = S.R c) Any skew symmetric matrix S represents the product of an orthogonal projection parallel to z, a 90 -rotation about z and a scaling with factor z. d) R + D is skew-symmetric with z = (0, 0, σ). We transform it by U to obtain the required position, i.e., S = ±U (R + D) U T. R + commutes with D, = U D = [ ±U R + D U T ] [±U R T ] +. }{{}}{{} S R e) B represents an orthogonal axonometry; its column vectors are images of an orthonormal frame. We know from Descriptive Geometry that apart from translations there are not more than two different frames with given images. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π π S S π π
50 Summary of algorithm ) Specify n > pairs ( i, i ), i =,..., n. ) Set up linear system of equations for the essential matrix B and seek S best fitting matrix (eigenvector of the smallest eigenvalue). ) Compute the closest rank matrix B with two equal singular values. ) Factorize B = S R ; this reveals the relative position of the two camera frames. ) In one of the frames compute the approximate point of intersection between corresponding rays. ) Transform the recovered coordinates into world coordinates. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S π π S S π π
51 Analysis of precision, Remaining problems automated calibration (autofocus and zooming change the focal distance π d), critical configurations. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π S S π π
52 S S π π original image The solution 0 π π th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π π the reconstruction (M : 00) 0 S S π π
53 S S π π Z front view top view Z 8 8 Position of centers relative to the depicted object th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil Z Z S S π π S S π π
54 Literatur H. Brauner: Lineare Abbildungen aus euklidischen Räumen. Beitr. Algebra Geom., (98). O. Faugeras: Three-Dimensional Computer Vision. A Geometric Viewpoint. π MIT Press, Cambridge, Mass., 90. O. Faugeras, Q.-T. Luong: The Geometry of Multiple Images. MIT Press, Cambridge, Mass., 00. R. Harley, A. Zisserman: Multiple View Geometry in ComputerVision. Cambridge University Press 000. H. Havlicek: On the Matrices of Central Linear Mappings. Math. Bohem., (99). th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π S S π π 8
55 E. Kruppa: Zur achsonometrischen Methode der darstellenden Geometrie. Sitzungsber., Abt. II, österr. Akad. Wiss., Math.-Naturw. Kl. 9, 8 0 (90). Yi Ma, St. Soatto, J. Košecká, S. Sh. Sastry: An Invitation to -D Vision. Springer-Verlag, New York 00. H. Stachel: Zur Kennzeichnung der Zentralprojektionen nach H. Havlicek. π Sitzungsber., Abt. II, österr. Akad. Wiss., Math.-Naturw. Kl. 0, (99). J. Szabó, H. Stachel, H. Vogel: Ein Satz über die Zentralaxonometrie. Sitzungsber., Abt. II, österr. Akad. Wiss., Math.-Naturw. Kl. 0, (99). J. Tschupik, F. Hohenberg: Die geometrische Grundlagen der Photogrammetrie. In Jordan, Eggert, Kneissl (eds.): Handbuch der Vermessungskunde III a/. 0. Aufl., Metzlersche Verlagsbuchhandlung, Stuttart 9, 9. th International Conference on Geometry and Graphics, August 0, 00, Salvador/Brazil S S π S S π π 9
The Geometry Behind the Numerical Reconstruction of Two Photos
The Geometry Behind the Numerical Reconstruction of Two Photos Hellmuth Stachel stachel@dmg.tuwien.ac.at http://www.geometrie.tuwien.ac.at/stachel ICEGD 2007, The 2 nd Internat. Conf. on Eng g Graphics
More informationDESCRIPTIVE GEOMETRY MEETS COMPUTER VISION THE GEOMETRY OF MULTIPLE IMAGES
1 TH INTERNATIONAL CONFERENCE ON GEOMETRY AND GRAPHICS c 006 ISGG 6- AUGUST, 006, SALVADOR, BRAZIL DESCRIPTIVE GEOMETRY MEETS COMPUTER VISION THE GEOMETRY OF MULTIPLE IMAGES Hellmuth STACHEL Vienna University
More information55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography Estimating homography from point correspondence
More informationTwo-view geometry Computer Vision Spring 2018, Lecture 10
Two-view geometry http://www.cs.cmu.edu/~16385/ 16-385 Computer Vision Spring 2018, Lecture 10 Course announcements Homework 2 is due on February 23 rd. - Any questions about the homework? - How many of
More informationEpipolar Geometry and the Essential Matrix
Epipolar Geometry and the Essential Matrix Carlo Tomasi The epipolar geometry of a pair of cameras expresses the fundamental relationship between any two corresponding points in the two image planes, and
More informationcalibrated coordinates Linear transformation pixel coordinates
1 calibrated coordinates Linear transformation pixel coordinates 2 Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration with partial
More information3D Reconstruction with two Calibrated Cameras
3D Reconstruction with two Calibrated Cameras Carlo Tomasi The standard reference frame for a camera C is a right-handed Cartesian frame with its origin at the center of projection of C, its positive Z
More informationUnit 3 Multiple View Geometry
Unit 3 Multiple View Geometry Relations between images of a scene Recovering the cameras Recovering the scene structure http://www.robots.ox.ac.uk/~vgg/hzbook/hzbook1.html 3D structure from images Recover
More informationReminder: Lecture 20: The Eight-Point Algorithm. Essential/Fundamental Matrix. E/F Matrix Summary. Computing F. Computing F from Point Matches
Reminder: Lecture 20: The Eight-Point Algorithm F = -0.00310695-0.0025646 2.96584-0.028094-0.00771621 56.3813 13.1905-29.2007-9999.79 Readings T&V 7.3 and 7.4 Essential/Fundamental Matrix E/F Matrix Summary
More informationEpipolar geometry. x x
Two-view geometry Epipolar geometry X x x Baseline line connecting the two camera centers Epipolar Plane plane containing baseline (1D family) Epipoles = intersections of baseline with image planes = projections
More informationRobust Geometry Estimation from two Images
Robust Geometry Estimation from two Images Carsten Rother 09/12/2016 Computer Vision I: Image Formation Process Roadmap for next four lectures Computer Vision I: Image Formation Process 09/12/2016 2 Appearance-based
More informationRectification and Distortion Correction
Rectification and Distortion Correction Hagen Spies March 12, 2003 Computer Vision Laboratory Department of Electrical Engineering Linköping University, Sweden Contents Distortion Correction Rectification
More information55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography Estimating homography from point correspondence
More informationRecovering structure from a single view Pinhole perspective projection
EPIPOLAR GEOMETRY The slides are from several sources through James Hays (Brown); Silvio Savarese (U. of Michigan); Svetlana Lazebnik (U. Illinois); Bill Freeman and Antonio Torralba (MIT), including their
More informationPerception and Action using Multilinear Forms
Perception and Action using Multilinear Forms Anders Heyden, Gunnar Sparr, Kalle Åström Dept of Mathematics, Lund University Box 118, S-221 00 Lund, Sweden email: {heyden,gunnar,kalle}@maths.lth.se Abstract
More informationCamera Calibration Using Line Correspondences
Camera Calibration Using Line Correspondences Richard I. Hartley G.E. CRD, Schenectady, NY, 12301. Ph: (518)-387-7333 Fax: (518)-387-6845 Email : hartley@crd.ge.com Abstract In this paper, a method of
More informationCS231A Course Notes 4: Stereo Systems and Structure from Motion
CS231A Course Notes 4: Stereo Systems and Structure from Motion Kenji Hata and Silvio Savarese 1 Introduction In the previous notes, we covered how adding additional viewpoints of a scene can greatly enhance
More informationStructure from motion
Structure from motion Structure from motion Given a set of corresponding points in two or more images, compute the camera parameters and the 3D point coordinates?? R 1,t 1 R 2,t R 2 3,t 3 Camera 1 Camera
More informationComputer Vision I - Algorithms and Applications: Multi-View 3D reconstruction
Computer Vision I - Algorithms and Applications: Multi-View 3D reconstruction Carsten Rother 09/12/2013 Computer Vision I: Multi-View 3D reconstruction Roadmap this lecture Computer Vision I: Multi-View
More informationStructure from motion
Structure from motion Structure from motion Given a set of corresponding points in two or more images, compute the camera parameters and the 3D point coordinates?? R 1,t 1 R 2,t 2 R 3,t 3 Camera 1 Camera
More informationis used in many dierent applications. We give some examples from robotics. Firstly, a robot equipped with a camera, giving visual information about th
Geometry and Algebra of Multiple Projective Transformations Anders Heyden Dept of Mathematics, Lund University Box 8, S-22 00 Lund, SWEDEN email: heyden@maths.lth.se Supervisor: Gunnar Sparr Abstract In
More informationMulti-view geometry problems
Multi-view geometry Multi-view geometry problems Structure: Given projections o the same 3D point in two or more images, compute the 3D coordinates o that point? Camera 1 Camera 2 R 1,t 1 R 2,t 2 Camera
More informationGeometric camera models and calibration
Geometric camera models and calibration http://graphics.cs.cmu.edu/courses/15-463 15-463, 15-663, 15-862 Computational Photography Fall 2018, Lecture 13 Course announcements Homework 3 is out. - Due October
More informationStructure from Motion and Multi- view Geometry. Last lecture
Structure from Motion and Multi- view Geometry Topics in Image-Based Modeling and Rendering CSE291 J00 Lecture 5 Last lecture S. J. Gortler, R. Grzeszczuk, R. Szeliski,M. F. Cohen The Lumigraph, SIGGRAPH,
More informationA Minimal Solution for Relative Pose with Unknown Focal Length
A Minimal Solution for Relative Pose with Unknown Focal Length Henrik Stewénius Lund University Sweden stewe@maths.lth.se David Nistér University of Kentucky Lexington, USA dnister@cs.uky.edu Fredrik Kahl
More informationEuclidean Reconstruction from Constant Intrinsic Parameters
uclidean Reconstruction from Constant ntrinsic Parameters nders Heyden, Kalle Åström Dept of Mathematics, Lund University Box 118, S-221 00 Lund, Sweden email: heyden@maths.lth.se, kalle@maths.lth.se bstract
More informationCS201 Computer Vision Camera Geometry
CS201 Computer Vision Camera Geometry John Magee 25 November, 2014 Slides Courtesy of: Diane H. Theriault (deht@bu.edu) Question of the Day: How can we represent the relationships between cameras and the
More informationCamera Geometry II. COS 429 Princeton University
Camera Geometry II COS 429 Princeton University Outline Projective geometry Vanishing points Application: camera calibration Application: single-view metrology Epipolar geometry Application: stereo correspondence
More informationMathematics of a Multiple Omni-Directional System
Mathematics of a Multiple Omni-Directional System A. Torii A. Sugimoto A. Imiya, School of Science and National Institute of Institute of Media and Technology, Informatics, Information Technology, Chiba
More informationThe end of affine cameras
The end of affine cameras Affine SFM revisited Epipolar geometry Two-view structure from motion Multi-view structure from motion Planches : http://www.di.ens.fr/~ponce/geomvis/lect3.pptx http://www.di.ens.fr/~ponce/geomvis/lect3.pdf
More information1 Projective Geometry
CIS8, Machine Perception Review Problem - SPRING 26 Instructions. All coordinate systems are right handed. Projective Geometry Figure : Facade rectification. I took an image of a rectangular object, and
More informationWeek 2: Two-View Geometry. Padua Summer 08 Frank Dellaert
Week 2: Two-View Geometry Padua Summer 08 Frank Dellaert Mosaicking Outline 2D Transformation Hierarchy RANSAC Triangulation of 3D Points Cameras Triangulation via SVD Automatic Correspondence Essential
More informationA Factorization Method for Structure from Planar Motion
A Factorization Method for Structure from Planar Motion Jian Li and Rama Chellappa Center for Automation Research (CfAR) and Department of Electrical and Computer Engineering University of Maryland, College
More informationStructure from motion
Multi-view geometry Structure rom motion Camera 1 Camera 2 R 1,t 1 R 2,t 2 Camera 3 R 3,t 3 Figure credit: Noah Snavely Structure rom motion? Camera 1 Camera 2 R 1,t 1 R 2,t 2 Camera 3 R 3,t 3 Structure:
More informationVisual Recognition: Image Formation
Visual Recognition: Image Formation Raquel Urtasun TTI Chicago Jan 5, 2012 Raquel Urtasun (TTI-C) Visual Recognition Jan 5, 2012 1 / 61 Today s lecture... Fundamentals of image formation You should know
More informationComputer Vision. Coordinates. Prof. Flávio Cardeal DECOM / CEFET- MG.
Computer Vision Coordinates Prof. Flávio Cardeal DECOM / CEFET- MG cardeal@decom.cefetmg.br Abstract This lecture discusses world coordinates and homogeneous coordinates, as well as provides an overview
More information3D Geometry and Camera Calibration
3D Geometry and Camera Calibration 3D Coordinate Systems Right-handed vs. left-handed x x y z z y 2D Coordinate Systems 3D Geometry Basics y axis up vs. y axis down Origin at center vs. corner Will often
More informationLecture 3: Camera Calibration, DLT, SVD
Computer Vision Lecture 3 23--28 Lecture 3: Camera Calibration, DL, SVD he Inner Parameters In this section we will introduce the inner parameters of the cameras Recall from the camera equations λx = P
More informationStereo and Epipolar geometry
Previously Image Primitives (feature points, lines, contours) Today: Stereo and Epipolar geometry How to match primitives between two (multiple) views) Goals: 3D reconstruction, recognition Jana Kosecka
More informationStereo Vision. MAN-522 Computer Vision
Stereo Vision MAN-522 Computer Vision What is the goal of stereo vision? The recovery of the 3D structure of a scene using two or more images of the 3D scene, each acquired from a different viewpoint in
More informationAnnouncements. Stereo
Announcements Stereo Homework 2 is due today, 11:59 PM Homework 3 will be assigned today Reading: Chapter 7: Stereopsis CSE 152 Lecture 8 Binocular Stereopsis: Mars Given two images of a scene where relative
More informationTwo-View Geometry (Course 23, Lecture D)
Two-View Geometry (Course 23, Lecture D) Jana Kosecka Department of Computer Science George Mason University http://www.cs.gmu.edu/~kosecka General Formulation Given two views of the scene recover the
More informationComputer Vision: Lecture 3
Computer Vision: Lecture 3 Carl Olsson 2019-01-29 Carl Olsson Computer Vision: Lecture 3 2019-01-29 1 / 28 Todays Lecture Camera Calibration The inner parameters - K. Projective vs. Euclidean Reconstruction.
More informationAuto-calibration Kruppa's equations and the intrinsic parameters of a camera
Auto-calibration Kruppa's equations and the intrinsic parameters of a camera S.D. Hippisley-Cox & J. Porrill AI Vision Research Unit University of Sheffield e-mail: [S.D.Hippisley-Cox,J.Porrill]@aivru.sheffield.ac.uk
More informationCS231M Mobile Computer Vision Structure from motion
CS231M Mobile Computer Vision Structure from motion - Cameras - Epipolar geometry - Structure from motion Pinhole camera Pinhole perspective projection f o f = focal length o = center of the camera z y
More informationMulti-View Geometry Part II (Ch7 New book. Ch 10/11 old book)
Multi-View Geometry Part II (Ch7 New book. Ch 10/11 old book) Guido Gerig CS-GY 6643, Spring 2016 gerig@nyu.edu Credits: M. Shah, UCF CAP5415, lecture 23 http://www.cs.ucf.edu/courses/cap6411/cap5415/,
More informationEpipolar Geometry Prof. D. Stricker. With slides from A. Zisserman, S. Lazebnik, Seitz
Epipolar Geometry Prof. D. Stricker With slides from A. Zisserman, S. Lazebnik, Seitz 1 Outline 1. Short introduction: points and lines 2. Two views geometry: Epipolar geometry Relation point/line in two
More informationCS 664 Slides #9 Multi-Camera Geometry. Prof. Dan Huttenlocher Fall 2003
CS 664 Slides #9 Multi-Camera Geometry Prof. Dan Huttenlocher Fall 2003 Pinhole Camera Geometric model of camera projection Image plane I, which rays intersect Camera center C, through which all rays pass
More informationMachine vision. Summary # 11: Stereo vision and epipolar geometry. u l = λx. v l = λy
1 Machine vision Summary # 11: Stereo vision and epipolar geometry STEREO VISION The goal of stereo vision is to use two cameras to capture 3D scenes. There are two important problems in stereo vision:
More informationMultiple View Geometry
Multiple View Geometry CS 6320, Spring 2013 Guest Lecture Marcel Prastawa adapted from Pollefeys, Shah, and Zisserman Single view computer vision Projective actions of cameras Camera callibration Photometric
More informationLecture 9: Epipolar Geometry
Lecture 9: Epipolar Geometry Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Why is stereo useful? Epipolar constraints Essential and fundamental matrix Estimating F (Problem Set 2
More informationElements of Computer Vision: Multiple View Geometry. 1 Introduction. 2 Elements of Geometry. Andrea Fusiello
Elements of Computer Vision: Multiple View Geometry. Andrea Fusiello http://www.sci.univr.it/~fusiello July 11, 2005 c Copyright by Andrea Fusiello. This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike
More informationC / 35. C18 Computer Vision. David Murray. dwm/courses/4cv.
C18 2015 1 / 35 C18 Computer Vision David Murray david.murray@eng.ox.ac.uk www.robots.ox.ac.uk/ dwm/courses/4cv Michaelmas 2015 C18 2015 2 / 35 Computer Vision: This time... 1. Introduction; imaging geometry;
More informationMultiple View Geometry in Computer Vision Second Edition
Multiple View Geometry in Computer Vision Second Edition Richard Hartley Australian National University, Canberra, Australia Andrew Zisserman University of Oxford, UK CAMBRIDGE UNIVERSITY PRESS Contents
More informationStructure from Motion
Structure from Motion Outline Bundle Adjustment Ambguities in Reconstruction Affine Factorization Extensions Structure from motion Recover both 3D scene geoemetry and camera positions SLAM: Simultaneous
More informationAnnouncements. Stereo
Announcements Stereo Homework 1 is due today, 11:59 PM Homework 2 will be assigned on Thursday Reading: Chapter 7: Stereopsis CSE 252A Lecture 8 Binocular Stereopsis: Mars Given two images of a scene where
More informationMAPI Computer Vision. Multiple View Geometry
MAPI Computer Vision Multiple View Geometry Geometry o Multiple Views 2- and 3- view geometry p p Kpˆ [ K R t]p Geometry o Multiple Views 2- and 3- view geometry Epipolar Geometry The epipolar geometry
More informationSolutions to Minimal Generalized Relative Pose Problems
Solutions to Minimal Generalized Relative Pose Problems Henrik Stewénius, Magnus Oskarsson, Kalle Åström David Nistér Centre for Mathematical Sciences Department of Computer Science Lund University, P.O.
More informationHumanoid Robotics. Projective Geometry, Homogeneous Coordinates. (brief introduction) Maren Bennewitz
Humanoid Robotics Projective Geometry, Homogeneous Coordinates (brief introduction) Maren Bennewitz Motivation Cameras generate a projected image of the 3D world In Euclidian geometry, the math for describing
More informationA General Expression of the Fundamental Matrix for Both Perspective and Affine Cameras
A General Expression of the Fundamental Matrix for Both Perspective and Affine Cameras Zhengyou Zhang* ATR Human Information Processing Res. Lab. 2-2 Hikari-dai, Seika-cho, Soraku-gun Kyoto 619-02 Japan
More informationStructure and motion in 3D and 2D from hybrid matching constraints
Structure and motion in 3D and 2D from hybrid matching constraints Anders Heyden, Fredrik Nyberg and Ola Dahl Applied Mathematics Group Malmo University, Sweden {heyden,fredrik.nyberg,ola.dahl}@ts.mah.se
More informationRigid Multiview Varieties
Joe Kileel University of California, Berkeley January 9, 2016 Nonlinear Algebra JMM, Seattle Joe Kileel Preprint arxiv:1509.03257 Michael Joswig Bernd Sturmfels André Wagner Algebraic vision Multiview
More informationStereo CSE 576. Ali Farhadi. Several slides from Larry Zitnick and Steve Seitz
Stereo CSE 576 Ali Farhadi Several slides from Larry Zitnick and Steve Seitz Why do we perceive depth? What do humans use as depth cues? Motion Convergence When watching an object close to us, our eyes
More informationA linear algorithm for Camera Self-Calibration, Motion and Structure Recovery for Multi-Planar Scenes from Two Perspective Images
A linear algorithm for Camera Self-Calibration, Motion and Structure Recovery for Multi-Planar Scenes from Two Perspective Images Gang Xu, Jun-ichi Terai and Heung-Yeung Shum Microsoft Research China 49
More informationHomogeneous Coordinates. Lecture18: Camera Models. Representation of Line and Point in 2D. Cross Product. Overall scaling is NOT important.
Homogeneous Coordinates Overall scaling is NOT important. CSED44:Introduction to Computer Vision (207F) Lecture8: Camera Models Bohyung Han CSE, POSTECH bhhan@postech.ac.kr (",, ) ()", ), )) ) 0 It is
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Structure Computation Lecture 18 March 22, 2005 2 3D Reconstruction The goal of 3D reconstruction
More informationStructure from Motion. Introduction to Computer Vision CSE 152 Lecture 10
Structure from Motion CSE 152 Lecture 10 Announcements Homework 3 is due May 9, 11:59 PM Reading: Chapter 8: Structure from Motion Optional: Multiple View Geometry in Computer Vision, 2nd edition, Hartley
More informationCSE 252B: Computer Vision II
CSE 252B: Computer Vision II Lecturer: Serge Belongie Scribe: Haowei Liu LECTURE 16 Structure from Motion from Tracked Points 16.1. Introduction In the last lecture we learned how to track point features
More informationA Canonical Framework for Sequences of Images
A Canonical Framework for Sequences of Images Anders Heyden, Kalle Åström Dept of Mathematics, Lund University Box 118, S-221 00 Lund, Sweden email: andersp@maths.lth.se kalle@maths.lth.se Abstract This
More information3D Modeling using multiple images Exam January 2008
3D Modeling using multiple images Exam January 2008 All documents are allowed. Answers should be justified. The different sections below are independant. 1 3D Reconstruction A Robust Approche Consider
More informationCamera Calibration. Schedule. Jesus J Caban. Note: You have until next Monday to let me know. ! Today:! Camera calibration
Camera Calibration Jesus J Caban Schedule! Today:! Camera calibration! Wednesday:! Lecture: Motion & Optical Flow! Monday:! Lecture: Medical Imaging! Final presentations:! Nov 29 th : W. Griffin! Dec 1
More informationLinear Multi View Reconstruction and Camera Recovery Using a Reference Plane
International Journal of Computer Vision 49(2/3), 117 141, 2002 c 2002 Kluwer Academic Publishers. Manufactured in The Netherlands. Linear Multi View Reconstruction and Camera Recovery Using a Reference
More informationMultiple Views Geometry
Multiple Views Geometry Subhashis Banerjee Dept. Computer Science and Engineering IIT Delhi email: suban@cse.iitd.ac.in January 2, 28 Epipolar geometry Fundamental geometric relationship between two perspective
More informationCS6670: Computer Vision
CS6670: Computer Vision Noah Snavely Lecture 7: Image Alignment and Panoramas What s inside your fridge? http://www.cs.washington.edu/education/courses/cse590ss/01wi/ Projection matrix intrinsics projection
More informationComputer Vision. Geometric Camera Calibration. Samer M Abdallah, PhD
Computer Vision Samer M Abdallah, PhD Faculty of Engineering and Architecture American University of Beirut Beirut, Lebanon Geometric Camera Calibration September 2, 2004 1 Computer Vision Geometric Camera
More informationComputing Matched-epipolar Projections
Computing Matched-epipolar Projections Richard I. Hartley G.E. CRD, Schenectady, NY, 12301. Ph: (518)-387-7333 Fax: (518)-387-6845 Email : hartley@crd.ge.com Abstract This paper gives a new method for
More informationCamera Registration in a 3D City Model. Min Ding CS294-6 Final Presentation Dec 13, 2006
Camera Registration in a 3D City Model Min Ding CS294-6 Final Presentation Dec 13, 2006 Goal: Reconstruct 3D city model usable for virtual walk- and fly-throughs Virtual reality Urban planning Simulation
More informationCamera models and calibration
Camera models and calibration Read tutorial chapter 2 and 3. http://www.cs.unc.edu/~marc/tutorial/ Szeliski s book pp.29-73 Schedule (tentative) 2 # date topic Sep.8 Introduction and geometry 2 Sep.25
More informationCamera model and multiple view geometry
Chapter Camera model and multiple view geometry Before discussing how D information can be obtained from images it is important to know how images are formed First the camera model is introduced and then
More informationBIL Computer Vision Apr 16, 2014
BIL 719 - Computer Vision Apr 16, 2014 Binocular Stereo (cont d.), Structure from Motion Aykut Erdem Dept. of Computer Engineering Hacettepe University Slide credit: S. Lazebnik Basic stereo matching algorithm
More informationStereo II CSE 576. Ali Farhadi. Several slides from Larry Zitnick and Steve Seitz
Stereo II CSE 576 Ali Farhadi Several slides from Larry Zitnick and Steve Seitz Camera parameters A camera is described by several parameters Translation T of the optical center from the origin of world
More informationElements of Geometric Computer Vision. Andrea Fusiello
Elements of Geometric Computer Vision Andrea Fusiello http://www.diegm.uniud.it/fusiello/ May 2, 2014 c E. Trucco c Copyright by Andrea Fusiello. This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike
More informationAn Alternative Formulation for Five Point Relative Pose Problem
An Alternative Formulation for Five Point Relative Pose Problem Dhruv Batra 1 Bart Nabbe 1,2 Martial Hebert 1 dbatra@ece.cmu.edu bart.c.nabbe@intel.com hebert@ri.cmu.edu 1 Carnegie Mellon University 2
More informationCSE 252B: Computer Vision II
CSE 252B: Computer Vision II Lecturer: Serge Belongie Scribe: Sameer Agarwal LECTURE 1 Image Formation 1.1. The geometry of image formation We begin by considering the process of image formation when a
More informationComputing Matched-epipolar Projections
Computing Matched-epipolar Projections Richard Hartley and Rajiv Gupta GE - Corporate Research and Development, P.O. Box 8, Schenectady, NY, 12301. Ph : (518)-387-7333 Fax : (518)-387-6845 email : hartley@crd.ge.com
More informationAgenda. Rotations. Camera models. Camera calibration. Homographies
Agenda Rotations Camera models Camera calibration Homographies D Rotations R Y = Z r r r r r r r r r Y Z Think of as change of basis where ri = r(i,:) are orthonormal basis vectors r rotated coordinate
More informationEuclidean Reconstruction Independent on Camera Intrinsic Parameters
Euclidean Reconstruction Independent on Camera Intrinsic Parameters Ezio MALIS I.N.R.I.A. Sophia-Antipolis, FRANCE Adrien BARTOLI INRIA Rhone-Alpes, FRANCE Abstract bundle adjustment techniques for Euclidean
More informationCamera Calibration from the Quasi-affine Invariance of Two Parallel Circles
Camera Calibration from the Quasi-affine Invariance of Two Parallel Circles Yihong Wu, Haijiang Zhu, Zhanyi Hu, and Fuchao Wu National Laboratory of Pattern Recognition, Institute of Automation, Chinese
More informationComputer Vision. 2. Projective Geometry in 3D. Lars Schmidt-Thieme
Computer Vision 2. Projective Geometry in 3D Lars Schmidt-Thieme Information Systems and Machine Learning Lab (ISMLL) Institute for Computer Science University of Hildesheim, Germany 1 / 26 Syllabus Mon.
More informationComputer Vision I. Announcement. Stereo Vision Outline. Stereo II. CSE252A Lecture 15
Announcement Stereo II CSE252A Lecture 15 HW3 assigned No class on Thursday 12/6 Extra class on Tuesday 12/4 at 6:30PM in WLH Room 2112 Mars Exploratory Rovers: Spirit and Opportunity Stereo Vision Outline
More information3D reconstruction class 11
3D reconstruction class 11 Multiple View Geometry Comp 290-089 Marc Pollefeys Multiple View Geometry course schedule (subject to change) Jan. 7, 9 Intro & motivation Projective 2D Geometry Jan. 14, 16
More informationPart I: Single and Two View Geometry Internal camera parameters
!! 43 1!???? Imaging eometry Multiple View eometry Perspective projection Richard Hartley Andrew isserman O p y VPR June 1999 where image plane This can be written as a linear mapping between homogeneous
More information3-D D Euclidean Space - Vectors
3-D D Euclidean Space - Vectors Rigid Body Motion and Image Formation A free vector is defined by a pair of points : Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Coordinates of the vector : 3D Rotation
More information3D Geometry and Camera Calibration
3D Geometr and Camera Calibration 3D Coordinate Sstems Right-handed vs. left-handed 2D Coordinate Sstems ais up vs. ais down Origin at center vs. corner Will often write (u, v) for image coordinates v
More informationExponential Maps for Computer Vision
Exponential Maps for Computer Vision Nick Birnie School of Informatics University of Edinburgh 1 Introduction In computer vision, the exponential map is the natural generalisation of the ordinary exponential
More informationStructure from Motion CSC 767
Structure from Motion CSC 767 Structure from motion Given a set of corresponding points in two or more images, compute the camera parameters and the 3D point coordinates?? R,t R 2,t 2 R 3,t 3 Camera??
More information3D Reconstruction from Two Views
3D Reconstruction from Two Views Huy Bui UIUC huybui1@illinois.edu Yiyi Huang UIUC huang85@illinois.edu Abstract In this project, we study a method to reconstruct a 3D scene from two views. First, we extract
More informationA Way to Geometry Through Descriptive Geometry
H. Stachel, Professor A Way to Geometry Through Descriptive Geometry Vienna University of Technology, Vienna, Austria Summary. This is a short survey on my scientific achievements in the field of geometry
More informationCOMPARATIVE STUDY OF DIFFERENT APPROACHES FOR EFFICIENT RECTIFICATION UNDER GENERAL MOTION
COMPARATIVE STUDY OF DIFFERENT APPROACHES FOR EFFICIENT RECTIFICATION UNDER GENERAL MOTION Mr.V.SRINIVASA RAO 1 Prof.A.SATYA KALYAN 2 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING PRASAD V POTLURI SIDDHARTHA
More informationComputer Vision I - Robust Geometry Estimation from two Cameras
Computer Vision I - Robust Geometry Estimation from two Cameras Carsten Rother 16/01/2015 Computer Vision I: Image Formation Process FYI Computer Vision I: Image Formation Process 16/01/2015 2 Microsoft
More information