Project 2 went out on Tuesday You should have a partner You should have signed up for a panorama kit Announcements.

Slides:



Advertisements
Similar presentations
Single-view geometry Odilon Redon, Cyclops, 1914.
Advertisements

Single-view Metrology and Camera Calibration
Computer Vision, Robert Pless
Last 4 lectures Camera Structure HDR Image Filtering Image Transform.
More Mosaic Madness : Computational Photography Alexei Efros, CMU, Fall 2011 © Jeffrey Martin (jeffrey-martin.com) with a lot of slides stolen from.
View Morphing (Seitz & Dyer, SIGGRAPH 96)
Camera calibration and epipolar geometry
Single-view metrology
3D Geometry and Camera Calibration. 3D Coordinate Systems Right-handed vs. left-handedRight-handed vs. left-handed x yz x yz.
Lecture 14: Panoramas CS4670: Computer Vision Noah Snavely What’s inside your fridge?
CS6670: Computer Vision Noah Snavely Lecture 17: Stereo
Lecture 19: Single-view modeling CS6670: Computer Vision Noah Snavely.
Lecture 11: Structure from motion, part 2 CS6670: Computer Vision Noah Snavely.
list – let me know if you have NOT been getting mail Assignment hand in procedure –web page –at least 3 panoramas: »(1) sample sequence, (2) w/Kaidan,
Epipolar geometry. (i)Correspondence geometry: Given an image point x in the first view, how does this constrain the position of the corresponding point.
Uncalibrated Geometry & Stratification Sastry and Yang
Scene Modeling for a Single View : Computational Photography Alexei Efros, CMU, Fall 2005 René MAGRITTE Portrait d'Edward James …with a lot of slides.
Announcements Project 2 questions Midterm out on Thursday
Lecture 7: Image Alignment and Panoramas CS6670: Computer Vision Noah Snavely What’s inside your fridge?
Projective geometry Slides from Steve Seitz and Daniel DeMenthon
Lecture 20: Light, color, and reflectance CS6670: Computer Vision Noah Snavely.
Lecture 15: Single-view modeling CS6670: Computer Vision Noah Snavely.
Panorama signups Panorama project issues? Nalwa handout Announcements.
Lecture 16: Single-view modeling, Part 2 CS6670: Computer Vision Noah Snavely.
Single-view geometry Odilon Redon, Cyclops, 1914.
Panoramas and Calibration : Rendering and Image Processing Alexei Efros …with a lot of slides stolen from Steve Seitz and Rick Szeliski.
Single-view Metrology and Camera Calibration Computer Vision Derek Hoiem, University of Illinois 02/26/15 1.
CSE 576, Spring 2008Projective Geometry1 Lecture slides by Steve Seitz (mostly) Lecture presented by Rick Szeliski.
Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.
Scene Modeling for a Single View : Computational Photography Alexei Efros, CMU, Spring 2010 René MAGRITTE Portrait d'Edward James …with a lot of.
Today: Calibration What are the camera parameters?
Single-view Metrology and Cameras Computational Photography Derek Hoiem, University of Illinois 10/8/13.
Single-view metrology
Projective Geometry and Single View Modeling CSE 455, Winter 2010 January 29, 2010 Ames Room.
Single-view modeling, Part 2 CS4670/5670: Computer Vision Noah Snavely.
776 Computer Vision Jan-Michael Frahm, Enrique Dunn Spring 2013.
Automatic Camera Calibration
CSC 589 Lecture 22 Image Alignment and least square methods Bei Xiao American University April 13.
Lecture 12: Image alignment CS4670/5760: Computer Vision Kavita Bala
Projective cameras Motivation Elements of Projective Geometry Projective structure from motion Planches : –
Last Lecture (optical center) origin principal point P (X,Y,Z) p (x,y) x y.
Single-view Metrology and Camera Calibration Computer Vision Derek Hoiem, University of Illinois 01/25/11 1.
Camera calibration Digital Visual Effects Yung-Yu Chuang with slides by Richard Szeliski, Steve Seitz,, Fred Pighin and Marc Pollefyes.
Geometric Camera Models
Single View Geometry Course web page: vision.cis.udel.edu/cv April 9, 2003  Lecture 20.
Project 2 –contact your partner to coordinate ASAP –more work than the last project (> 1 week) –you should have signed up for panorama kitssigned up –sign.
Peripheral drift illusion. Multiple views Hartley and Zisserman Lowe stereo vision structure from motion optical flow.
Single-view geometry Odilon Redon, Cyclops, 1914.
Single-view Metrology and Cameras Computational Photography Derek Hoiem, University of Illinois 10/06/15.
Calibration.
Last Two Lectures Panoramic Image Stitching
More with Pinhole + Single-view Metrology
Single-view geometry Odilon Redon, Cyclops, 1914.
Project 1 Due NOW Project 2 out today –Help session at end of class Announcements.
Lecture 16: Image alignment
Calibrating a single camera
Lec 23: Single View Modeling
Single-view metrology
Depth from disparity (x´,y´)=(x+D(x,y), y)
Digital Visual Effects, Spring 2007 Yung-Yu Chuang 2007/4/17
Scene Modeling for a Single View
Digital Visual Effects, Spring 2008 Yung-Yu Chuang 2008/4/15
Epipolar geometry.
Geometric Camera Models
Digital Visual Effects Yung-Yu Chuang
Projective geometry Readings
Announcements list – let me know if you have NOT been getting mail
Multi-view geometry.
Announcements Project 2 extension: Friday, Feb 8
Presentation transcript:

Project 2 went out on Tuesday You should have a partner You should have signed up for a panorama kit Announcements

Projective geometry Readings Mundy, J.L. and Zisserman, A., Geometric Invariance in Computer Vision, Chapter 23: Appendix: Projective Geometry for Machine Vision, MIT Press, Cambridge, MA, 1992, pp (for this week, read , 23.10) –available online: Ames Room

Projective geometry—what’s it good for? Uses of projective geometry Drawing Measurements Mathematics for projection Undistorting images Focus of expansion Camera pose estimation, match move Object recognition

Applications of projective geometry Vermeer’s Music Lesson

Measurements on planes Approach: unwarp then measure What kind of warp is this?

Image rectification To unwarp (rectify) an image solve for homography H given p and p’ solve equations of the form: wp’ = Hp –linear in unknowns: w and coefficients of H –H is defined up to an arbitrary scale factor –how many points are necessary to solve for H? p p’ work out on board

Solving for homographies

Ah0 Linear least squares Since h is only defined up to scale, solve for unit vector ĥ Minimize 2n × 9 92n Solution: ĥ = eigenvector of A T A with smallest eigenvalue Works with 4 or more points

(0,0,0) The projective plane Why do we need homogeneous coordinates? represent points at infinity, homographies, perspective projection, multi-view relationships What is the geometric intuition? a point in the image is a ray in projective space (sx,sy,s) Each point (x,y) on the plane is represented by a ray (sx,sy,s) –all points on the ray are equivalent: (x, y, 1)  (sx, sy, s) image plane (x,y,1) y x z

Projective lines What does a line in the image correspond to in projective space? A line is a plane of rays through origin –all rays (x,y,z) satisfying: ax + by + cz = 0 A line is also represented as a homogeneous 3-vector l lp

l Point and line duality A line l is a homogeneous 3-vector It is  to every point (ray) p on the line: l p=0 p1p1 p2p2 What is the intersection of two lines l 1 and l 2 ? p is  to l 1 and l 2  p = l 1  l 2 Points and lines are dual in projective space given any formula, can switch the meanings of points and lines to get another formula l1l1 l2l2 p What is the line l spanned by rays p 1 and p 2 ? l is  to p 1 and p 2  l = p 1  p 2 l is the plane normal

Ideal points and lines Ideal point (“point at infinity”) p  (x, y, 0) – parallel to image plane It has infinite image coordinates (sx,sy,0) y x z image plane Ideal line l  (a, b, 0) – parallel to image plane (a,b,0) y x z image plane Corresponds to a line in the image (finite coordinates)

Homographies of points and lines Computed by 3x3 matrix multiplication To transform a point: p’ = Hp To transform a line: lp=0  l’p’=0 –0 = lp = lH -1 Hp = lH -1 p’  l’ = lH -1 –lines are transformed by postmultiplication of H -1

3D projective geometry These concepts generalize naturally to 3D Homogeneous coordinates –Projective 3D points have four coords: P = (X,Y,Z,W) Duality –A plane N is also represented by a 4-vector –Points and planes are dual in 3D: N P=0 Projective transformations –Represented by 4x4 matrices T: P’ = TP, N’ = N T -1

3D to 2D: “perspective” projection Matrix Projection: What is not preserved under perspective projection? What IS preserved?

Vanishing points Vanishing point projection of a point at infinity image plane camera center ground plane vanishing point

Vanishing points (2D) image plane camera center line on ground plane vanishing point

Vanishing points Properties Any two parallel lines have the same vanishing point v The ray from C through v is parallel to the lines An image may have more than one vanishing point image plane camera center C line on ground plane vanishing point V line on ground plane

