Università La Sapienza Rome, Italy Scan matching in the Hough domain Andrea Censi, Luca Iocchi, Giorgio Grisetti dis.uniroma1.it

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

Epipolar Geometry.
RGB-D object recognition and localization with clutter and occlusions Federico Tombari, Samuele Salti, Luigi Di Stefano Computer Vision Lab – University.
Mapping: Scaling Rotation Translation Warp
Vision Based Control Motion Matt Baker Kevin VanDyke.
Using Perception for mobile robot. 2D ranging for mobile robot.
1 Observers Data Only Fault Detection Bo Wahlberg Automatic Control Lab & ACCESS KTH, SWEDEN André C. Bittencourt Department of Automatic Control UFSC,
Lecture 8: Stereo.
Physics-based Illuminant Color Estimation as an Image Semantics Clue Christian Riess Elli Angelopoulou Pattern Recognition Lab (Computer Science 5) University.
Uncertainty Representation. Gaussian Distribution variance Standard deviation.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
A Versatile Depalletizer of Boxes Based on Range Imagery Dimitrios Katsoulas*, Lothar Bergen*, Lambis Tassakos** *University of Freiburg **Inos Automation-software.
Localization of Piled Boxes by Means of the Hough Transform Dimitrios Katsoulas Institute for Pattern Recognition and Image Processing University of Freiburg.
Sam Pfister, Stergios Roumeliotis, Joel Burdick
CENG 789 – Digital Geometry Processing 06- Rigid-Body Alignment Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
Robotic Mapping: A Survey Sebastian Thrun, 2002 Presentation by David Black-Schaffer and Kristof Richmond.
Iterative closest point algorithms
A Study of Approaches for Object Recognition
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Computing motion between images
Multiple-view Reconstruction from Points and Lines
(1) Feature-point matching by D.J.Duff for CompVis Online: Feature Point Matching Detection, Extraction.
Weighted Range Sensor Matching Algorithms for Mobile Robot Displacement Estimation Sam Pfister, Kristo Kriechbaum, Stergios Roumeliotis, Joel Burdick Mechanical.
Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.
Lecture 6: Feature matching and alignment CS4670: Computer Vision Noah Snavely.
Review Rong Jin. Comparison of Different Classification Models  The goal of all classifiers Predicating class label y for an input x Estimate p(y|x)
ROBOT MAPPING AND EKF SLAM
CSE 185 Introduction to Computer Vision
Lecture 11 Stereo Reconstruction I Lecture 11 Stereo Reconstruction I Mata kuliah: T Computer Vision Tahun: 2010.
Lecture 12 Stereo Reconstruction II Lecture 12 Stereo Reconstruction II Mata kuliah: T Computer Vision Tahun: 2010.
Similarity measuress Laboratory of Image Analysis for Computer Vision and Multimedia Università di Modena e Reggio Emilia,
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
Segmentation Course web page: vision.cis.udel.edu/~cv May 7, 2003  Lecture 31.
Simultaneous Localization and Mapping Presented by Lihan He Apr. 21, 2006.
Mapping and Localization with RFID Technology Matthai Philipose, Kenneth P Fishkin, Dieter Fox, Dirk Hahnel, Wolfram Burgard Presenter: Aniket Shah.
Object Detection 01 – Advance Hough Transformation JJCAO.
Metrology 1.Perspective distortion. 2.Depth is lost.
Generalized Hough Transform
A Frequency-Domain Approach to Registration Estimation in 3-D Space Phillip Curtis Pierre Payeur Vision, Imaging, Video and Autonomous Systems Research.
General ideas to communicate Show one particular Example of localization based on vertical lines. Camera Projections Example of Jacobian to find solution.
Lec 22: Stereo CS4670 / 5670: Computer Vision Kavita Bala.
Peter Henry1, Michael Krainin1, Evan Herbst1,
Edge Detection and Geometric Primitive Extraction Jinxiang Chai.
October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.
Distinctive Image Features from Scale-Invariant Keypoints
Stereo Vision Local Map Alignment for Robot Environment Mapping Computer Vision Center Dept. Ciències de la Computació UAB Ricardo Toledo Morales (CVC)
776 Computer Vision Jan-Michael Frahm Spring 2012.
CENG 789 – Digital Geometry Processing 07- Rigid-Body Alignment Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
Photoconsistency constraint C2 q C1 p l = 2 l = 3 Depth labels If this 3D point is visible in both cameras, pixels p and q should have similar intensities.
Announcements Final is Thursday, March 18, 10:30-12:20 –MGH 287 Sample final out today.
1 Review and Summary We have covered a LOT of material, spending more time and more detail on 2D image segmentation and analysis, but hopefully giving.
Simultaneous Multi-Line- Segment Merging for Robot Mapping using Mean Shift Clustering Rolf Lakaemper Temple University, Philadelphia,PA,USA.
Mobile Robot Localization and Mapping Using Range Sensor Data Dr. Joel Burdick, Dr. Stergios Roumeliotis, Samuel Pfister, Kristo Kriechbaum.
Correspondence and Stereopsis. Introduction Disparity – Informally: difference between two pictures – Allows us to gain a strong sense of depth Stereopsis.
Hough Transform CS 691 E Spring Outline Hough transform Homography Reading: FP Chapter 15.1 (text) Some slides from Lazebnik.
Shape2Pose: Human Centric Shape Analysis CMPT888 Vladimir G. Kim Siddhartha Chaudhuri Leonidas Guibas Thomas Funkhouser Stanford University Princeton University.
Probabilistic Robotics Bayes Filter Implementations Gaussian filters.
776 Computer Vision Jan-Michael Frahm Spring 2012.
CENG 789 – Digital Geometry Processing 08- Rigid-Body Alignment
Lecture 07 13/12/2011 Shai Avidan הבהרה: החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
Fitting: Voting and the Hough Transform
CS4670 / 5670: Computer Vision Kavita Bala Lec 27: Stereo.
Announcements Final is Thursday, March 20, 10:30-12:20pm
Object Matching Using a Locally Affine Invariant and Linear Programming Techniques - H. Li, X. Huang, L. He Ilchae Jung.
Automatic cylinder detection using Hough Transform.
Filtering Things to take away from this lecture An image as a function
Filtering An image as a function Digital vs. continuous images
Image Registration  Mapping of Evolution
Review and Importance CS 111.
Presentation transcript:

