Srikumar Ramalingam Department of Computer Science University of California, Santa Cruz 3D Reconstruction from a Pair of Images.

Slides:



Advertisements
Similar presentations
Zhengyou Zhang Vision Technology Group Microsoft Research
Advertisements

Feature Based Image Mosaicing
Lecture 11: Two-view geometry
CSE473/573 – Stereo and Multiple View Geometry
3D reconstruction.
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
Two-view geometry.
Camera calibration and epipolar geometry
Structure from motion.
Computer Vision : CISC 4/689
1 Interest Operators Find “interesting” pieces of the image –e.g. corners, salient regions –Focus attention of algorithms –Speed up computation Many possible.
1 Interest Operator Lectures lecture topics –Interest points 1 (Linda) interest points, descriptors, Harris corners, correlation matching –Interest points.
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
3D reconstruction of cameras and structure x i = PX i x’ i = P’X i.
Uncalibrated Epipolar - Calibration
Previously Two view geometry: epipolar geometry Stereo vision: 3D reconstruction epipolar lines Baseline O O’ epipolar plane.
Lecture 20: Two-view geometry CS6670: Computer Vision Noah Snavely.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Projected image of a cube. Classical Calibration.
CSCE 641 Computer Graphics: Image-based Modeling (Cont.) Jinxiang Chai.
May 2004Stereo1 Introduction to Computer Vision CS / ECE 181B Tuesday, May 11, 2004  Multiple view geometry and stereo  Handout #6 available (check with.
CSE473/573 – Stereo Correspondence
CSCE 641 Computer Graphics: Image-based Modeling (Cont.) Jinxiang Chai.
1 Interest Operators Find “interesting” pieces of the image Multiple possible uses –image matching stereo pairs tracking in videos creating panoramas –object.
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.
Multi-view geometry. Multi-view geometry problems Structure: Given projections of the same 3D point in two or more images, compute the 3D coordinates.
Automatic Camera Calibration
Epipolar Geometry and Stereo Vision Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 03/05/15 Many slides adapted from Lana Lazebnik,
Computer vision: models, learning and inference
Lecture 11 Stereo Reconstruction I Lecture 11 Stereo Reconstruction I Mata kuliah: T Computer Vision Tahun: 2010.
Epipolar Geometry and Stereo Vision Computer Vision ECE 5554 Virginia Tech Devi Parikh 10/15/13 These slides have been borrowed from Derek Hoiem and Kristen.
Multi-view geometry.
1 Interest Operators Harris Corner Detector: the first and most basic interest operator Kadir Entropy Detector and its use in object recognition SIFT interest.
Recognition and Matching based on local invariant features Cordelia Schmid INRIA, Grenoble David Lowe Univ. of British Columbia.
1 Preview At least two views are required to access the depth of a scene point and in turn to reconstruct scene structure Multiple views can be obtained.
Projective cameras Motivation Elements of Projective Geometry Projective structure from motion Planches : –
Lecture 04 22/11/2011 Shai Avidan הבהרה : החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
CSCE 643 Computer Vision: Structure from Motion
Multiview Geometry and Stereopsis. Inputs: two images of a scene (taken from 2 viewpoints). Output: Depth map. Inputs: multiple images of a scene. Output:
Acquiring 3D models of objects via a robotic stereo head David Virasinghe Department of Computer Science University of Adelaide Supervisors: Mike Brooks.
© 2005 Martin Bujňák, Martin Bujňák Supervisor : RNDr.
Lec 22: Stereo CS4670 / 5670: Computer Vision Kavita Bala.
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.
Affine Structure from Motion
Two-view geometry. Epipolar Plane – plane containing baseline (1D family) Epipoles = intersections of baseline with image planes = projections of the.
Feature Matching. Feature Space Outlier Rejection.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
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
3D Reconstruction Using Image Sequence
MASKS © 2004 Invitation to 3D vision Uncalibrated Camera Chapter 6 Reconstruction from Two Uncalibrated Views Modified by L A Rønningen Oct 2008.
Structure from motion Multi-view geometry Affine structure from motion Projective structure from motion Planches : –
EECS 274 Computer Vision Projective Structure from Motion.
Lec 26: Fundamental Matrix CS4670 / 5670: Computer Vision Kavita Bala.
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
Think-Pair-Share What visual or physiological cues help us to perceive 3D shape and depth?
Approximate Models for Fast and Accurate Epipolar Geometry Estimation
Epipolar geometry.
CSE 455 – Guest Lectures 3 lectures Contact Interest points 1
Uncalibrated Geometry & Stratification
Noah Snavely.
Two-view geometry.
Two-view geometry.
Multi-view geometry.
Recognition and Matching based on local invariant features
Presentation transcript:

Srikumar Ramalingam Department of Computer Science University of California, Santa Cruz 3D Reconstruction from a Pair of Images

