Stereo Matching Low-Textured Survey 1.Stereo Matching-Based Low-Textured Scene Reconstruction for Autonomous Land Vehicles (ALV) Navigation 2.A Robust.

Slides:



Advertisements
Similar presentations
Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.
Advertisements

3D Model Matching with Viewpoint-Invariant Patches(VIP) Reporter :鄒嘉恆 Date : 10/06/2009.
Efficient High-Resolution Stereo Matching using Local Plane Sweeps Sudipta N. Sinha, Daniel Scharstein, Richard CVPR 2014 Yongho Shin.
A Novel Approach of Assisting the Visually Impaired to Navigate Path and Avoiding Obstacle-Collisions.
Stereo Vision Reading: Chapter 11
Gratuitous Picture US Naval Artillery Rangefinder from World War I (1918)!!
Multiresolution stereo image matching using complex wavelets Julian Magarey CRC for Sensor Signal and Information Processing Anthony Dick Dept of Computer.
M.S. Student, Hee-Jong Hong
Real-Time Accurate Stereo Matching using Modified Two-Pass Aggregation and Winner- Take-All Guided Dynamic Programming Xuefeng Chang, Zhong Zhou, Yingjie.
Stereo Matching Segment-based Belief Propagation Iolanthe II racing in Waitemata Harbour.
Does Color Really Help in Dense Stereo Matching?
AAM based Face Tracking with Temporal Matching and Face Segmentation Dalong Du.
Image Quilting for Texture Synthesis and Transfer Alexei A. Efros1,2 William T. Freeman2.
© 2004 by Davi GeigerComputer Vision April 2004 L1.1 Binocular Stereo Left Image Right Image.
Multiple Human Objects Tracking in Crowded Scenes Yao-Te Tsai, Huang-Chia Shih, and Chung-Lin Huang Dept. of EE, NTHU International Conference on Pattern.
Computing motion between images
Stereopsis Mark Twain at Pool Table", no date, UCR Museum of Photography.
CS 223b 1 More on stereo and correspondence. CS 223b 2 =?f g Mostpopular For each window, match to closest window on epipolar line in other image. (slides.
CS 376b Introduction to Computer Vision 04 / 01 / 2008 Instructor: Michael Eckmann.
Stereo Computation using Iterative Graph-Cuts
CSE473/573 – Stereo Correspondence
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
1 Interest Operators Find “interesting” pieces of the image Multiple possible uses –image matching stereo pairs tracking in videos creating panoramas –object.
Stereo matching Class 10 Read Chapter 7 Tsukuba dataset.
Computer Vision Spring ,-685 Instructor: S. Narasimhan WH 5409 T-R 10:30am – 11:50am Lecture #15.
Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’04) /04 $20.00 c 2004 IEEE 1 Li Hong.
Joint Histogram Based Cost Aggregation For Stereo Matching Dongbo Min, Member, IEEE, Jiangbo Lu, Member, IEEE, Minh N. Do, Senior Member, IEEE IEEE TRANSACTION.
Stereo Matching Information Permeability For Stereo Matching – Cevahir Cigla and A.Aydın Alatan – Signal Processing: Image Communication, 2013 Radiometric.
A Rapid Stereo Matching Algorithm Based on Disparity Interpolation Gang Yao Yong Liu Bangjun Lei Dong Ren Institute of Intelligent Vision and Image Information.
Fast Approximate Energy Minimization via Graph Cuts
Lecture 12 Stereo Reconstruction II Lecture 12 Stereo Reconstruction II Mata kuliah: T Computer Vision Tahun: 2010.
SPIE'01CIRL-JHU1 Dynamic Composition of Tracking Primitives for Interactive Vision-Guided Navigation D. Burschka and G. Hager Computational Interaction.
A Local Adaptive Approach for Dense Stereo Matching in Architectural Scene Reconstruction C. Stentoumis 1, L. Grammatikopoulos 2, I. Kalisperakis 2, E.
Rohith MV, Gowri Somanath, Chandra Kambhamettu Video/Image Modeling and Synthesis(VIMS) Lab, Dept. of Computer and Information Sciences Cathleen Geiger.
Object Stereo- Joint Stereo Matching and Object Segmentation Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on Michael Bleyer Vienna.
By: Alex Norton Advisor: Dr. Huggins November 15, 2011
Feature-Based Stereo Matching Using Graph Cuts Gorkem Saygili, Laurens van der Maaten, Emile A. Hendriks ASCI Conference 2011.
Road Scene Analysis by Stereovision: a Robust and Quasi-Dense Approach Nicolas Hautière 1, Raphaël Labayrade 2, Mathias Perrollaz 2, Didier Aubert 2 1.
Computer Vision, Robert Pless
CS332 Visual Processing Department of Computer Science Wellesley College Binocular Stereo Vision Region-based stereo matching algorithms Properties of.
A Region Based Stereo Matching Algorithm Using Cooperative Optimization Zeng-Fu Wang, Zhi-Gang Zheng University of Science and Technology of China Computer.
1 Real-Time Stereo-Matching for Micro Air Vehicles Pascal Dufour Master Thesis Presentation.
Computer Vision Lecture #10 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department, Ain Shams University, Cairo, Egypt 2 Electerical.
Raquel A. Romano 1 Scientific Computing Seminar May 12, 2004 Projective Geometry for Computer Vision Projective Geometry for Computer Vision Raquel A.
Chapter 5 Multi-Cue 3D Model- Based Object Tracking Geoffrey Taylor Lindsay Kleeman Intelligent Robotics Research Centre (IRRC) Department of Electrical.
Saliency Aggregation: A Data- driven Approach Long Mai Yuzhen Niu Feng Liu Department of Computer Science, Portland State University Portland, OR,
Image-Based Segmentation of Indoor Corridor Floors for a Mobile Robot Yinxiao Li and Stanley T. Birchfield The Holcombe Department of Electrical and Computer.
stereo Outline : Remind class of 3d geometry Introduction
Improved Census Transforms for Resource-Optimized Stereo Vision
Jeong Kanghun CRV (Computer & Robot Vision) Lab..
Efficient Stereo Matching Based on a New Confidence Metric
3D Reconstruction Using Image Sequence
Line Matching Jonghee Park GIST CV-Lab..  Lines –Fundamental feature in many computer vision fields 3D reconstruction, SLAM, motion estimation –Useful.
Correspondence and Stereopsis Original notes by W. Correa. Figures from [Forsyth & Ponce] and [Trucco & Verri]
Media Processor Lab. Media Processor Lab. Trellis-based Parallel Stereo Matching Media Processor Lab. Sejong univ.
Stereo Video 1. Temporally Consistent Disparity Maps from Uncalibrated Stereo Videos 2. Real-time Spatiotemporal Stereo Matching Using the Dual-Cross-Bilateral.
Center for Machine Perception Department of Cybernetics Faculty of Electrical Engineering Czech Technical University in Prague Segmentation Based Multi-View.
1 Shape Descriptors for Maximally Stable Extremal Regions Per-Erik Forss´en and David G. Lowe Department of Computer Science University of British Columbia.
Energy minimization Another global approach to improve quality of correspondences Assumption: disparities vary (mostly) smoothly Minimize energy function:
Correspondence and Stereopsis. Introduction Disparity – Informally: difference between two pictures – Allows us to gain a strong sense of depth Stereopsis.
A Plane-Based Approach to Mondrian Stereo Matching
Computational Vision CSCI 363, Fall 2016 Lecture 15 Stereopsis
Semi-Global Matching with self-adjusting penalties
Fast Preprocessing for Robust Face Sketch Synthesis
SoC and FPGA Oriented High-quality Stereo Vision System
Binocular Stereo Vision
Detection of salient points
Edge Detection Using ICA
HALO-FREE DESIGN FOR RETINEX BASED REAL-TIME VIDEO ENHANCEMENT SYSTEM
Image Registration  Mapping of Evolution
Presentation transcript:

