MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.

Slides:



Advertisements
Similar presentations
The fundamental matrix F
Advertisements

Lecture 11: Two-view geometry
3D reconstruction.
Institut für Elektrische Meßtechnik und Meßsignalverarbeitung Professor Horst Cerjak, Augmented Reality VU 2 Calibration Axel Pinz.
Two-View Geometry CS Sastry and Yang
Two-view geometry.
Lecture 8: Stereo.
Camera calibration and epipolar geometry
Structure from motion.
Epipolar geometry. (i)Correspondence geometry: Given an image point x in the first view, how does this constrain the position of the corresponding point.
Structure from motion. Multiple-view geometry questions Scene geometry (structure): Given 2D point matches in two or more images, where are the corresponding.
Uncalibrated Geometry & Stratification Sastry and Yang
Multiple View Geometry
3D reconstruction of cameras and structure x i = PX i x’ i = P’X i.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Lecture 11: Structure from motion CS6670: Computer Vision Noah Snavely.
Stereo and Structure from Motion
CS664 Lecture #19: Layers, RANSAC, panoramas, epipolar geometry Some material taken from:  David Lowe, UBC  Jiri Matas, CMP Prague
Lecture 20: Two-view geometry CS6670: Computer Vision Noah Snavely.
3D Computer Vision and Video Computing 3D Vision Lecture 14 Stereo Vision (I) CSC 59866CD Fall 2004 Zhigang Zhu, NAC 8/203A
May 2004Stereo1 Introduction to Computer Vision CS / ECE 181B Tuesday, May 11, 2004  Multiple view geometry and stereo  Handout #6 available (check with.
3-D Scene u u’u’ Study the mathematical relations between corresponding image points. “Corresponding” means originated from the same 3D point. Objective.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
Automatic Camera Calibration
Computer vision: models, learning and inference
CSC 589 Lecture 22 Image Alignment and least square methods Bei Xiao American University April 13.
MASKS © 2004 Invitation to 3D vision Lecture 3 Image Primitives andCorrespondence.
Lecture 11 Stereo Reconstruction I Lecture 11 Stereo Reconstruction I Mata kuliah: T Computer Vision Tahun: 2010.
Multi-view geometry.
Lecture 12 Stereo Reconstruction II Lecture 12 Stereo Reconstruction II Mata kuliah: T Computer Vision Tahun: 2010.
The Brightness Constraint
Epipolar geometry Epipolar Plane Baseline Epipoles Epipolar Lines
Structure from Motion Course web page: vision.cis.udel.edu/~cv April 25, 2003  Lecture 26.
CSCE 643 Computer Vision: Structure from Motion
Correspondence-Free Determination of the Affine Fundamental Matrix (Tue) Young Ki Baik, Computer Vision Lab.
3D Reconstruction Jeff Boody. Goals ● Reconstruct 3D models from a sequence of at least two images ● No prior knowledge of the camera or scene ● Use the.
© 2005 Martin Bujňák, Martin Bujňák Supervisor : RNDr.
Computer Vision Lecture #10 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department, Ain Shams University, Cairo, Egypt 2 Electerical.
Raquel A. Romano 1 Scientific Computing Seminar May 12, 2004 Projective Geometry for Computer Vision Projective Geometry for Computer Vision Raquel A.
Two-view geometry. Epipolar Plane – plane containing baseline (1D family) Epipoles = intersections of baseline with image planes = projections of the.
Geometric Transformations
stereo Outline : Remind class of 3d geometry Introduction
Feature Matching. Feature Space Outlier Rejection.
3D reconstruction from uncalibrated images
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
Features, Feature descriptors, Matching Jana Kosecka George Mason University.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
Computer vision: models, learning and inference M Ahad Multiple Cameras
776 Computer Vision Jan-Michael Frahm & Enrique Dunn Spring 2013.
Lecture 9 Feature Extraction and Motion Estimation Slides by: Michael Black Clark F. Olson Jean Ponce.
Linearizing (assuming small (u,v)): Brightness Constancy Equation: The Brightness Constraint Where:),(),(yxJyxII t  Each pixel provides 1 equation in.
MASKS © 2004 Invitation to 3D vision Uncalibrated Camera Chapter 6 Reconstruction from Two Uncalibrated Views Modified by L A Rønningen Oct 2008.
Reconstruction from Two Calibrated Views Two-View Geometry
Geometry Reconstruction March 22, Fundamental Matrix An important problem: Determine the epipolar geometry. That is, the correspondence between.
Uncalibrated reconstruction Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration.
Robust Estimation Course web page: vision.cis.udel.edu/~cv April 23, 2003  Lecture 25.
EECS 274 Computer Vision Projective Structure from Motion.
Linearizing (assuming small (u,v)): Brightness Constancy Equation: The Brightness Constraint Where:),(),(yxJyxII t  Each pixel provides 1 equation in.
MASKS © 2004 Invitation to 3D vision Lecture 3 Image Primitives andCorrespondence.
Correspondence and Stereopsis. Introduction Disparity – Informally: difference between two pictures – Allows us to gain a strong sense of depth Stereopsis.
CSE 185 Introduction to Computer Vision Stereo 2.
Multi-view geometry. Multi-view geometry problems Structure: Given projections of the same 3D point in two or more images, compute the 3D coordinates.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
Epipolar Geometry and Stereo Vision
The Brightness Constraint
Epipolar geometry.
The Brightness Constraint
The Brightness Constraint
Uncalibrated Geometry & Stratification
Two-view geometry.
Presentation transcript:

MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling

MASKS © 2004 Invitation to 3D vision Review Feature correspondence Camera Calibration Feature selection Feature selection Euclidean Reconstruction Sparse Structure and camera motion Landing Augmented Reality Vision Based Control

MASKS © 2004 Invitation to 3D vision Review Feature correspondence Camera Calibration Dense Correspondence Texture mapping Epipolar Rectification Feature selection Feature selection 3-D Model Sparse Structure and motion Euclidean Reconstruction

MASKS © 2004 Invitation to 3D vision Review Feature correspondence Projective Reconstruction Euclidean Reconstruction Dense Correspondence Texture mapping Epipolar Rectification Feature selection Feature selection 3-D Model Camera Self-Calibration Partial Scene Knowledge Partial Motion Knowledge Partial Calibration Knowledge

MASKS © 2004 Invitation to 3D vision Examples

MASKS © 2004 Invitation to 3D vision Feature Selection Compute Image Gradient Compute Feature Quality measure for each pixel Search for local maxima Feature Quality FunctionLocal maxima of feature quality function

MASKS © 2004 Invitation to 3D vision Feature Tracking Translational motion model Closed form solution 1. Build an image pyramid 2. Start from coarsest level 3. Estimate the displacement at the coarsest level 4. Iterate until finest level

MASKS © 2004 Invitation to 3D vision Coarse to fine feature tracking 1. compute 2. warp the window in the second image by 3. update the displacement 4. go to finer level 5. At the finest level repeat for several iterations 0 2 1

MASKS © 2004 Invitation to 3D vision Integrate around over image patch Solve Optical Flow

MASKS © 2004 Invitation to 3D vision Affine feature tracking Intensity offset Contrast change

MASKS © 2004 Invitation to 3D vision Tracked Features

MASKS © 2004 Invitation to 3D vision Wide baseline matching Point features detected by Harris Corner detector

MASKS © 2004 Invitation to 3D vision Wide baseline Feature Matching 1. Select the features in two views 2. For each feature in the first view 3. Find the feature in the second view that maximizes 4. Normalized cross-correlation measure Select the candidate with the similarity above selected threshold

MASKS © 2004 Invitation to 3D vision More correspondences and Robust matching Select set of putative correspondences Repeat 1. Select at random a set of 8 successful matches 2. Compute fundamental matrix 3. Determine the subset of inliers, compute distance to epipolar line 4. Count the number of points in the consensus set

MASKS © 2004 Invitation to 3D vision RANSAC in action Inliers Outliers

MASKS © 2004 Invitation to 3D vision Epipolar Geometry Epipolar geometry in two views Refined epipolar geometry using nonlinear estimation of F

MASKS © 2004 Invitation to 3D vision Two view initialization Recover epipolar geometry Compute (Euclidean) projection matrices and 3-D struct. Compute (Projective) projection matrices and 3-D struct. calibrated uncalibrated unknown

MASKS © 2004 Invitation to 3D vision Projective Reconstruction 3-D reconstruction from two views

MASKS © 2004 Invitation to 3D vision Multi-view reconstruction Two view - initialized motion and structure estimates (scales) Multi-view factorization - recover the remaining camera positions and refine the 3-D structure by iteratively computing 1. Compute i-th motion given the known structure 2. Refine structure estimate given all the motions Repeat until convergence iteration

MASKS © 2004 Invitation to 3D vision Projective Ambiguity calibrated case – projection matrices - and Euclidean structure Uncalibrated case for i-th frame for 1 st frame Transform projection matrices and 3-D structure by H

MASKS © 2004 Invitation to 3D vision From Projective to Euclidean Reconstruction Remove the ambiguity characterized by How to estimate H ? - Absolute quadric constraint be recovered by a nonlinear minimization unknowns Upgrade to Euclidean Reconstruction

MASKS © 2004 Invitation to 3D vision Upgrade to Euclidean Reconstruction Special case unknown focal length other internal parameters are known (proj. center, aspect ratio) Q can be parametrized in the following way Zero entries in lead to linear constraints on Q Initial estimate of Q can be obtained using linear techniques

MASKS © 2004 Invitation to 3D vision Example of multi-view reconstruction Euclidean reconstruction Projective Reconstruction

MASKS © 2004 Invitation to 3D vision Nonlinear Refinement Euclidean Bundle adjustment Initial estimates of are available Final refinement, nonlinear minimization with respect to all unknowns

MASKS © 2004 Invitation to 3D vision Example - Euclidean multi-view reconstruction

MASKS © 2004 Invitation to 3D vision Example Tracked Features Original sequence

MASKS © 2004 Invitation to 3D vision Recovered model

MASKS © 2004 Invitation to 3D vision Euclidean Reconstruction

MASKS © 2004 Invitation to 3D vision Epipolar rectification Make the epipolar lines parallel Dense correspondences along image scanlines Computation of warping homographies 1. Map the epipole to infinity Translate the image center to the origin Rotate around z-axis for the epipole lie on the x-axis Transform the epipole from x-axis to infinity 2. Find a matching transformation is compatible with the epipolar geometry is chosen to minimize overall disparity

MASKS © 2004 Invitation to 3D vision Epipolar rectification Rectified Image Pair

MASKS © 2004 Invitation to 3D vision Epipolar rectification Rectified Image Pair

MASKS © 2004 Invitation to 3D vision Dense Matching Establish dense correspondences along scan-lines Standard stereo configuration Constraints to guide the search 1. ordering constraint 2. disparity constraint – limit on disparity 3. uniqueness constraint – each point has a unique match in the second view

MASKS © 2004 Invitation to 3D vision Dense Matching

MASKS © 2004 Invitation to 3D vision Dense Reconstruction

MASKS © 2004 Invitation to 3D vision Texture mapping, hole filling

MASKS © 2004 Invitation to 3D vision Texture mapping