- Problem Definition - Previous Work - Solution - Experiments and Results - Conclusion and Future work Overview

Problem Definition Image-1 Image-2 3D Texture-Mapped Model Perspective View of the Model

Previous Work -Zhao, Aggarwal, Mandal and Vemuri, “3D Shape Reconstruction from Multiple Views ”, Handbook of Image and Video Processing, pages , Al Bovik, Gang Xu and Zhengyou Zhang, “Epipolar Geometry in Stereo, Motion and Object Recognition”, Kluwer Academic Publishers, Zhang and Faugeras, “3D Dyanamic Scene Analysis-A Stereo Based Approach”, Springer-Verlag, Zhang, Deriche, Faugeras and Luong, “A Robust Technique for Matching Two Uncalibrated Images through the Recovery of the Unknown Epipolar Geometry”, INRIA Research Report, Zhang, “A New Multistage Approach to Motion and Structure Estimation: From Essential Parameters to Euclidean Motion Via Fundamental Matrix”, INRIA Research Report, 1996.

Previous Work Zhang, “Determining the Epipolar Geometry and its Uncertainity: A Review”, INRIA Research Report, July Zhang, “A Flexible New Technique for Camera Calibration”, Technical Report, Microsoft Research, Deriche and Giraudon, “A Computational Approach for Corner and Vertex Detection”, INRIA Research Report, 1992.

Solution -Feature Detection -Getting Initial Set of Matches -Medium Robust Correspondence -Strong Robust Correspondence -Camera Calibration -3D Reconstruction

Feature Detection : Harris Corner Detection

Establishing Initial Set of Matches

Ambiguities in the Matches

Robust 1-1 Correspondence -Medium Robust Matches -Relaxation Techniques -Strong Robust Matches -Epipolar Geometry

Relaxation Techniques

- Winner-take-all - Loser-take-nothing - Some-winners-take-all - ( 1 – Max_Strength / Sec_Max_St) Relaxation Strategies End Result : No Ambiguities but False Matches

-Epipolar Geometry and Constraint -Least Median of Squares Strong Robust Estimation using Epipolar Geometry

Epipolar Geometry Fundamental Matrix (F) –3x3 matrix, which relates the corresponding points Point corresponding to m lies on its epipolar line l m on the other image

Least Median of Squares – Removal of Outliers - 8 Matches required for estimating F matrix - Different combinations (m) of 8 matches selected - Least median of squares algorithm is applied If r i < Threshold, the match is discarded.

3D Reconstruction Problem is solved for Conventional Baseline Stereo System X = b (xl+xr) / (2d) Y = b (yl+yr) / (2d) Z = bf / d

Intrinsic Parameters (5) Extrinsic Parameters (6) f – focal length3 rotational parameters, 3 translational parameters u0, v0 – Center Intrinsic Matrix(A) ku - unit length along x direction kv – unit length along y direction Angle between x and y direction m new (u,v) = A m old (x,y) Need to conduct an experiment to calibrate the camera Intrinsic and Extrinsic Parameters

3D Reconstruction- Triangulation Robust Correspondence + Intrinsic Parameters  Extrinsic Parameters Robust Correspondence + Camera Parameters -  3D Points Camera Matrix Extrinsic Parameters

Reconstructed 3D Model

Implementaton Pipeline Matlab Implementations -Harris Corner Detection Algorithm (Deriche1992, Zhang1994) -Initial Set of Matches Establishment (Zhang1994, Xu1996) -Medium Set of Matches using Relaxation Techniques (Zhang1994, Xu1996) -Strong Set of Matches using Epipolar Geometry (Zhang1994, Xu1996) -Camera Calibration Experiment (Zhang1998) -3D Points Reconstruction from Robust Matches and Camera Parameters (Zhang1994, Zhang1996, Xu1996) -3D Polygonal Model Reconstruction (Delaunay Triangulation) - Texture Mapping (OpenGL/C)

Standard Data Sets- Corner marked

Robust 1-1 Correspondence shown

Color Coding for Z Coordinates after 3D Reconstruction

3D Delaunay Triangulation

3D Texture Mapped Model – On Rotation

Real Data Sets and Results Baskin Engineering Parking Scene – Two Images

Feature Points using Corner Detection process

Robust Set of Matches

Color Coding for Z Coordinates after 3D Reconstruction Red-Max, Green – Intermediate, Blue – Min depths

3D Delaunay Triangulation

Texture Mapped 3D Model of the Scene Perspective View of the Texture Mapped 3D Model

Camera Calibration Experiment -Checker pattern -3 images taken in different orientations -Corners are marked -Computation of camera parameters

Conclusion and Future Work -Increasing the number of feature points - Multiple Images - Alternate Algorithms - 3D Reconstruction of Urban Scenes (Faugeras 1995) - Registration within GIS Data

Questions?