Stereo Matching Low-Textured Survey 1.Stereo Matching-Based Low-Textured Scene Reconstruction for Autonomous Land Vehicles (ALV) Navigation 2.A Robust Stereo Matching Method for Low Texture Stereo Images 1

Outline Introduction Proposed Paper 1 Proposed Paper 2 Conclusion Result 2

Introduction Low-textured – Matching costs of the stereo pairs are almost similar. In low-textured regions – Local algorithms are guaranteed to fail. – Global algorithms are too time-consuming. 3

Introduction Solution of Local Approach – Bigger window size. Low-textured regions are larger than the size of the aggregation window. 4

Introduction The size of aggregation windows should be – large enough to include intensity variation. – small enough to avoid disparity variation. An adaptive method for selecting the optimal aggregation window for stereo pairs. 5

Introduction Low computation time and high quality of disparity map. Different strategies are applied in the well- textured and low-textured regions. 6

Introduction 7

Outline Introduction Proposed Paper 1 – Proposed Method – Texture Detection – Approaches Proposed Paper 2 Conclusion Result 8

Stereo Matching-Based Low-Textured Scene Reconstruction for Autonomous Land Vehicles (ALV) Navigation Image Analysis and Signal Processing (IASP), 2011 International Conference on Mechatronics & Automation School, National University of Defense Technology, Changsha, Hunan, China Tingbo Hu Tao Wu Hangen He 9

Proposed Method Local algorithms are used to matching the pixels in well-textured regions. A new matching algorithm combining plane priors and pixel dissimilarity is designed for the low-textured regions. 10

Proposed Method In low-textured regions, the intensities of the pixels are almost identical. – Material and the Normal Vectors are consistent. 11

Proposed Method A low-textured region is likely to correspond to a 3D plane. 12

Texture Detection. 13

Approach - Local In the well-textured regions – Moravec Normalized Cross Correlation (MNCC) 14

Approach - Plane In the low-textured regions 15

Approaches. Low textured Well textured 16

Disparity Map 17

Outline Introduction Proposed Paper 1 Proposed Paper 2 – Proposed Method – Edge Detection – Aggregation Conclusion Result 18

A Robust Stereo Matching Method for Low Texture Stereo Images Computing and Communication Technologies, RIVF '09. International Conference on Department of Information Media Technology Faculty of Information Science and Technology, Tokai University Le Thanh SACH Kiyoaki ATSUTA Kazuhiko HAMAMOTO Shozo KONDO 19

Proposed Method Utilizes the edge maps computed from the stereo pairs to guide the cost aggregation. 20

Proposed Method 21

Edge Detection 22

Edge Map 23

Edge Detection 24

Aggregation Horizontal Aggregation 25

Aggregation Vertical Aggregation 26

Conclusion Different strategies are applied in different kinds of regions. The computational complexity of Paper 2 cost aggregation method is independent of the window size. 27

Result 28