Vanishing lines Multiple Vanishing Points Any set of parallel lines on the plane define a vanishing point The union of all of these vanishing points is the horizon line –also called vanishing line Note that different planes define different vanishing lines v1v1 v2v2

Vanishing lines Multiple Vanishing Points Any set of parallel lines on the plane define a vanishing point The union of all of these vanishing points is the horizon line –also called vanishing line Note that different planes define different vanishing lines

Computing vanishing points Properties P  is a point at infinity, v is its projection They depend only on line direction Parallel lines P 0 + tD, P 1 + tD intersect at P  V P0P0 D

Computing vanishing lines Properties l is intersection of horizontal plane through C with image plane Compute l from two sets of parallel lines on ground plane All points at same height as C project to l –points higher than C project above l Provides way of comparing height of objects in the scene ground plane l C

Fun with vanishing points

Perspective cues

Comparing heights VanishingPoint

Measuring height Camera height

q1q1 Computing vanishing points (from lines) Intersect p 1 q 1 with p 2 q 2 v p1p1 p2p2 q2q2 Least squares version Better to use more than two lines and compute the “closest” point of intersection See notes by Bob Collins for one good way of doing this:Bob Collins –

C Measuring height without a ruler ground plane Compute Z from image measurements Need more than vanishing points to do this Z

The cross ratio A Projective Invariant Something that does not change under projective transformations (including perspective projection) P1P1 P2P2 P3P3 P4P4 The cross-ratio of 4 collinear points Can permute the point ordering 4! = 24 different orders (but only 6 distinct values) This is the fundamental invariant of projective geometry

vZvZ r t b image cross ratio Measuring height B (bottom of object) T (top of object) R (reference point) ground plane H C scene cross ratio  scene points represented as image points as R

Measuring height RH vzvz r b t image cross ratio H b0b0 t0t0 v vxvx vyvy vanishing line (horizon)

Measuring height vzvz r b t0t0 vxvx vyvy vanishing line (horizon) v t0t0 m0m0 What if the point on the ground plane b 0 is not known? Here the guy is standing on the box, height of box is known Use one side of the box to help find b 0 as shown above b0b0 t1t1 b1b1

Computing (X,Y,Z) coordinates Okay, we know how to compute height (Z coords) how can we compute X, Y?

3D Modeling from a photograph

Camera calibration Goal: estimate the camera parameters Version 1: solve for projection matrix Version 2: solve for camera parameters separately –intrinsics (focal length, principle point, pixel size) –extrinsics (rotation angles, translation) –radial distortion

Vanishing points and projection matrix = v x (X vanishing point) Z3Y2, similarly, v π v π  Not So Fast! We only know v’s up to a scale factor Can fully specify by providing 3 reference points

Calibration using a reference object Place a known object in the scene identify correspondence between image and scene compute mapping from scene to image Issues must know geometry very accurately must know 3D->2D correspondence

Chromaglyphs Courtesy of Bruce Culbertson, HP Labs

Estimating the projection matrix Place a known object in the scene identify correspondence between image and scene compute mapping from scene to image

Direct linear calibration

Can solve for m ij by linear least squares use eigenvector trick that we used for homographies

Direct linear calibration Advantage: Very simple to formulate and solve Disadvantages: Doesn’t tell you the camera parameters Doesn’t model radial distortion Hard to impose constraints (e.g., known focal length) Doesn’t minimize the right error function For these reasons, nonlinear methods are preferred Define error function E between projected 3D points and image positions –E is nonlinear function of intrinsics, extrinsics, radial distortion Minimize E using nonlinear optimization techniques –e.g., variants of Newton’s method (e.g., Levenberg Marquart)

Alternative: multi-plane calibration Images courtesy Jean-Yves Bouguet, Intel Corp. Advantage Only requires a plane Don’t have to know positions/orientations Good code available online! –Intel’s OpenCV library: –Matlab version by Jean-Yves Bouget: –Zhengyou Zhang’s web site:

C Measurements within reference plane Solve for homography H relating reference plane to image plane H maps reference plane (X,Y) coords to image plane (x,y) coords Fully determined from 4 known points on ground plane –Option A: physically measure 4 points on ground –Option B: find a square, guess the dimensions –Option C: Note H = columns 1,2,4 projection matrix »derive on board (this works assuming Z = 0) Given (x, y), can find (X,Y) by H -1 reference plane image plane

Criminisi et al., ICCV 99 Complete approach Load in an image Click on lines parallel to X axis –repeat for Y, Z axes Compute vanishing points Specify 3D and 2D positions of 4 points on reference plane Compute homography H Specify a reference height Compute 3D positions of several points Create a 3D model from these points Extract texture maps Output a VRML model