Binocular Stereo Vision

Slides:



Advertisements
Similar presentations
Gratuitous Picture US Naval Artillery Rangefinder from World War I (1918)!!
Advertisements

MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
September 10, 2013Computer Vision Lecture 3: Binary Image Processing 1Thresholding Here, the right image is created from the left image by thresholding,
Lecture 8: Stereo.
Stereo.
What happens when no correspondence is possible? Highly mismatched stereo-pairs lead to ‘binocular rivalry’ TANGENT ALERT! Open question: Can rivalry and.
December 5, 2013Computer Vision Lecture 20: Hidden Markov Models/Depth 1 Stereo Vision Due to the limited resolution of images, increasing the baseline.
Epipolar lines epipolar lines Baseline O O’ epipolar plane.
Multiple View Geometry : Computational Photography Alexei Efros, CMU, Fall 2005 © Martin Quinn …with a lot of slides stolen from Steve Seitz and.
© 2004 by Davi GeigerComputer Vision April 2004 L1.1 Binocular Stereo Left Image Right Image.
Computer Vision : CISC 4/689 Adaptation from: Prof. James M. Rehg, G.Tech.
Structure from motion. Multiple-view geometry questions Scene geometry (structure): Given 2D point matches in two or more images, where are the corresponding.
Lecture 11: Stereo and optical flow CS6670: Computer Vision Noah Snavely.
© 2006 by Davi GeigerComputer Vision April 2006 L1.1 Binocular Stereo Left Image Right Image.
© 2002 by Davi GeigerComputer Vision October 2002 L1.1 Binocular Stereo Left Image Right Image.
CSE473/573 – Stereo Correspondence
Scene planes and homographies. Homographies given the plane and vice versa.
Stereo Sebastian Thrun, Gary Bradski, Daniel Russakoff Stanford CS223B Computer Vision (with slides by James Rehg and.
COMP322/S2000/L271 Stereo Imaging Ref.V.S.Nalwa, A Guided Tour of Computer Vision, Addison Wesley, (ISBN ) Slides are adapted from CS641.
Stereo matching “Stereo matching” is the correspondence problem –For a point in Image #1, where is the corresponding point in Image #2? C1C1 C2C2 ? ? C1C1.
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.
CSE 6367 Computer Vision Stereo Reconstruction Camera Coordinate Transformations “Everything should be made as simple as possible, but not simpler.” Albert.
Computer Vision Spring ,-685 Instructor: S. Narasimhan WH 5409 T-R 10:30am – 11:50am Lecture #15.
Lecture 1: Images and image filtering CS4670/5670: Intro to Computer Vision Kavita Bala Hybrid Images, Oliva et al.,
Lecture 12 Stereo Reconstruction II Lecture 12 Stereo Reconstruction II Mata kuliah: T Computer Vision Tahun: 2010.
Epipolar geometry Epipolar Plane Baseline Epipoles Epipolar Lines
Stereo Dan Kong.
December 4, 2014Computer Vision Lecture 22: Depth 1 Stereo Vision Comparing the similar triangles PMC l and p l LC l, we get: Similarly, for PNC r and.
1 Computational Vision CSCI 363, Fall 2012 Lecture 20 Stereo, Motion.
Geometry 3: Stereo Reconstruction Introduction to Computer Vision Ronen Basri Weizmann Institute of Science.
Visibility map (high low) Surveillance with Visual Tagging and Camera Placement J. Zhao and S.-C. Cheung — Center for Visualization and Virtual Environment,
Binocular Stereo #1. Topics 1. Principle 2. binocular stereo basic equation 3. epipolar line 4. features and strategies for matching.
Computer Vision, Robert Pless
CS332 Visual Processing Department of Computer Science Wellesley College Binocular Stereo Vision Region-based stereo matching algorithms Properties of.
Lec 22: Stereo CS4670 / 5670: Computer Vision Kavita Bala.
HONGIK UNIVERSITY School of Radio Science & Communication Engineering Visual Information Processing Lab Hong-Ik University School of Radio Science & Communication.
Lecture 11 Adding Edge Element to Constraint Coarse-to-Fine Approach Optical Flow.
CSE 140: Computer Vision Camillo J. Taylor Assistant Professor CIS Dept, UPenn.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
October 19, STEREO IMAGING (continued). October 19, RIGHT IMAGE PLANE LEFT IMAGE PLANE RIGHT FOCAL POINT LEFT FOCAL POINT BASELINE d FOCAL.
Lecture 9 Feature Extraction and Motion Estimation Slides by: Michael Black Clark F. Olson Jean Ponce.
1 Computational Vision CSCI 363, Fall 2012 Lecture 16 Stereopsis.
Stereo March 8, 2007 Suggested Reading: Horn Chapter 13.
Media Processor Lab. Media Processor Lab. Trellis-based Parallel Stereo Matching Media Processor Lab. Sejong univ.
1 Computational Vision CSCI 363, Fall 2012 Lecture 18 Stereopsis III.
Computational Vision CSCI 363, Fall 2012 Lecture 17 Stereopsis II
Computational Vision CSCI 363, Fall 2016 Lecture 15 Stereopsis
CS4670 / 5670: Computer Vision Kavita Bala Lec 27: Stereo.
+ SLAM with SIFT Se, Lowe, and Little Presented by Matt Loper
STEREOPSIS The Stereopsis Problem: Fusion and Reconstruction
Geometry 3: Stereo Reconstruction
EECS 274 Computer Vision Stereopsis.
Two-view geometry.
Binocular Stereo Vision
Binocular Stereo Vision
Binocular Stereo Vision
Binocular Stereo Vision
Binocular Stereo Vision
Marr's vision: Twenty-five years on
Binocular Stereo Vision
Computer Vision Stereo Vision.
Detecting image intensity changes
Course 6 Stereo.
Marr's vision: Twenty-five years on
Chapter 11: Stereopsis Stereopsis: Fusing the pictures taken by two cameras and exploiting the difference (or disparity) between them to obtain the depth.
Binocular Stereo Vision
Detection of image intensity changes
Visual Perception: One World from Two Eyes
Computing the Stereo Matching Cost with a Convolutional Neural Network
Presentation transcript:

Binocular Stereo Vision Stereo viewing geometry and the stereo correspondence problem

Constraints on stereo correspondence Uniqueness each feature in the left image matches with only one feature in the right (and vice versa…) Similarity matching features appear “similar” in the two images Continuity nearby image features have similar simple version: matching features have similar disparities Epipolar constraint vertical positions, but…

Marr-Poggio cooperative stereo algorithm  matches corresponding black & white dots in the left & right images  stereo disparities computed by a parallel network of simple computing elements  iterative: state of network changes with each iteration, to resolve matching ambiguity disparity map emerges over time

Input x 1 1 y left right (epipolar constraint)

3D cooperative network: initial state C(x,y,d) = 1 if L(x,y) = R(x+d,y) C(x,y,d) = 0 otherwise (similarity constraint) 3D cooperative network: initial state x C(x,y,d) +3 +2 +1 -1 -2 -3 y d +3 +2 +1 -1 -2 -3 1 1 1 1 1 left right

Updating the network For each iteration, the state of every element in the 3D network is updated: (1) S(x,y,d) = Ct(x,y,d) + E – ε I (2) Ct+1(x,y,d) = 1 if S(x,y,d) ≥  = 0 if S(x,y,d) <  “inhibition” evidence for other disparities at location (x,y) support for disparity d at location (x,y) “excitation” neighborhood support for disparity d at location (x,y) current state of network (0 or 1) threshold new, updated state at time t+1

3D cooperative network x y d C(x,y,d) = 0 or 1 left right 1 1 1 1 1 +3 +2 +1 -1 -2 -3 y d +3 +2 +1 -1 -2 -3 1 1 1 C(x,y,d) = 0 or 1 1 1 left right

Enforcing the continuity constraint x 1 disparity = +2 y E = sum of 1’s in a neighborhood around (x,y) E = 10 S(x,y,d) = Ct(x,y,d) + E – ε I

3D cooperative network C(x,y,d) x y d 1 1 1 +3 +2 +1 -1 -2 -3 +3 +2 +1 -1 -2 -3 y d +3 +2 +1 -1 -2 -3 1 1 1

Enforcing the uniqueness constraint x +3 +2 +1 -1 -2 -3 1 I = total number of alternative disparities d I = 3 S(x,y,d) = Ct(x,y,d) + E – ε I

x x 1 1 y y x right left 1 initial state: C0(x,y,d) d = -1 y E =

row 3: Y = 3 I = left right x d initial state: C0(x,y,d) 1 2 3 4 5 6 7 1 2 3 4 5 6 7 1 1 left right x 1 2 3 4 5 6 7 +2 +1 -1 -2 1 Y = 3 d initial state: C0(x,y,d) I = S(x,y,d) = Ct(x,y,d) + E – ε I Ct+1(x,y,d) = (ε = 2) ( = 3)