1 / 11

Binocular Stereo Vision

Binocular Stereo Vision. Marr- Poggio - Grimson multi-resolution stereo algorithm Stereo Applications. Matching features for the MPG stereo algorithm. zero-crossings of convolution with  2 G operators of different size. L. rough disparities over large range. M.

quinn-rosa
Download Presentation

Binocular Stereo Vision

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Binocular Stereo Vision Marr-Poggio-Grimson multi-resolution stereo algorithm Stereo Applications

  2. Matching features for the MPG stereo algorithm zero-crossings of convolution with 2G operators of different size L rough disparities over large range M accurate disparities over small range S

  3. large w left large w right small w left small w right correct match outside search range at small scale

  4. large w left right vergence eye movements! small w left right correct match now inside search range at small scale

  5. Stereo images (Tsukuba, CMU)

  6. Zero-crossings for stereo matching + - … …

  7. Simplified MPG algorithm, Part 1 To determine initial correspondence: (1) Find zero-crossings using a 2G operator with central positive width w (2) For each horizontal slice: (2.1) Find the nearest neighbors in the right image for each zero-crossing fragment in the left image (2.2) Fine the nearest neighbors in the left image for each zero-crossing fragment in the right image (2.3) For each pair of zero-crossing fragments that are closest neighbors of one another, let the right fragment be separated by δinitial from the left. Determine whether δinitial is within the matching tolerance, m. If so, consider the zero-crossing fragments matched with disparity δinitial m = w/2

  8. Simplified MPG algorithm, Part 2 To determine final correspondence: (1) Find zero-crossings using a 2G operator with reduced width w/2 (2) For each horizontal slice: (2.1) For each zero-crossing in the left image: (2.1.1) Determine the nearest zero-crossing fragment in the left image that matched when the 2G operator width was w (2.1.2) Offset the zero-crossing fragment by a distance δinitial, the disparity of the nearest matching zero-crossing fragment found at the lower resolution with operator width w (2.2) Find the nearest neighbors in the right image for each zero-crossing fragment in the left image (2.3) Fine the nearest neighbors in the left image for each zero-crossing fragment in the right image (2.4) For each pair of zero-crossing fragments that are closest neighbors of one another, let the right fragment be separated by δnew from the left. Determine whether δnew is within the reduced matching tolerance, m/2. If so, consider the zero-crossing fragments matched with disparity δfinal = δnew + δinitial

  9. Coarse-scale zero-crossings: w = 8 m = 4 Use coarse-scale disparities to guide fine-scale matching: w = 4 m = 2 Ignore coarse-scale disparities: w = 4 m = 2 1-9

  10. Mars Exploration Rover Mission “Spirit” Asimo humanoid robot Robonaut to the rescue! Robotics Stereo Vision Applications Tokyo Institute of Technology Bino3 security robot

  11. Autonomous Vehicles Stanford’s “Stanley” won the 2005 DARPA Grand Challenge CMU’s “Boss” won the 2007 DARPA Urban Challenge CMU’s Lewis & Clark Using satellite stereo images to make terrain maps MIT/BWH CMU overlay system 3-D visualization for surgical guidance

More Related