Stereo Vision Local Map Alignment for Robot Environment Mapping Computer Vision Center Dept. Ciències de la Computació UAB Ricardo Toledo Morales (CVC)

Slides:



Advertisements
Similar presentations
Feature Detection. Description Localization More Points Robust to occlusion Works with less texture More Repeatable Robust detection Precise localization.
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.
Presented by Xinyu Chang
RGB-D object recognition and localization with clutter and occlusions Federico Tombari, Samuele Salti, Luigi Di Stefano Computer Vision Lab – University.
Feature Matching and Robust Fitting Computer Vision CS 143, Brown James Hays Acknowledgment: Many slides from Derek Hoiem and Grauman&Leibe 2008 AAAI Tutorial.
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
Image and video descriptors
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
IBBT – Ugent – Telin – IPI Dimitri Van Cauwelaert A study of the 2D - SIFT algorithm Dimitri Van Cauwelaert.
3-D Depth Reconstruction from a Single Still Image 何開暘
A Study of Approaches for Object Recognition
Distinctive image features from scale-invariant keypoints. David G. Lowe, Int. Journal of Computer Vision, 60, 2 (2004), pp Presented by: Shalomi.
Scale Invariant Feature Transform (SIFT)
CS664 Lecture #19: Layers, RANSAC, panoramas, epipolar geometry Some material taken from:  David Lowe, UBC  Jiri Matas, CMP Prague
1 Invariant Local Feature for Object Recognition Presented by Wyman 2/05/2006.
Lecture 6: Feature matching and alignment CS4670: Computer Vision Noah Snavely.
Statistical Color Models (SCM) Kyungnam Kim. Contents Introduction Trivariate Gaussian model Chromaticity models –Fixed planar chromaticity models –Zhu.
The 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems October 11-15, 2009 St. Louis, USA.
Computer vision: models, learning and inference
CSE 185 Introduction to Computer Vision
Distinctive Image Features from Scale-Invariant Keypoints By David G. Lowe, University of British Columbia Presented by: Tim Havinga, Joël van Neerbos.
Computer vision.
Final Exam Review CS485/685 Computer Vision Prof. Bebis.
Lecture 12 Stereo Reconstruction II Lecture 12 Stereo Reconstruction II Mata kuliah: T Computer Vision Tahun: 2010.
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.
SPIE'01CIRL-JHU1 Dynamic Composition of Tracking Primitives for Interactive Vision-Guided Navigation D. Burschka and G. Hager Computational Interaction.
Characterizing activity in video shots based on salient points Nicolas Moënne-Loccoz Viper group Computer vision & multimedia laboratory University of.
Local invariant features Cordelia Schmid INRIA, Grenoble.
3D SLAM for Omni-directional Camera
MESA LAB Multi-view image stitching Guimei Zhang MESA LAB MESA (Mechatronics, Embedded Systems and Automation) LAB School of Engineering, University of.
Lecture 4: Feature matching CS4670 / 5670: Computer Vision Noah Snavely.
Feature-Based Stereo Matching Using Graph Cuts Gorkem Saygili, Laurens van der Maaten, Emile A. Hendriks ASCI Conference 2011.
Ray Divergence-Based Bundle Adjustment Conditioning for Multi-View Stereo Mauricio Hess-Flores 1, Daniel Knoblauch 2, Mark A. Duchaineau 3, Kenneth I.
Computer Vision 776 Jan-Michael Frahm 12/05/2011 Many slides from Derek Hoiem, James Hays.
A Region Based Stereo Matching Algorithm Using Cooperative Optimization Zeng-Fu Wang, Zhi-Gang Zheng University of Science and Technology of China Computer.
© 2005 Martin Bujňák, Martin Bujňák Supervisor : RNDr.
Lec 22: Stereo CS4670 / 5670: Computer Vision Kavita Bala.
Computer Vision : CISC 4/689 Going Back a little Cameras.ppt.
Computer Vision Lecture #10 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department, Ain Shams University, Cairo, Egypt 2 Electerical.
Local invariant features Cordelia Schmid INRIA, Grenoble.
1 Research Question  Can a vision-based mobile robot  with limited computation and memory,  and rapidly varying camera positions,  operate autonomously.
Vision and SLAM Ingeniería de Sistemas Integrados Departamento de Tecnología Electrónica Universidad de Málaga (Spain) Acción Integrada –’Visual-based.
Autonomous Robots Vision © Manfred Huber 2014.
Overview Introduction to local features Harris interest points + SSD, ZNCC, SIFT Scale & affine invariant interest point detectors Evaluation and comparison.
Computer Vision - Fitting and Alignment (Slides borrowed from various presentations)
Features, Feature descriptors, Matching Jana Kosecka George Mason University.
CSE 185 Introduction to Computer Vision Feature Matching.
3D Reconstruction Using Image Sequence
776 Computer Vision Jan-Michael Frahm Spring 2012.
Instructor: Mircea Nicolescu Lecture 10 CS 485 / 685 Computer Vision.
CSE 185 Introduction to Computer Vision Local Invariant Features.
COS 429 PS3: Stitching a Panorama Due November 10 th.
Recognizing specific objects Matching with SIFT Original suggestion Lowe, 1999,2004.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
Correspondence and Stereopsis. Introduction Disparity – Informally: difference between two pictures – Allows us to gain a strong sense of depth Stereopsis.
SIFT.
776 Computer Vision Jan-Michael Frahm Spring 2012.
SIFT Scale-Invariant Feature Transform David Lowe
Paper – Stephen Se, David Lowe, Jim Little
CS4670 / 5670: Computer Vision Kavita Bala Lec 27: Stereo.
Feature description and matching
Homography From Wikipedia In the field of computer vision, any
A segmentation and tracking algorithm
CSDD Features: Center-Surround Distribution Distance
Binocular Stereo Vision
SIFT.
CSE 185 Introduction to Computer Vision
Recognition and Matching based on local invariant features
Presentation transcript:

