/
FAB-MAP:  Probabilistic Localization and Mapping FAB-MAP:  Probabilistic Localization and Mapping

FAB-MAP: Probabilistic Localization and Mapping - PowerPoint Presentation

karlyn-bohler
karlyn-bohler . @karlyn-bohler
Follow
344 views
Uploaded On 2019-11-20

FAB-MAP: Probabilistic Localization and Mapping - PPT Presentation

FABMAP Probabilistic Localization and Mapping Mark Cummins Paul Newman Mobile Robotics Group University of Oxford UK Important features Not limited to localization Observations from new or unseen places can be detected ID: 765815

places features newman words features places words newman distribution approximate representing bayes place bag 2007 observations methods localization mark

Share:

Link:

Embed:

Download Presentation from below link

Download Presentation The PPT/PDF document "FAB-MAP: Probabilistic Localization and..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript

FAB-MAP: Probabilistic Localization and Mapping Mark Cummins Paul Newman Mobile Robotics Group, University of Oxford, UK

Important features Not limited to localization Observations from new or unseen places can be detected Basic approach inspired by bag-of-words image retrieval systems Capable of recognizing places having low features Rejecting false matches even though many features are common Reasonable computational cost for online operation

Perceptual Aliasing

Related work Ho and Newman 2007 Methods using global features: 1. Levin and Szeliski (2004); Newman et al. (2006) 2. Ulrich and Nourbakhsh (2000) 3. Torralba et al. (2003) Methods using local features: 1. Sim and Dudek (1998) 2. Wang et al. (2005) 3. Filliat (2007)

Required fundamentals Consider a distribution P(Z) with Z = { } Space needed to represent P(Z) grows exponential in n Solution: approximate by another distribution Q(Z) Kullback-Leibler divergence  

Chow Liu Trees Algorithm approximates discrete distribution by closest tree-structured Bayesian network

Description of method Representing appearance : bag-of-words Representing locations : = { } Ɗ :  

Typical words in vocabulary http:// www.acfr.usyd.edu.au/pdfs/projects/SLAM%20Summer%20School/Mark%20Cummins.pdf 8

Estimating location via Recursive Bayes ……(4) Observation likelihood To simplify : assume independence between current and past observations Make naïve Bayes assumption : Applying our assumptions and simplifying :  

New place or old place? Requires explicit calculation of Divide world into mapped places and unmapped places Approximate second summation using sampling  

Smoothing Performance of inference procedure strongly dependent on To ameliorate this problem :  

Results

Robust to repetitive environments

New College Dataset

Questions?