Università La Sapienza Rome, Italy Scan matching in the Hough domain Andrea Censi, Luca Iocchi, Giorgio Grisetti dis.uniroma1.it lastname SIED Lab

A. Censi, L. Iocchi, G. Grisetti2 of 16 Scan matching 2D scan matching (geometric interpretation): find a rotation  and a translation T who maximize overlapping of two sets of 2D data. 2D scan matching (probabilistic interpretation): approximate a pdf of the robot pose; ex: p(x t |x t-1, u t-1, y t, y t- 1 ) or others... Map portionSensor scan

A. Censi, L. Iocchi, G. Grisetti3 of 16 Previous research Existing methods differ by: –assumptions about environment (ex: features?) –assumptions about sensing devices (noise, FOV) –assumptions about the search domain (local vs. “global”) –representation of uncertainty (multi-hypothesis, continuous pdf) Methods performing a local search: –features based [ex: Guttman ‘96, Lingemann ‘04] –ICP family [Lu-Milios ‘94, several extensions/optimizations] –gradient-based iterative methods [ex: Hähnel ‘02, Biber ‘03] Methods performing a global search: –feature based: many [ex: us, 2002] –histogram of surface angles [ex: Weiß ‘94] –extensive search: 2D correlation [Konolige-Chou ‘99]

A. Censi, L. Iocchi, G. Grisetti4 of 16 Our approach: –works in unstructured environments and with noisy range finders (we don’t do feature “detection”, we work with features “distributions”) –global search (but if a guess is available, it performs efficient local search) and multi-modality (detects ambiguities) –completeness: if an exact match exists, it will be included in the solution set (works in practice with very different data). Algorithm. Given reference and sensor data: –compute the Hough Transform (HT) for both –compute the Hough Spectrum (HS) from the HT –find hypotheses for  via the cross-correlation of the HS –given an estimate , estimate T via cross-correlation of the HT Hough Scan Matching (HSM) andrea: decoupling andrea: decoupling