Stereo Vision Local Map Alignment for Robot Environment Mapping Computer Vision Center Dept. Ciències de la Computació UAB Ricardo Toledo Morales (CVC) David Aldavert Miró (CVC)

Introduction Data association problem: –Put into correspondence robot sensor measurements obtained from different locations. Different approaches: –Cox –IDC –ICP –Correlation of histograms –Normal Distributions Transform

Introduction Using visual features: –Extract image features: Harris Laplace/Affine, Hessian Laplace/Affine, MSER, SURF, IBR, EBR,... –Characterize local features: SIFT, GLOH, RIFT, PCA-SIFT, Shape Context, Steerable Filters,... –Put features into correspondence: Distance between descriptors, Hough, RANSAC,... –Estimate robot motion from features correspondences.

Introduction Using visual features:

Introduction Using visual features in indoor environments: –Matching difficulties: Depth discontinuities. Lack of texture. Repetitive texture.

Local stereo maps Local obstacle maps from dense stereo: Dense disparity map Right image Left image ReconstructionProjection to the X-Z plane

Map alignment Build a PDF of the obstacles: –At each obstacles it is assigned a Gaussian distribution G(μ, σ) where: μ is the location of the obstacle. σ obtained from the covariance matrix of the stereo point reconstruction.

Map alignment Using a Gauss-Newton approach to search the robot motion parameters p = [α, t x, t y ] that minimizes the following energy function: As wrapping both PDF will be very computational expensive, only image points corresponding to obstacles of PD 2 are taking into account in the matching process.

Map alignment Example:

Enhancing map alignment Color obstacles: –Add image properties to the obstacle maps to improve matching ratio and avoid ambiguities. –We used a simple color image segmentation method: Change from RGB to HSV space. Select points that have a significant color information: –Saturation * value = difference between the max and min RGB channel. Assign pixel to a different channel depending on its hue. RedGreenBlueRed

Enhancing map alignment Color obstacles: –For example:

Enhancing map alignment Example: avoiding ambiguities using color

Results Alignment results:

Results Ratio of correctly aligned maps: Increasing noise

Conclusions The method can align two different local maps without performing explicit matching between obstacles. The addition of color helps to increase the convergence ratio and solves some ambiguities. The method is quite sensitive to the presence of outliers, specially when they are not uniformly distributed. A more robust color segmentation could increase the overall method performance. Even when two local maps are aligned using the environment structure, this is not enough to determine if both maps are really related. Additional knowledge that also takes into account environment appearance should help to avoid this ambiguities.

Conclusions Thank you for your attention!