Computer Vision I - Algorithms and Applications: Multi-View 3D reconstruction
|
|
- Elaine Rice
- 5 years ago
- Views:
Transcription
1 Computer Vision I - Algorithms and Applications: Multi-View 3D reconstruction Carsten Rother 09/12/2013 Computer Vision I: Multi-View 3D reconstruction
2 Roadmap this lecture Computer Vision I: Multi-View 3D reconstruction 09/12/ Two-view reconstruction From projective to metric space (e.g. self-calibration) Multi-view reconstruction Iterative projective cameras Closed form: affine cameras Closed form: reference plane Next lecture: dense labeling problems in computer vision: stereo matching ICP, KinectFusion
3 3D reconstruction - Definitions Computer Vision I: Multi-View 3D reconstruction 09/12/ Sparse Structure from Motion (SfM) SLAM in robotics: Simultaneous Localization and Mapping: Place a robot in an unknown location and in an unknown environment and have the robot incrementally build a map of this environment while simultaneously using this map to compute its location Dense Multi-view reconstruction
4 Roadmap this lecture Computer Vision I: Multi-View 3D reconstruction 09/12/ Two-view reconstruction From projective to metric space (e.g. self-calibration) Multi-view reconstruction Iterative projective cameras Closed form: affine cameras Closed form: reference plane Next lecture: dense labeling problems in computer vision: stereo matching ICP, KinectFusion
5 First: Two-View reconstruction Computer Vision I: Multi-View 3D reconstruction 09/12/2013 5
6 Epipolar Geometry (Reminder) Computer Vision I: Robust Two-View Geometry 09/12/ Fundamental matrix F: p 2 T Fp 1 = 0
7 2-view reconstruction Computer Vision I: Multi-View 3D reconstruction 09/12/ We have x T Fx = 0 Can we get P, P such that: x = PX ; x = P X and x T Fx = 0 for all 3D points X Derivation (blackboard) see HZ page 256 P = I ]; P = e F e ]
8 Derivation Computer Vision I: Multi-View 3D reconstruction 09/12/ T
9 Derivation Computer Vision I: Multi-View 3D reconstruction 09/12/2013 9
10 Triangulation - algebraic Computer Vision I: Multi-View 3D reconstruction 09/12/ Input: x, x, P, P Output: X s Triangulation is also called intersection Simple algebraic solution: 1) λx = P X and λ x = P X 2) Eliminate λ, λ by taking ratios. This gives 4 linear independent equations for 3 unknowns: X = (X 1, X 2, X 3, X 4 ) where X = 1. An example ratio is: x 1 x 2 = p 1 X 1 +p 2 X 2 +p 3 X 3 +p 4 X 4 p 5 X 1 +p 6 X 2 +p 7 X 3 +p 8 X 4 3) This gives (as usual) a least square optimization problem: A X = 0 with X = 1 where A is of size 4 4. This can be solved in closed-form using SVD.
11 Triangulation - geometric Computer Vision I: Multi-View 3D reconstruction 09/12/ Minize re-projection error with Fixed fundamental matrix. ^ ^ ^ ^ ^ ^ x, x = argmin d x, x 2 + d x, x 2 subject to x Fx = 0 x, ^ x ^
12 Triangulation - geometric Computer Vision I: Multi-View 3D reconstruction 09/12/ Minimize re-projection error with fixed fundamental matrix. ^ ^ ^ ^ ^ ^ x, x = argmin d x, x 2 + d x, x 2 subject to x Fx = 0 x, ^ x ^ Solution can be expressed as a 6-degree polynomial in t This has up to 6 solutions and can computed (roots of polynomial)
13 Triangulation - uncertainty Computer Vision I: Multi-View 3D reconstruction 09/12/ Large baseline Smaller area smaller baseline Larger area Very small baseline Very larger area
14 Roadmap this lecture Computer Vision I: Multi-View 3D reconstruction 09/12/ Two-view reconstruction From projective to metric space (e.g. self-calibration) Multi-view reconstruction Iterative projective cameras Closed form: affine cameras Closed form: reference plane Next lecture: dense labeling problems in computer vision: stereo matching ICP, KinectFusion
15 3D reconstruction Computer Vision I: Multi-View 3D reconstruction 09/12/ Given: m cameras and n static 3D points Formally: x ij = P j X i for j = 1 m; i = 1 n Important in practice we do not have all points visible in all views, i.e. Number x ij mn Goal: find all P j s and X i s Example: Visibility matrix
16 Iterative multi-view reconstruction Method 1 Computer Vision I: Multi-View 3D reconstruction 09/12/ Three views of an un-calibrated or calibrated camera
17 Iterative multi-view reconstruction Method 1 Computer Vision I: Multi-View 3D reconstruction 09/12/ Three views of an un-calibrated or calibrated camera Similiar problem as intersection (and same as camera calibration): λx = P X and λ x = PX with 6 points you get 12 constraints and we have 11 unknowns.
18 Iterative multi-view reconstruction Method 1 Computer Vision I: Multi-View 3D reconstruction 09/12/ Three views of an un-calibrated or calibrated camera Similiar problem as intersection (and same as camera calibration): λx = P X and λ x = PX with 6 points you get 12 constraints and we have 11 unknowns. You can iterate between: intersection and re-sectioning to get all points and cameras reconstructed (in projective or metric space)
19 Iterative multi-view reconstruction Method 2 Computer Vision I: Multi-View 3D reconstruction 09/12/ Three views of an un-calibrated or calibrated camera Reconstruct Points and Camera 1 and 2
20 Iterative multi-view reconstruction Method 2 Computer Vision I: Multi-View 3D reconstruction 09/12/ Three views of an un-calibrated or calibrated camera Zipp the 2 reconstructions together. 1. They share a camera and 7+ points (needed for F-matrix). 2. Get H 4 4 from X 1 7 = HX 1 7 (here points X 1 7 are in second reconstruction and X 1 7 in first reconstruction) Reconstruct Points and Camera 2 and 3 3. Zipp them together: P 3 = P 3 H 1 ; X i = HX i (Here P 3 is camera in second reconstruction) Note:
21 The full pipeline Computer Vision I: Multi-View 3D reconstruction 09/12/ Comment: Between 3 and 4 views there exists Trifocal and Quadrifocal tensor (as Fundamental matrix for 2 views) not discussed in this lecture [See page 453 HZ]
22 Bundle adjustment Computer Vision I: Multi-View 3D reconstruction 09/12/ Global refinement of jointly structure (points) and cameras Minimize geometric error: argmin {P s,x s} α ij d(p j X i, x ij ) j i here α ij is 1 if X j visible in view P j (otherwise 0) Non-linear optimization with e.g. Levenberg-Marquard
23 Example Computer Vision I: Multi-View 3D reconstruction 09/12/
24 Main Problem of iterative methods is Drift Computer Vision I: Multi-View 3D reconstruction 09/12/ Solution: 1) look for Loop closure if possible 2) global methods (next)
25 Roadmap this lecture Computer Vision I: Multi-View 3D reconstruction 09/12/ Two-view reconstruction From projective to metric space (e.g. self-calibration) Multi-view reconstruction Iterative projective cameras Closed form: affine cameras Closed form: reference plane Next lecture: dense labeling problems in computer vision: stereo matching ICP, KinectFusion
26 Reminder: affine cameras (from lecture 4) Computer Vision I: Multi-View 3D reconstruction 09/12/ Affine camera has 8 DoF: x y 1 = a b c d e f g h X Y Z 1 In short: x = MX + t ~ ~
27 Reminder: affine cameras (from lecture 4) Computer Vision I: Multi-View 3D reconstruction 09/12/ (normal focal length) Parallel 3D lines map to parallel 2D lines (since points stay at infinity) (very large focal length) Close to parallel projection
28 Multi-View Reconstruction for affine cameras Computer Vision I: Multi-View 3D reconstruction 09/12/ (derivation on blackboard)
29 Multi-View Reconstruction for affine cameras Computer Vision I: Multi-View 3D reconstruction 09/12/ (derivation on blackboard) W MX = 0 W = MX
30 Comments / Extensions Computer Vision I: Multi-View 3D reconstruction 09/12/ Main restriction is that all points have to be visible in all views. (can be used for a subset of views and then zipping subviews together) Extensions to missing data have been done (see HZ chapter 18) Extensions to projective cameras have been done (ch. 18.4) Extensions to non-rigidly moving scenes (ch. 18.3)
31 Roadmap this lecture Computer Vision I: Multi-View 3D reconstruction 09/12/ Two-view reconstruction From projective to metric space (e.g. self-calibration) Multi-view reconstruction Iterative projective cameras Closed form: affine cameras Closed form: reference plane Next lecture: dense labeling problems in computer vision: stereo matching ICP, KinectFusion
32 Direct reference plane approach (DRP) Computer Vision I: Multi-View 3D reconstruction 09/12/ H = KR is called infinity homography since it is the mapping from plane at infinity to image: x y x x x = KR (I C) ~ z =KR y z = H y z 0 Idea: simply define an arbitrary plane as π = 0,0,0,1 T (this can be done in projective space) [Rother PhD Thesis 2003]
33 Direct reference plane approach (DRP) Computer Vision I: Multi-View 3D reconstruction 09/12/ Derivation on blackboard [Rother PhD Thesis 2003]
34 Result Computer Vision I: Multi-View 3D reconstruction 09/12/
35 How to get infinite Homographies Computer Vision I: Multi-View 3D reconstruction 09/12/ Real Plane in the scene: Fixed / known K and R, e.g. translating camera with fixed camera intrinsics Orthogonal scene directions and a square pixel camera see above we get out: K, R (up to a small ambiguity)
36 Result: University Stockholm Computer Vision I: Multi-View 3D reconstruction 09/12/ (Show video)
37 Half-way slide Computer Vision I: Multi-View 3D reconstruction 09/12/ Minutes break
38 Roadmap this lecture Computer Vision I: Multi-View 3D reconstruction 09/12/ Two-view reconstruction From projective to metric space (e.g. self-calibration) Multi-view reconstruction Iterative projective cameras Closed form: affine cameras Closed form: reference plane Next lecture: dense labeling problems in computer vision: stereo matching ICP, KinectFusion
39 Scale ambiguity Computer Vision I: Multi-View 3D reconstruction 09/12/ Is the pumpkin 5 meters or 30 cm high?
40 Scale ambiguity Computer Vision I: Multi-View 3D reconstruction 09/12/
41 Structure from Motion Ambiguity Computer Vision I: Multi-View 3D reconstruction 09/12/ We can always write: x = P k k X = 1 k P (kx) It is impossible to recover the absolute scale of the scene!
42 Projective ambiguity Computer Vision I: Multi-View 3D reconstruction 09/12/ We can write (most general): x ij = P j X i = P j Q 1 QX i = P j X i Q has 15 DoF (projective ambiguity) If we do not have any additional information about the cameras or points then we cannot recover Q. Possible information (we will see details later) known calibration matrix calibration matrix is same for all cameras external constraints: given 3D points
43 Projective ambiguity Computer Vision I: Multi-View 3D reconstruction 09/12/ D points map to image points This is a protectively correct reconstruction but not a nice looking one
44 Affine ambiguity Computer Vision I: Multi-View 3D reconstruction 09/12/ We can write (most general): x ij = P j X i = P j Q 1 QX i = P j X i Q has now 12 DoF (affine ambiguity) With affine cameras we get only affine ambiguity Q leaves the plane at infinity π = 0,0,0,1 T in place: any point on π moves like: Q a, b, c, 0 T = a, b, c, 0 Therefore parallel 3D lines stay parallel for any Q
45 From Projective to Affine Computer Vision I: Multi-View 3D reconstruction 09/12/ X 3 X 2 The red directions point to places where the projection of a vanishing point lies. X 1 Step: Take points X 1 3 = x 1 3, y 1 3, z 1 3, 1 T and move to a point at infinity: x 1 3, y 1 3, z 1 3, 0 T. Same as having plane at infinity in its canonical position π = 0,0,0,1 T
46 Affine ambiguity Computer Vision I: Multi-View 3D reconstruction 09/12/ D Points at infinity stay at infinity
47 Similarity Ambiguity (Metric space) Computer Vision I: Multi-View 3D reconstruction 09/12/ We can write (most general): x ij = P j X i = P j Q 1 QX i = P j X i Q has now 7 DoF (similarity ambiguity) Q preserves angles, ratios of lengths, etc. For visualization purpose this ambiguity is sufficient. We don t need to know what 1m, 1cm, 1mm, etc. means Note, if we don t care about the choice of Q we can set for instance the camera center of first camera to 0.
48 From Projective/Affine to Metric Computer Vision I: Multi-View 3D reconstruction 09/12/ Essentially, we need the true camera calibration matrices K (see details later) Known K Steps: (see HZ page 277) One option: with known K operate with essential matrix and get out R,C ~ of all cameras
49 Similarity Ambiguity Computer Vision I: Multi-View 3D reconstruction 09/12/
50 How to upgrade a reconstruction Computer Vision I: Multi-View 3D reconstruction 09/12/ Illustrating some ways to upgrade from Projective to Affine and Metric (see details in HZ page 270ff and chapter 19) Camera is calibrated Calibration from external constraints Calibration from a mix of in- and external constraints x ij = P j X i = P j Q 1 QX i = P j X i Find plane at infinity and move in canonical position: One of the cameras is affine see HZ page 271) 3 non-collinear 3D vanishing points Calibration from internal constraints, called self/auto calibration Translational motion (HZ page 268)
51 Projective to Affine Three 3D vanishing points Computer Vision I: Multi-View 3D reconstruction 09/12/ Goal: Find plane at infinity and move to π = 0,0,0,1 T Possible method 1. Identify three pairs of lines in the 3D reconstruction that have to be parallel, respectively. 2. Compute the three 3D intersection points X Move X 1 3 somewhere on the plane at infinity π = 0,0,0,1 T. Define the equation: X 1 3 = Q X 1 3 where X 1 3 = 1,0,0,0 T, 0,1,0,0 T, 0,0,1,0 T The red directions point to places where the projection of a vanishing point lies. 4. Compute an Q using SVD 5. Update all points and cameras P j = Q 1 P j ; X i = QX i
52 Projective to Metric Direct Method Computer Vision I: Multi-View 3D reconstruction 09/12/ Given: five known 3D points Compute Q: 1) QX i = X i (each 3D point gives 3 linear independent equations) 2) 5 points give 15 equations, enough to compute Q using SVD Upgrade cameras and points: P j = P j Q 1 and X i = QX i
53 But without external knowledge? Computer Vision I: Multi-View 3D reconstruction 09/12/ For a camera P = K [I 0] the ray outwards is: x = P X hence X = K 1 x The angle Θ is computed as the normalized rays d 1, d 2 : cos Θ = d 1 T d 2 d 1 T d 1 d 2 T d 2 = K 1 x 1 T K 1 x 2 K 1 x 1 T K 1 x 1 K 1 x 2 T K 1 x 2 = x 1 T ω x 2 x 1 T ωx 1 x 2 T ωx 2 We define the matrix: ω = K T K 1 Comment: (K 1 ) T = (K T ) 1 =: K T
54 But without external knowledge? Computer Vision I: Multi-View 3D reconstruction 09/12/ We have: cos Θ = x 1 T ω x 2 x 1 T ωx 1 x 2 T ωx 2 If we were to know ω then we can compute angle Θ K can be derived from ω = K T K 1 using Cholesky decomposition (see HZ page 582) Comment, if Θ = 90 o then we have x 1 T ω x 2 = 0 How do we get ω?
55 ω is the Image of the absolute Conic (IAC) Computer Vision I: Multi-View 3D reconstruction 09/12/ ω is called the image of the absolute conic Ω = I 3 3 on the plane at infinity π = 0,0,0,1 T Remember a conic C is defined as: x T C x = 0. Here it is: x, y, 1 Ω x, y, 1 T = 0 That is: x 2 + y 2 = 1 an imaginary circle with radius i the points (i, 0) and (0, i) lie on the conic. H ω image
56 ω is the Image of the absolute Conic (IAC) Computer Vision I: Multi-View 3D reconstruction 09/12/ ω is called the image of the absolute conic Ω = I 3 3 on the plane at infinity π = 0,0,0,1 T Proof. H 1. The homography H = KR is the mapping from the pane at infinity to the image plane. Since: ~ x = KR I C] x, y, z, 0 T is x = KR x, y, z T ω image 2. The conic C = Ω = I 3 3 maps from the plane at infinity to π to the image as: ω = H T CH 1 = KR T I KR 1 = K T R T R 1 K 1 = K T K 1 Note, ω depends on K only and not on R, C. Hence it plays a central role in auto-calibration. ~
57 Degrees of Freedom of ω Computer Vision I: Multi-View 3D reconstruction 09/12/ We have: K = f s p x 0 mf p y then K 1 = a b c 0 d e where a, b, c, d, e are some values that depend on: f, m, s, p x, p y Then it is: ω = (K 1 ) T K 1 = a 0 0 b d 0 c e 1 a b c 0 d e = a 2 ab ac ab b 2 + d 2 bc + de ac bc + de c 2 + e = ω 1 ω 2 ω 3 ω 2 ω 4 ω 5 ω 3 ω 5 ω 6 This means that ω has 5 DoF (scale is not unique)
58 How to compute the IAC? Computer Vision I: Multi-View 3D reconstruction 09/12/ External constraints: orthogonal directions, etc. f s p x K = 0 mf p y camera matrix Internal constraints: Square pixels (i.e. m = 1, s = 0 in K) Camera matrix is the same in two or more views (e.g. video sequence with no zooming) If only internal constraints are used then it is called auto/self-calibration.
59 How to compute the IAC? Computer Vision I: Multi-View 3D reconstruction 09/12/ We need 5 constraints on ω to determine it uniquely
60 Example: internal + external constraints Computer Vision I: Multi-View 3D reconstruction 09/12/ Square pixel cameras (i.e. m = 1, s = 0 in K) gives two constraints: ω 1 = ω 4 and ω 2 = 0 f s p x K = 0 mf p y camera matrix Then ω = ω 1 0 ω 3 0 ω 1 ω 5 ω 3 ω 5 w 6 with only 3 DoF v 1 Given 3 image points v 1 3 that point to orthogonal directions, respectively: v 1 T ω v 2 = 0; v 1 T ω v 3 = 0; v 2 T ω v 3 = 0 v 2 v 3 This gives an equation system Aω = 0 with A of size 3 4. Hence ω can be obtained with SVD K can be derived from ω using Cholesky decomposition
61 Example: internal constraints (practically important) Computer Vision I: Multi-View 3D reconstruction 09/12/ Assume two cameras with: s = 0, and m, p x, p y known The only unknowns are the two focal lengths: f 0, f 1 Then you get the so-called Kruppa equations: u T 1 ω 1 0 u 1 = u 0 T ω 1 0 u 1 = u 0 T ω 1 0 u 0 σ 2 0 v T 0 ω 1 1 v 0 σ 0 σ 1 v T 0 ω 1 1 v 1 σ 2 1 v T 1 ω 1 1 v 1 f s p x K = 0 mf p y camera matrix where SVD of F = u 0 u 1 e 1 0 σ 1 0 σ v 0 T v 1 T e 0 T 1 and ω i 1 = (K i T K i 1 ) = K i K i T = diag(f i 2, f i 2, 1) This can be solved in closed form (see next slide)
62 Sketch of the solution for f 0, f 1 Computer Vision I: Multi-View 3D reconstruction 09/12/
63 Example: internal constraints (sketch) Computer Vision I: Multi-View 3D reconstruction 09/12/ Assume K is constant over 3+ frames then K can be computed We know (lecture 6) we can get K, R, C from P = K R (I 3 3 C) ~ ~ We have already P 1, P 2, P 3 and it is x i1 = P 1 X i = P 1 Q 1 QX i = P 1 X i x i2 = P 2 X i = P 2 Q 1 QX i = P 2 X i x i3 = P 3 X i = P 3 Q 1 QX i = P 3 X i Try to find a Q such that all P 1, P 2, P 3 have the same K but different ~ R 1 3 and C 1 3 See details in chapter 19 HZ
64 How to upgrade a reconstruction Computer Vision I: Multi-View 3D reconstruction 09/12/ Illustrating some ways to upgrade from Projective to Affine and Metric (see details in HZ page 270ff and chapter 19) Camera is calibrated Calibration from external constraints (example: 5 known 3D points) Calibration from a mix of in- and external constraints (example: single camera: 3 orthogonal vanishing points and a square pixel camera) Calibration from internal constraints, called self/auto calibration (example: 3+ views with same K; or two cameras with unknown focal length) Find plane at infinity and move in canonical position: One of the cameras is affine. See HZ page 271) 3 non-collinear 3D vanishing points Translational motion (HZ page 268)
65 Roadmap this lecture Computer Vision I: Multi-View 3D reconstruction 09/12/ Two-view reconstruction From projective to metric space (e.g. self-calibration) Multi-view reconstruction Iterative projective cameras Closed form: affine cameras Closed form: reference plane Next lecture: dense labeling problems in computer vision: stereo matching ICP, KinectFusion
Structure 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 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 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 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 informationStructure from Motion
/8/ Structure from Motion Computer Vision CS 43, Brown James Hays Many slides adapted from Derek Hoiem, Lana Lazebnik, Silvio Saverese, Steve Seitz, and Martial Hebert This class: structure from motion
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 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 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 informationMore on single-view geometry class 10
More on single-view geometry class 10 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.
More informationInvariance of l and the Conic Dual to Circular Points C
Invariance of l and the Conic Dual to Circular Points C [ ] A t l = (0, 0, 1) is preserved under H = v iff H is an affinity: w [ ] l H l H A l l v 0 [ t 0 v! = = w w] 0 0 v = 0 1 1 C = diag(1, 1, 0) is
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 informationMultiple View Geometry in computer vision
Multiple View Geometry in computer vision Chapter 8: More Single View Geometry Olaf Booij Intelligent Systems Lab Amsterdam University of Amsterdam, The Netherlands HZClub 29-02-2008 Overview clubje Part
More informationProjective geometry for Computer Vision
Department of Computer Science and Engineering IIT Delhi NIT, Rourkela March 27, 2010 Overview Pin-hole camera Why projective geometry? Reconstruction Computer vision geometry: main problems Correspondence
More informationStructure from Motion
11/18/11 Structure from Motion Computer Vision CS 143, Brown James Hays Many slides adapted from Derek Hoiem, Lana Lazebnik, Silvio Saverese, Steve Seitz, and Martial Hebert This class: structure from
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 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 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 informationComputer Vision I - Appearance-based Matching and Projective Geometry
Computer Vision I - Appearance-based Matching and Projective Geometry Carsten Rother 05/11/2015 Computer Vision I: Image Formation Process Roadmap for next four lectures Computer Vision I: Image Formation
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 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 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 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 informationCEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt.
CEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt. Session 4 Affine Structure from Motion Mani Golparvar-Fard Department of Civil and Environmental Engineering 329D, Newmark Civil Engineering
More informationLecture 10: Multi-view geometry
Lecture 10: Multi-view geometry Professor Stanford Vision Lab 1 What we will learn today? Review for stereo vision Correspondence problem (Problem Set 2 (Q3)) Active stereo vision systems Structure from
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 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 informationEpipolar Geometry class 11
Epipolar Geometry 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 informationComputer Vision I - Appearance-based Matching and Projective Geometry
Computer Vision I - Appearance-based Matching and Projective Geometry Carsten Rother 01/11/2016 Computer Vision I: Image Formation Process Roadmap for next four lectures Computer Vision I: Image Formation
More informationAuto-calibration. Computer Vision II CSE 252B
Auto-calibration Computer Vision II CSE 252B 2D Affine Rectification Solve for planar projective transformation that maps line (back) to line at infinity Solve as a Householder matrix Euclidean Projective
More informationCS231A Midterm Review. Friday 5/6/2016
CS231A Midterm Review Friday 5/6/2016 Outline General Logistics Camera Models Non-perspective cameras Calibration Single View Metrology Epipolar Geometry Structure from Motion Active Stereo and Volumetric
More informationCS 532: 3D Computer Vision 7 th Set of Notes
1 CS 532: 3D Computer Vision 7 th Set of Notes Instructor: Philippos Mordohai Webpage: www.cs.stevens.edu/~mordohai E-mail: Philippos.Mordohai@stevens.edu Office: Lieb 215 Logistics No class on October
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 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 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 informationProjective geometry for 3D Computer Vision
Subhashis Banerjee Computer Science and Engineering IIT Delhi Dec 16, 2015 Overview Pin-hole camera Why projective geometry? Reconstruction Computer vision geometry: main problems Correspondence problem:
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 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 informationLecture 10: Multi view geometry
Lecture 10: Multi view geometry Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Stereo vision Correspondence problem (Problem Set 2 (Q3)) Active stereo vision systems Structure from
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 informationC280, Computer Vision
C280, Computer Vision Prof. Trevor Darrell trevor@eecs.berkeley.edu Lecture 11: Structure from Motion Roadmap Previous: Image formation, filtering, local features, (Texture) Tues: Feature-based Alignment
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 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 informationComputer Vision Projective Geometry and Calibration. Pinhole cameras
Computer Vision Projective Geometry and Calibration Professor Hager http://www.cs.jhu.edu/~hager Jason Corso http://www.cs.jhu.edu/~jcorso. Pinhole cameras Abstract camera model - box with a small hole
More informationRefining Single View Calibration With the Aid of Metric Scene Properties
Goack Refining Single View Calibration With the Aid of Metric Scene roperties Manolis I.A. Lourakis lourakis@ics.forth.gr Antonis A. Argyros argyros@ics.forth.gr Institute of Computer Science Foundation
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 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 informationGeometry of Multiple views
1 Geometry of Multiple views CS 554 Computer Vision Pinar Duygulu Bilkent University 2 Multiple views Despite the wealth of information contained in a a photograph, the depth of a scene point along the
More informationEpipolar Geometry CSE P576. Dr. Matthew Brown
Epipolar Geometry CSE P576 Dr. Matthew Brown Epipolar Geometry Epipolar Lines, Plane Constraint Fundamental Matrix, Linear solution + RANSAC Applications: Structure from Motion, Stereo [ Szeliski 11] 2
More informationCS-9645 Introduction to Computer Vision Techniques Winter 2019
Table of Contents Projective Geometry... 1 Definitions...1 Axioms of Projective Geometry... Ideal Points...3 Geometric Interpretation... 3 Fundamental Transformations of Projective Geometry... 4 The D
More informationProjective geometry, camera models and calibration
Projective geometry, camera models and calibration Subhashis Banerjee Dept. Computer Science and Engineering IIT Delhi email: suban@cse.iitd.ac.in January 6, 2008 The main problems in computer vision Image
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 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 informationMultiview Stereo COSC450. Lecture 8
Multiview Stereo COSC450 Lecture 8 Stereo Vision So Far Stereo and epipolar geometry Fundamental matrix captures geometry 8-point algorithm Essential matrix with calibrated cameras 5-point algorithm Intersect
More informationStep-by-Step Model Buidling
Step-by-Step Model Buidling Review Feature selection Feature selection Feature correspondence Camera Calibration Euclidean Reconstruction Landing Augmented Reality Vision Based Control Sparse Structure
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 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 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 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 informationLecture 5 Epipolar Geometry
Lecture 5 Epipolar Geometry Professor Silvio Savarese Computational Vision and Geometry Lab Silvio Savarese Lecture 5-24-Jan-18 Lecture 5 Epipolar Geometry Why is stereo useful? Epipolar constraints Essential
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 informationComputer Vision cmput 428/615
Computer Vision cmput 428/615 Basic 2D and 3D geometry and Camera models Martin Jagersand The equation of projection Intuitively: How do we develop a consistent mathematical framework for projection calculations?
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 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 informationEpipolar Geometry and Stereo Vision
Epipolar Geometry and Stereo Vision Computer Vision Jia-Bin Huang, Virginia Tech Many slides from S. Seitz and D. Hoiem Last class: Image Stitching Two images with rotation/zoom but no translation. X x
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 information3D Photography: Epipolar geometry
3D Photograph: Epipolar geometr Kalin Kolev, Marc Pollefes Spring 203 http://cvg.ethz.ch/teaching/203spring/3dphoto/ Schedule (tentative) Feb 8 Feb 25 Mar 4 Mar Mar 8 Mar 25 Apr Apr 8 Apr 5 Apr 22 Apr
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 informationLecture 6 Stereo Systems Multi-view geometry
Lecture 6 Stereo Systems Multi-view geometry Professor Silvio Savarese Computational Vision and Geometry Lab Silvio Savarese Lecture 6-5-Feb-4 Lecture 6 Stereo Systems Multi-view geometry Stereo systems
More informationCS 664 Structure and Motion. Daniel Huttenlocher
CS 664 Structure and Motion Daniel Huttenlocher Determining 3D Structure Consider set of 3D points X j seen by set of cameras with projection matrices P i Given only image coordinates x ij of each point
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 information3D Sensing and Reconstruction Readings: Ch 12: , Ch 13: ,
3D Sensing and Reconstruction Readings: Ch 12: 12.5-6, Ch 13: 13.1-3, 13.9.4 Perspective Geometry Camera Model Stereo Triangulation 3D Reconstruction by Space Carving 3D Shape from X means getting 3D coordinates
More informationCamera Drones Lecture 3 3D data generation
Camera Drones Lecture 3 3D data generation Ass.Prof. Friedrich Fraundorfer WS 2017 Outline SfM introduction SfM concept Feature matching Camera pose estimation Bundle adjustment Dense matching Data products
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 informationVision 3D articielle Multiple view geometry
Vision 3D articielle Multiple view geometry Pascal Monasse monasse@imagine.enpc.fr IMAGINE, École des Ponts ParisTech Contents Multi-view constraints Multi-view calibration Incremental calibration Global
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 informationSrikumar Ramalingam. Review. 3D Reconstruction. Pose Estimation Revisited. School of Computing University of Utah
School of Computing University of Utah Presentation Outline 1 2 3 Forward Projection (Reminder) u v 1 KR ( I t ) X m Y m Z m 1 Backward Projection (Reminder) Q K 1 q Q K 1 u v 1 What is pose estimation?
More informationCS 231A Computer Vision (Winter 2015) Problem Set 2
CS 231A Computer Vision (Winter 2015) Problem Set 2 Due Feb 9 th 2015 11:59pm 1 Fundamental Matrix (20 points) In this question, you will explore some properties of fundamental matrix and derive a minimal
More informationDense 3D Reconstruction. Christiano Gava
Dense 3D Reconstruction Christiano Gava christiano.gava@dfki.de Outline Previous lecture: structure and motion II Structure and motion loop Triangulation Today: dense 3D reconstruction The matching problem
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 informationStructure from Motion. Prof. Marco Marcon
Structure from Motion Prof. Marco Marcon Summing-up 2 Stereo is the most powerful clue for determining the structure of a scene Another important clue is the relative motion between the scene and (mono)
More informationA Stratified Approach for Camera Calibration Using Spheres
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. XX, NO. Y, MONTH YEAR 1 A Stratified Approach for Camera Calibration Using Spheres Kwan-Yee K. Wong, Member, IEEE, Guoqiang Zhang, Student-Member, IEEE and Zhihu
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 informationAutomatic Estimation of Epipolar Geometry
Robust line estimation Automatic Estimation of Epipolar Geometry Fit a line to 2D data containing outliers c b a d There are two problems: (i) a line fit to the data ;, (ii) a classification of the data
More informationSrikumar Ramalingam. Review. 3D Reconstruction. Pose Estimation Revisited. School of Computing University of Utah
School of Computing University of Utah Presentation Outline 1 2 3 Forward Projection (Reminder) u v 1 KR ( I t ) X m Y m Z m 1 Backward Projection (Reminder) Q K 1 q Presentation Outline 1 2 3 Sample Problem
More informationProjective 2D Geometry
Projective D Geometry Multi View Geometry (Spring '08) Projective D Geometry Prof. Kyoung Mu Lee SoEECS, Seoul National University Homogeneous representation of lines and points Projective D Geometry Line
More informationLast lecture. Passive Stereo Spacetime Stereo
Last lecture Passive Stereo Spacetime Stereo Today Structure from Motion: Given pixel correspondences, how to compute 3D structure and camera motion? Slides stolen from Prof Yungyu Chuang Epipolar geometry
More informationVision par ordinateur
Epipolar geometry π Vision par ordinateur Underlying structure in set of matches for rigid scenes l T 1 l 2 C1 m1 l1 e1 M L2 L1 e2 Géométrie épipolaire Fundamental matrix (x rank 2 matrix) m2 C2 l2 Frédéric
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 informationMetric Rectification for Perspective Images of Planes
789139-3 University of California Santa Barbara Department of Electrical and Computer Engineering CS290I Multiple View Geometry in Computer Vision and Computer Graphics Spring 2006 Metric Rectification
More informationCS 4495 Computer Vision A. Bobick. Motion and Optic Flow. Stereo Matching
Stereo Matching Fundamental matrix Let p be a point in left image, p in right image l l Epipolar relation p maps to epipolar line l p maps to epipolar line l p p Epipolar mapping described by a 3x3 matrix
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 informationCamera Model and Calibration
Camera Model and Calibration Lecture-10 Camera Calibration Determine extrinsic and intrinsic parameters of camera Extrinsic 3D location and orientation of camera Intrinsic Focal length The size of the
More information3D Geometric Computer Vision. Martin Jagersand Univ. Alberta Edmonton, Alberta, Canada
3D Geometric Computer Vision Martin Jagersand Univ. Alberta Edmonton, Alberta, Canada Multi-view geometry Build 3D models from images Carry out manipulation tasks http://webdocs.cs.ualberta.ca/~vis/ibmr/
More informationIndex. 3D reconstruction, point algorithm, point algorithm, point algorithm, point algorithm, 263
Index 3D reconstruction, 125 5+1-point algorithm, 284 5-point algorithm, 270 7-point algorithm, 265 8-point algorithm, 263 affine point, 45 affine transformation, 57 affine transformation group, 57 affine
More informationToday. Stereo (two view) reconstruction. Multiview geometry. Today. Multiview geometry. Computational Photography
Computational Photography Matthias Zwicker University of Bern Fall 2009 Today From 2D to 3D using multiple views Introduction Geometry of two views Stereo matching Other applications Multiview geometry
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 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 informationBut First: Multi-View Projective Geometry
View Morphing (Seitz & Dyer, SIGGRAPH 96) Virtual Camera Photograph Morphed View View interpolation (ala McMillan) but no depth no camera information Photograph But First: Multi-View Projective Geometry
More informationComputer Vision I Name : CSE 252A, Fall 2012 Student ID : David Kriegman Assignment #1. (Due date: 10/23/2012) x P. = z
Computer Vision I Name : CSE 252A, Fall 202 Student ID : David Kriegman E-Mail : Assignment (Due date: 0/23/202). Perspective Projection [2pts] Consider a perspective projection where a point = z y x P
More informationMetric Structure from Motion
CS443 Final Project Metric Structure from Motion Peng Cheng 1 Objective of the Project Given: 1. A static object with n feature points and unknown shape. 2. A camera with unknown intrinsic parameters takes
More information