A. Censi, L. Iocchi, G. Grisetti5 of The Hough Transform (HT) The simplest HT transforms the cartesian space X-Y into the Hough Domain ( ,  ). The straight line cos(  )x+sin(  )y = r corresponds to point ( , r) in the Hough Domain. Andrea Censi: si può fare in modo formale Andrea Censi: si può fare in modo formale (x,y) cartesian plane Hough Domain ( ,  ) HT     r r

A. Censi, L. Iocchi, G. Grisetti6 of The Hough Transform (HT) A point in the cartesian plane  a sinusoid in the Hough domain Sinusoids of collinear points intersects. Andrea Censi: si può fare in modo formale Andrea Censi: si può fare in modo formale Cartesian plane (x,y). Hough Domain ( ,  )  

A. Censi, L. Iocchi, G. Grisetti7 of 16 HT   Feature detection with the HT andrea: in you algorithm andrea: in you algorithm

A. Censi, L. Iocchi, G. Grisetti8 of 16 Expressiveness of the HT HT -1 HT “features distributions”  

A. Censi, L. Iocchi, G. Grisetti9 of 16 Definition of Hough Spectrum We compute a “spectrum” from the Hough Transform (applying a translation-invariant functional g to the columns of the HT) HT HT[i] i The spectrum is a a function of  with 180° period. HS g [i] g

A. Censi, L. Iocchi, G. Grisetti10 of 16 Hough Spectrum properties it is invariant to input translation it shifts on input rotation Andrea Censi: anche alla scala Andrea Censi: anche alla scala (same spectrum) T   T

A. Censi, L. Iocchi, G. Grisetti11 of 16 HSM: finding the rotation  The spectrum of an input transformed by ( ,Tx,Ty) is shifted by  regardless of T; we can estimate  by correlating the two spectra. T  HS g [i]HS g [i’] The peaks of the cross correlation are estimates for .  +180 ° cross correlation

A. Censi, L. Iocchi, G. Grisetti12 of 16 Handling ambiguities Multi-modal global search can detect ambiguities result of correlation Input data Hough spectrum multiple hypotheses for 

A. Censi, L. Iocchi, G. Grisetti13 of 16 Comparison with circular histogram The histogram of surface angles has similar properties, but HS works with noisier data (does not need orientation information) HS can handle cases when the circular histogram fails. Example: Andrea Censi: anche alla scala Andrea Censi: anche alla scala Input data Hough spectrum histogram of surface angles result of correlation

A. Censi, L. Iocchi, G. Grisetti14 of 16 HSM: estimating T   HT |T|   HT T translation T

A. Censi, L. Iocchi, G. Grisetti15 of 16 T HSM: how to estimate T Given an estimate of , we can get linear constraints for T comparing columns of the HT (“directions of alignment”). We choose the directions with higher expected energy = peaks of the spectrum. d ~ p(T|  ) d' T linear constraints d' d

A. Censi, L. Iocchi, G. Grisetti16 of 16 Example with real data Map portionLaser scan First solution (exact) Second solution

A. Censi, L. Iocchi, G. Grisetti17 of 16 Summary Operating in the Hough space allows to decouple the search of the rotation  from the translation (3D search  3 x 1D searches ) Does not rely on the existence of features. Multi-modal and global search (efficient local search). Experimental simulation results: –Good results in curved enviroments if sensor is accurate. –Reliability to different kinds of sensor noise (except for high discretization). Future (hard) work: extension to 3D for dealing with 3D noisy sensors (stereo camera).

A. Censi, L. Iocchi, G. Grisetti18 of 16 Thanks for your attention Slides and an extended version of the paper available at censi Andrea Censi, Luca Iocchi, Giorgio Grisetti dis.uniroma1.it lastname