Announcements Project 2 questions Midterm out on Thursday

Slides:



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

Single-view Metrology and Camera Calibration
Computer Vision, Robert Pless
Lecture 11: Two-view geometry
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.
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.
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.
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
Camera Geometry and Calibration Thanks to Martial Hebert.
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
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.
Announcements Project 3 due Thursday by 11:59pm Demos on Friday; signup on CMS Prelim to be distributed in class Friday, due Wednesday by the beginning.
Single-view geometry Odilon Redon, Cyclops, 1914.
Single-view Metrology and Cameras Computational Photography Derek Hoiem, University of Illinois 10/06/15.
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.
Project 2 went out on Tuesday You should have a partner You should have signed up for a panorama kit 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
Humans and animals have a number of senses
Digital Visual Effects, Spring 2008 Yung-Yu Chuang 2008/4/15
I. BASICS Thanks to Peter Corke for the use of some slides
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:

Announcements Project 2 questions Midterm out on Thursday Take-home, open book/notes, you have a week to do it

Projective geometry Readings Ames Room Readings Mundy, J.L. and Zisserman, A., Geometric Invariance in Computer Vision, Appendix: Projective Geometry for Machine Vision, MIT Press, Cambridge, MA, 1992, (read  23.1 - 23.5, 23.10) available online: http://www.cs.cmu.edu/~ph/869/papers/zisser-mundy.pdf

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 Reconstructions by Criminisi et al.

Measurements on planes 1 2 3 4 homography! Approach: unwarp then measure What kind of warp is this?

Image rectification To unwarp (rectify) an image p’ p 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? work out on board

Solving for homographies

Solving for homographies 2n × 9 9 2n Defines a least squares problem: Old trick we used in Lucas-Kanade: solve Problem: this gives a solution of Since h is only defined up to scale, solve for unit vector ĥ Solution: ĥ = eigenvector of ATA with smallest eigenvalue Works with 4 or more points

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 image plane (x,y,1) y (sx,sy,s) (0,0,0) x z 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)

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 l p

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

Ideal points and lines Ideal point (“point at infinity”) Ideal line l  (a, b, 0) – parallel to image plane (a,b,0) y x z image plane (sx,sy,0) y x z image plane Ideal point (“point at infinity”) p  (x, y, 0) – parallel to image plane It has infinite image coordinates 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-1Hp = lH-1p’  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? Preserved: lines, incidence Not preserved: lengths, angles, parallelism

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

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

Vanishing points Properties image plane vanishing point V line on ground plane camera center C line on ground plane 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 in fact every pixel is a potential vanishing point How to determine which lines in the scene vanish at a given pixel?

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

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 D Properties P is a point at infinity, v is its projection They depend only on line direction Parallel lines P0 + tD, P1 + tD intersect at P

Computing vanishing lines ground plane Properties l is intersection of horizontal plane through C with image 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

Is this parachuter higher or lower than the person taking this picture? Lower—he is below the horizon

Fun with vanishing points

Perspective cues

Perspective cues

Perspective cues

Comparing heights Vanishing Point

Measuring height 5.4 1 2 3 4 5 Camera height 3.3 2.8

Computing vanishing points (from lines) 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: http://www-2.cs.cmu.edu/~ph/869/www/notes/vanishing.txt q2 q1 p2 p1 Intersect p1q1 with p2q2

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

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

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

vanishing line (horizon) Measuring height vz r vanishing line (horizon) t0 t H vx v vy H R b0 b image cross ratio

vanishing line (horizon) Measuring height vz r t0 vanishing line (horizon) t0 b0 vx v vy m0 t1 b1 b What if the point on the ground plane b0 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 b0 as shown above

Computing (X,Y,Z) coordinates Okay, we know how to compute height (Z coords) how can we compute X, Y? Answer: exact same idea as before, but substitute X for Z (e.g., need a reference object with known X coordinates)

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 = vx (X vanishing point) Z 3 Y 2 , similarly, 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

Courtesy of Bruce Culbertson, HP Labs Chromaglyphs Courtesy of Bruce Culbertson, HP Labs http://www.hpl.hp.com/personal/Bruce_Culbertson/ibr98/chromagl.htm

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

Direct linear calibration Can solve for mij 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: http://www.intel.com/research/mrl/research/opencv/ Matlab version by Jean-Yves Bouget: http://www.vision.caltech.edu/bouguetj/calib_doc/index.html Zhengyou Zhang’s web site: http://research.microsoft.com/~zhang/Calib/

Some Related Techniques Image-Based Modeling and Photo Editing Mok et al., SIGGRAPH 2001 http://graphics.csail.mit.edu/ibedit/ Single View Modeling of Free-Form Scenes Zhang et al., CVPR 2001 http://grail.cs.washington.edu/projects/svm/ Tour Into The Picture Anjyo et al., SIGGRAPH 1997 http://koigakubo.hitachi.co.jp/little/DL_TipE.html