Distributed Robust Localization from Arbitrary Initial Poses via EM and Model Selection
|
|
- Ethel Harrington
- 5 years ago
- Views:
Transcription
1 1 Distributed Robust Localization from Arbitrary Initial Poses via EM and Model Selection Vadim Indelman Collaborators: Erik Nelson, Jing Dong, Nathan Michael and Frank Dellaert IACAS, February 15
2 Collaborative Localization and Mapping Important in a variety of scenarios Exploration in unknown/uncertain, dangerous environments Search and rescue Surveillance, tracking Cooperative inference requires Sharing relevant information (observations, marginals over variables of interest) Correct interpretation (data association) Robustness to outliers
3 3 Motivating Scenario Robots are initially unaware of each others location How to establish collaboration and perform multi-robot localization? Unknown multi-robot data association Unknown initial relative poses between robots * Slide adapted from Nelson14iser
4 4 Related Work Known data association and common reference frames Full SLAM [Howard et al. 6], [Andersson et al. 8] Pose SLAM (direct, indirect) [Roumeliotis et al. ], [Kim et al. 1], [Indelman et al. 1] Anderson et al. 8 Kim et al. 1
5 5 Related Work Known data association and common reference frames Full SLAM [Howard et al. 6], [Andersson et al. 8] Pose SLAM (direct, indirect) [Roumeliotis et al. ], [Kim et al. 1], [Indelman et al. 1] Unknown multi-robot data association and common reference frame Full SLAM [Montijano et al. 11], [Cunningham et al. 1] Montijano et al. 11
6 6 Related Work Known data association and common reference frames Full SLAM [Howard et al. 6], [Andersson et al. 8] Pose SLAM (direct, indirect) [Roumeliotis et al. ], [Kim et al. 1], [Indelman et al. 1] Unknown multi-robot data association and common reference frame Full SLAM [Montijano et al. 11], [Cunningham et al. 1] Robust graph optimization (single robot case loop closures) [Sunderhauf and Protzel 1, 13], [Latif et al. 1], [Lee et al. 13] Lee et al. 13 Latif et al. 1 Sunderhauf and Protzel 1, 13
7 7 This Work Multi-robot framework with Unknown multi-robot data association Unknown initial relative poses between robots Pose SLAM approach How to establish multi-robot data association when robots start operating from unknown locations? Outline: Batch, centralized framework Incremental, distributed framework
8 8 Multi-Robot Correspondences If no common reference frame is available, what information to share? Robots share informative observations (e.g. laser scans) Saliency is calculated based on [Nieto et al., Robot. Auton. Syst., 7]
9 9 Multi-Robot Correspondences If no common reference frame is available, what information to share? Robots share informative observations (e.g. laser scans) Calculate candidate multi-robot relative pose constraints Collect into set F Includes (many) outliers Indoor navigation Arbitrary common reference frame Ground truth 4 4 Robot 1 Robot Robot
10 1 Probabilistic Formulation 15 Notations: F : Multi-robot correspondences set J : Latent variables to indicate inliers/outliers Joint pdf over robot trajectories and multi-robot data association: p (X, J Z) / Y r p (X r Z r ) Y (r 1,r,k,l)F p j r 1,r k,l p u r 1,r k,l x r 1 k,xr l,j r 1,r k,l Only local measurements Data association Multi-robot measurement likelihood, given data association Each multi-robot correspondence
11 11 Measurement likelihood with p u r 1,r k,l x r 1 k,xr 1 l /exp err u r 1,r k,l,x r 1 k,xr l 1 5 err u r 1,r k,l,x r 1.= 5 u r 1,r k,l h (x r 1 k,xr measured 15 l ) 1 predicted 15. = x r 1 k,xr l k T r 1 r x r l Unknown!!
12 1 Y [m] Measurement likelihood with p u r 1,r k,l x r 1 k,xr 1 l /exp err u r 1,r k,l,x r 1 k,xr l 1 5 err u r 1,r k,l,x r 1.= 5 u r 1,r k,l h (x r 1 k,xr measured Unknown!! Error distribution for all correspondences: Arbitrary T r 1 Must first infer a common reference frame T r 1! uncertainty Inliers Outliers Y [m] l ) 1 predicted 15. = x r 1 k,xr l k T r 1 r x r l r Correct T r r 1 uncertainty r Inliers Outliers X [m] X [m]
13 13 Key Observation Given robot local trajectories, relative initial pose can be calculated from each candidate multi-robot correspondence Only inliers produce similar transformations Objective: identify cluster Initial relative pose between two robots (planar case: ) [synthetic data] x, y, Y [m] Y [m] Y [m] X [m] X [m] X [m] 1% outliers 4% outliers 85% outliers
14 14 Key Observation Given robot local trajectories, relative initial pose can be calculated from each candidate multi-robot correspondence Only inliers produce similar transformations Objective: identify cluster x, y, Initial relative pose between two robots (planar case: ) [real data]
15 15 Inference Over Common Reference Frame via EM 15 1 ˆX SR 5 MAP estimate of T r 1 r given robot local trajectories ( ): ˆT r 1 r = arg max T r 1 r p T r 1 r ˆX SR,Z 5 1 X = arg max p 15 T r 1 r J T r 1 r, J ˆX SR,Z J : Latent binary variables to indicate inliers/outliers EM formulation ( T =. T r 1) : r Local trajectories ˆX r = arg max p X (Xr Z r ) n r. o R = ˆXr ˆX SR r=1 ˆT (i) = arg max T X p J J ˆT (i 1), ˆX h i SR,Z log p T,J ˆX SR,Z E step M step
16 Inference Over Common Reference Frame via EM (Cont.) 16 Convergence only to local minima Therefore: T r 1 Start process from several initial guesses of r T r 1 Results in several locally-optimal hypotheses (inliers/outliers, estimated ) Which one to choose? (next) r Y [m] 5 Y [m] X [m] X [m]
17 17 Inference Over Robot Trajectories Once a common reference frame is established: Multi-robot localization becomes possible Robot trajectories can be expressed in the same frame Infer robot trajectories via EM: ˆX = arg max X X p J J ˆX,Z log p (X, J Z) Identified common reference frame is used as initial guess within measurement likelihood p u r 1,r k,l x r 1 k,xr 1 l /exp err u r 1,r k,l,x r 1 k,xr l
18 18 Results (Batch, Centralized) 15 Local trajectories; Arbitrary common reference frame 15 Indoor navigation Estimated Ground truth 4 Inliers Outliers 4 4 Robot 1 Robot Robot
19 19 Incremental Framework Challenges Multiple hypotheses How to know when to make a decision? Robot trajectories and observed environments may initially not overlap Perceptual aliasing Candidate correspondences: Arbitrary common reference frame Ground truth trajectories
20 Incremental Framework (Cont.) Choosing an incorrect hypothesis: Y [m] Hypothesis # inliers X [m]
21 1 Incremental Framework (Cont.) Approach Hypothesis model-based selection Chinese restaurant process hypothesis prior
22 Hypothesis Model-Based Selection Calculate probability of each hypothesis h H h = {I,O} p h Z, ˆX SR Inliers Outliers Explicitly: p h Z, ˆX SR 6 = c p 4 h ˆX SR p Z h, ˆX SR Measurement likelihood: Prior 4 Prioritizes hypotheses with many inliers Does not address: Y [m] Measurement likelihood Is sufficient data available to choose a hypothesis? Perceptual aliasing X [m]
23 3 Hypothesis Prior Introduce null-hypothesis corresponds to perceptual aliasing All correspondences are actually outliers Chinese restaurant process, assuming: Robots operate in closed indoor environment Eventually, will observe common places (not necessarily concurrently)
24 4 Hypothesis Prior (Cont.) Chinese restaurant process Probability of observing a new place reduces over time Use to discriminate between different hypotheses As more data comes in hypotheses priors become distinguishable Example Probability.6.4 Probability.6.4 Probability h h1 h Hypotheses h h1 h Hypotheses h h1 h Hypotheses More data
25 5 Results Inliers of chosen hypothesis Hypothesis # inliers time Result As opposed to
26 6 Results - CMU Trial T1 Trial T Trial T3
27 Results - CMU [ICRA 15] 7
28 8 Conclusions Collaborative inference from unknown initial poses and data association Key observation (clusters for inlier correspondences) EM approach to infer common reference frames and data association Once established, joint inference over robot poses Distributed and incremental framework: Challenges: How to know when to make a decision? Perceptual aliasing Model-based selection + hypothesis prior
Towards Multi-Robot Active Collaborative State Estimation via Belief Space Planning
1 Towards Multi-Robot Active Collaborative State Estimation via Belief Space Planning Vadim Indelman IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), September 2015 Introduction
More informationScalable Sparsification for Efficient Decision Making Under Uncertainty in High Dimensional State Spaces
Scalable Sparsification for Efficient Decision Making Under Uncertainty in High Dimensional State Spaces IROS 2017 KHEN ELIMELECH ROBOTICS AND AUTONOMOUS SYSTEMS PROGRAM VADIM INDELMAN DEPARTMENT OF AEROSPACE
More informationRobotics. Mobile Robotics. Marc Toussaint U Stuttgart
Robotics Mobile Robotics State estimation, Bayes filter, odometry, particle filter, Kalman filter, SLAM, joint Bayes filter, EKF SLAM, particle SLAM, graph-based SLAM Marc Toussaint U Stuttgart DARPA Grand
More informationMobile Robot Localization
Mobile Robot Localization 1 The Problem of Robot Localization Given a map of the environment, how can a robot determine its pose (planar coordinates + orientation)? Two sources of uncertainty: - observations
More informationGaussian Processes as Continuous-time Trajectory Representations: Applications in SLAM and Motion Planning
Gaussian Processes as Continuous-time Trajectory Representations: Applications in SLAM and Motion Planning Jing Dong jdong@gatech.edu 2017-06-20 License CC BY-NC-SA 3.0 Discrete time SLAM Downsides: Measurements
More informationMobile Robot Localization
Mobile Robot Localization 1 The Problem of Robot Localization Given a map of the environment, how can a robot determine its pose (planar coordinates + orientation)? Two sources of uncertainty: - observations
More informationPlanning Under Uncertainty in the Continuous Domain: a Generalized Belief Space Approach
Planning Under Uncertainty in the Continuous Domain: a Generalized Belief Space Approach Vadim Indelman, Luca Carlone, and Frank Dellaert Abstract This work investigates the problem of planning under uncertainty,
More informationLecture: Gaussian Process Regression. STAT 6474 Instructor: Hongxiao Zhu
Lecture: Gaussian Process Regression STAT 6474 Instructor: Hongxiao Zhu Motivation Reference: Marc Deisenroth s tutorial on Robot Learning. 2 Fast Learning for Autonomous Robots with Gaussian Processes
More informationL11. EKF SLAM: PART I. NA568 Mobile Robotics: Methods & Algorithms
L11. EKF SLAM: PART I NA568 Mobile Robotics: Methods & Algorithms Today s Topic EKF Feature-Based SLAM State Representation Process / Observation Models Landmark Initialization Robot-Landmark Correlation
More informationSLAM Techniques and Algorithms. Jack Collier. Canada. Recherche et développement pour la défense Canada. Defence Research and Development Canada
SLAM Techniques and Algorithms Jack Collier Defence Research and Development Canada Recherche et développement pour la défense Canada Canada Goals What will we learn Gain an appreciation for what SLAM
More informationIntroduction to Mobile Robotics Information Gain-Based Exploration. Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Giorgio Grisetti, Kai Arras
Introduction to Mobile Robotics Information Gain-Based Exploration Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Giorgio Grisetti, Kai Arras 1 Tasks of Mobile Robots mapping SLAM localization integrated
More informationUniversità di Roma La Sapienza Dipartimento di Informatica e Sistemistica. An accurate closed-form estimate of ICP s covariance
Università di Roma La Sapienza Dipartimento di Informatica e Sistemistica An accurate closed-form estimate of ICP s covariance Andrea Censi Based on the analysis of the error function. Advantages over
More informationFast Incremental Square Root Information Smoothing
Fast Incremental Square Root Information Smoothing Michael Kaess, Ananth Ranganathan, and Frank Dellaert Center for Robotics and Intelligent Machines, College of Computing Georgia Institute of Technology,
More informationAdvanced Machine Learning
Advanced Machine Learning Nonparametric Bayesian Models --Learning/Reasoning in Open Possible Worlds Eric Xing Lecture 7, August 4, 2009 Reading: Eric Xing Eric Xing @ CMU, 2006-2009 Clustering Eric Xing
More informationLecture 22: Graph-SLAM (2)
Lecture 22: Graph-SLAM (2) Dr. J.B. Hayet CENTRO DE INVESTIGACIÓN EN MATEMÁTICAS Abril 2014 J.B. Hayet Probabilistic robotics Abril 2014 1 / 35 Outline 1 Data association in Graph-SLAM 2 Improvements and
More informationAutonomous Mobile Robot Design
Autonomous Mobile Robot Design Topic: Particle Filter for Localization Dr. Kostas Alexis (CSE) These slides relied on the lectures from C. Stachniss, and the book Probabilistic Robotics from Thurn et al.
More informationActive and Semi-supervised Kernel Classification
Active and Semi-supervised Kernel Classification Zoubin Ghahramani Gatsby Computational Neuroscience Unit University College London Work done in collaboration with Xiaojin Zhu (CMU), John Lafferty (CMU),
More informationSensor Localization and Target Estimation in Visual Sensor Networks
Annual Schedule of my Research Sensor Localization and Target Estimation in Visual Sensor Networks Survey and Problem Settings Presented in the FL seminar on May th First Trial and Evaluation of Proposed
More informationThe Particle Filter. PD Dr. Rudolph Triebel Computer Vision Group. Machine Learning for Computer Vision
The Particle Filter Non-parametric implementation of Bayes filter Represents the belief (posterior) random state samples. by a set of This representation is approximate. Can represent distributions that
More informationExpectation Maximization
Expectation Maximization Bishop PRML Ch. 9 Alireza Ghane c Ghane/Mori 4 6 8 4 6 8 4 6 8 4 6 8 5 5 5 5 5 5 4 6 8 4 4 6 8 4 5 5 5 5 5 5 µ, Σ) α f Learningscale is slightly Parameters is slightly larger larger
More informationUsing the Kalman Filter for SLAM AIMS 2015
Using the Kalman Filter for SLAM AIMS 2015 Contents Trivial Kinematics Rapid sweep over localisation and mapping (components of SLAM) Basic EKF Feature Based SLAM Feature types and representations Implementation
More informationAdvanced Techniques for Mobile Robotics Least Squares. Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz
Advanced Techniques for Mobile Robotics Least Squares Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz Problem Given a system described by a set of n observation functions {f i (x)} i=1:n
More informationRobot Mapping. Least Squares. Cyrill Stachniss
Robot Mapping Least Squares Cyrill Stachniss 1 Three Main SLAM Paradigms Kalman filter Particle filter Graphbased least squares approach to SLAM 2 Least Squares in General Approach for computing a solution
More informationAccelerated Appearance-Only SLAM
Accelerated Appearance-Only SLAM Mark Cummins and Paul Newman Oxford University Mobile Robotics Research Group. {mjc,pnewman}@robots.ox.ac.uk Abstract This paper describes a probabilistic bail-out condition
More informationExperimental Design and Data Analysis for Biologists
Experimental Design and Data Analysis for Biologists Gerry P. Quinn Monash University Michael J. Keough University of Melbourne CAMBRIDGE UNIVERSITY PRESS Contents Preface page xv I I Introduction 1 1.1
More informationA Probabilistic Relational Model for Characterizing Situations in Dynamic Multi-Agent Systems
A Probabilistic Relational Model for Characterizing Situations in Dynamic Multi-Agent Systems Daniel Meyer-Delius 1, Christian Plagemann 1, Georg von Wichert 2, Wendelin Feiten 2, Gisbert Lawitzky 2, and
More informationExact State and Covariance Sub-matrix Recovery for Submap Based Sparse EIF SLAM Algorithm
8 IEEE International Conference on Robotics and Automation Pasadena, CA, USA, May 19-3, 8 Exact State and Covariance Sub-matrix Recovery for Submap Based Sparse EIF SLAM Algorithm Shoudong Huang, Zhan
More informationRobotics 2 Least Squares Estimation. Giorgio Grisetti, Cyrill Stachniss, Kai Arras, Maren Bennewitz, Wolfram Burgard
Robotics 2 Least Squares Estimation Giorgio Grisetti, Cyrill Stachniss, Kai Arras, Maren Bennewitz, Wolfram Burgard Problem Given a system described by a set of n observation functions {f i (x)} i=1:n
More informationVision-Aided Navigation Based on Three-View Geometry
Vision-Aided Navigation Based on hree-view Geometry Vadim Indelman, Pini Gurfil Distributed Space Systems Lab, Aerospace Engineering, echnion Ehud Rivlin Computer Science, echnion Hector Rotstein RAFAEL
More informationParametric Unsupervised Learning Expectation Maximization (EM) Lecture 20.a
Parametric Unsupervised Learning Expectation Maximization (EM) Lecture 20.a Some slides are due to Christopher Bishop Limitations of K-means Hard assignments of data points to clusters small shift of a
More informationSimultaneous Localization and Mapping
Simultaneous Localization and Mapping Miroslav Kulich Intelligent and Mobile Robotics Group Czech Institute of Informatics, Robotics and Cybernetics Czech Technical University in Prague Winter semester
More informationLatent Variable Models
Latent Variable Models Stefano Ermon, Aditya Grover Stanford University Lecture 5 Stefano Ermon, Aditya Grover (AI Lab) Deep Generative Models Lecture 5 1 / 31 Recap of last lecture 1 Autoregressive models:
More informationIntroduction to Mobile Robotics Bayes Filter Particle Filter and Monte Carlo Localization
Introduction to Mobile Robotics Bayes Filter Particle Filter and Monte Carlo Localization Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Kai Arras 1 Motivation Recall: Discrete filter Discretize the
More informationLinear Dynamical Systems
Linear Dynamical Systems Sargur N. srihari@cedar.buffalo.edu Machine Learning Course: http://www.cedar.buffalo.edu/~srihari/cse574/index.html Two Models Described by Same Graph Latent variables Observations
More informationPosterior Regularization
Posterior Regularization 1 Introduction One of the key challenges in probabilistic structured learning, is the intractability of the posterior distribution, for fast inference. There are numerous methods
More informationComputer Vision Group Prof. Daniel Cremers. 6. Mixture Models and Expectation-Maximization
Prof. Daniel Cremers 6. Mixture Models and Expectation-Maximization Motivation Often the introduction of latent (unobserved) random variables into a model can help to express complex (marginal) distributions
More informationSociology 6Z03 Review II
Sociology 6Z03 Review II John Fox McMaster University Fall 2016 John Fox (McMaster University) Sociology 6Z03 Review II Fall 2016 1 / 35 Outline: Review II Probability Part I Sampling Distributions Probability
More informationIntroduction to Mobile Robotics SLAM: Simultaneous Localization and Mapping
Introduction to Mobile Robotics SLAM: Simultaneous Localization and Mapping Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz What is SLAM? Estimate the pose of a robot and the map of the environment
More informationSample Size and Power I: Binary Outcomes. James Ware, PhD Harvard School of Public Health Boston, MA
Sample Size and Power I: Binary Outcomes James Ware, PhD Harvard School of Public Health Boston, MA Sample Size and Power Principles: Sample size calculations are an essential part of study design Consider
More informationQuantitative Introduction ro Risk and Uncertainty in Business Module 5: Hypothesis Testing
Quantitative Introduction ro Risk and Uncertainty in Business Module 5: Hypothesis Testing M. Vidyasagar Cecil & Ida Green Chair The University of Texas at Dallas Email: M.Vidyasagar@utdallas.edu October
More informationClassification CE-717: Machine Learning Sharif University of Technology. M. Soleymani Fall 2012
Classification CE-717: Machine Learning Sharif University of Technology M. Soleymani Fall 2012 Topics Discriminant functions Logistic regression Perceptron Generative models Generative vs. discriminative
More informationDynamic Data Modeling, Recognition, and Synthesis. Rui Zhao Thesis Defense Advisor: Professor Qiang Ji
Dynamic Data Modeling, Recognition, and Synthesis Rui Zhao Thesis Defense Advisor: Professor Qiang Ji Contents Introduction Related Work Dynamic Data Modeling & Analysis Temporal localization Insufficient
More informationModeling and state estimation Examples State estimation Probabilities Bayes filter Particle filter. Modeling. CSC752 Autonomous Robotic Systems
Modeling CSC752 Autonomous Robotic Systems Ubbo Visser Department of Computer Science University of Miami February 21, 2017 Outline 1 Modeling and state estimation 2 Examples 3 State estimation 4 Probabilities
More informationLocalization. Howie Choset Adapted from slides by Humphrey Hu, Trevor Decker, and Brad Neuman
Localization Howie Choset Adapted from slides by Humphrey Hu, Trevor Decker, and Brad Neuman Localization General robotic task Where am I? Techniques generalize to many estimation tasks System parameter
More informationStatistical Inference
Statistical Inference Classical and Bayesian Methods Class 6 AMS-UCSC Thu 26, 2012 Winter 2012. Session 1 (Class 6) AMS-132/206 Thu 26, 2012 1 / 15 Topics Topics We will talk about... 1 Hypothesis testing
More informationImproving the Consistency of Nonlinear Estimators: Analysis, Algorithms, and Applications
Improving the Consistency of Nonlinear Estimators: Analysis, Algorithms, and Applications A DISSERTATION SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Guoquan Huang
More informationMethod 1: Geometric Error Optimization
Method 1: Geometric Error Optimization we need to encode the constraints ŷ i F ˆx i = 0, rank F = 2 idea: reconstruct 3D point via equivalent projection matrices and use reprojection error equivalent projection
More informationCMU-Q Lecture 24:
CMU-Q 15-381 Lecture 24: Supervised Learning 2 Teacher: Gianni A. Di Caro SUPERVISED LEARNING Hypotheses space Hypothesis function Labeled Given Errors Performance criteria Given a collection of input
More informationPartially Observable Markov Decision Processes (POMDPs)
Partially Observable Markov Decision Processes (POMDPs) Sachin Patil Guest Lecture: CS287 Advanced Robotics Slides adapted from Pieter Abbeel, Alex Lee Outline Introduction to POMDPs Locally Optimal Solutions
More informationUncertainty and Rules
Uncertainty and Rules We have already seen that expert systems can operate within the realm of uncertainty. There are several sources of uncertainty in rules: Uncertainty related to individual rules Uncertainty
More informationShort Note: Naive Bayes Classifiers and Permanence of Ratios
Short Note: Naive Bayes Classifiers and Permanence of Ratios Julián M. Ortiz (jmo1@ualberta.ca) Department of Civil & Environmental Engineering University of Alberta Abstract The assumption of permanence
More informationBen Pence Scott Moura. December 12, 2009
Ben Pence Scott Moura EECS 558 Project December 12, 2009 SLIDE 1of 24 Stochastic system with unknown parameters Want to identify the parameters Adapt the control based on the parameter estimate Identifiability
More informationClustering K-means. Machine Learning CSE546. Sham Kakade University of Washington. November 15, Review: PCA Start: unsupervised learning
Clustering K-means Machine Learning CSE546 Sham Kakade University of Washington November 15, 2016 1 Announcements: Project Milestones due date passed. HW3 due on Monday It ll be collaborative HW2 grades
More informationKalman filtering and friends: Inference in time series models. Herke van Hoof slides mostly by Michael Rubinstein
Kalman filtering and friends: Inference in time series models Herke van Hoof slides mostly by Michael Rubinstein Problem overview Goal Estimate most probable state at time k using measurement up to time
More informationClustering K-means. Clustering images. Machine Learning CSE546 Carlos Guestrin University of Washington. November 4, 2014.
Clustering K-means Machine Learning CSE546 Carlos Guestrin University of Washington November 4, 2014 1 Clustering images Set of Images [Goldberger et al.] 2 1 K-means Randomly initialize k centers µ (0)
More informationStreamlining Missing Data Analysis by Aggregating Multiple Imputations at the Data Level
Streamlining Missing Data Analysis by Aggregating Multiple Imputations at the Data Level A Monte Carlo Simulation to Test the Tenability of the SuperMatrix Approach Kyle M Lang Quantitative Psychology
More informationIntroduction to Bayesian methods in inverse problems
Introduction to Bayesian methods in inverse problems Ville Kolehmainen 1 1 Department of Applied Physics, University of Eastern Finland, Kuopio, Finland March 4 2013 Manchester, UK. Contents Introduction
More informationPerformance Comparison of K-Means and Expectation Maximization with Gaussian Mixture Models for Clustering EE6540 Final Project
Performance Comparison of K-Means and Expectation Maximization with Gaussian Mixture Models for Clustering EE6540 Final Project Devin Cornell & Sushruth Sastry May 2015 1 Abstract In this article, we explore
More informationIntroduction to Graphical Models
Introduction to Graphical Models The 15 th Winter School of Statistical Physics POSCO International Center & POSTECH, Pohang 2018. 1. 9 (Tue.) Yung-Kyun Noh GENERALIZATION FOR PREDICTION 2 Probabilistic
More informationc 2011 Devin Ashish Bonnie
c 2011 Devin Ashish Bonnie PROBABILISTIC SEARCH: A BAYESIAN APPROACH IN A CONTINUOUS WORKSPACE BY DEVIN ASHISH BONNIE THESIS Submitted in partial fulfillment of the requirements for the degree of Master
More informationLecture 5: Bayes pt. 1
Lecture 5: Bayes pt. 1 D. Jason Koskinen koskinen@nbi.ku.dk Photo by Howard Jackman University of Copenhagen Advanced Methods in Applied Statistics Feb - Apr 2016 Niels Bohr Institute 2 Bayes Probabilities
More information2D Image Processing. Bayes filter implementation: Kalman filter
2D Image Processing Bayes filter implementation: Kalman filter Prof. Didier Stricker Kaiserlautern University http://ags.cs.uni-kl.de/ DFKI Deutsches Forschungszentrum für Künstliche Intelligenz http://av.dfki.de
More informationBios 6649: Clinical Trials - Statistical Design and Monitoring
Bios 6649: Clinical Trials - Statistical Design and Monitoring Spring Semester 2015 John M. Kittelson Department of Biostatistics & nformatics Colorado School of Public Health University of Colorado Denver
More information10-701/15-781, Machine Learning: Homework 4
10-701/15-781, Machine Learning: Homewor 4 Aarti Singh Carnegie Mellon University ˆ The assignment is due at 10:30 am beginning of class on Mon, Nov 15, 2010. ˆ Separate you answers into five parts, one
More informationGWAS V: Gaussian processes
GWAS V: Gaussian processes Dr. Oliver Stegle Christoh Lippert Prof. Dr. Karsten Borgwardt Max-Planck-Institutes Tübingen, Germany Tübingen Summer 2011 Oliver Stegle GWAS V: Gaussian processes Summer 2011
More informationProbabilistic Graphical Models Homework 2: Due February 24, 2014 at 4 pm
Probabilistic Graphical Models 10-708 Homework 2: Due February 24, 2014 at 4 pm Directions. This homework assignment covers the material presented in Lectures 4-8. You must complete all four problems to
More informationUnit Roots and Structural Breaks in Panels: Does the Model Specification Matter?
18th World IMACS / MODSIM Congress, Cairns, Australia 13-17 July 2009 http://mssanz.org.au/modsim09 Unit Roots and Structural Breaks in Panels: Does the Model Specification Matter? Felix Chan 1 and Laurent
More informationOutline. Supervised Learning. Hong Chang. Institute of Computing Technology, Chinese Academy of Sciences. Machine Learning Methods (Fall 2012)
Outline Hong Chang Institute of Computing Technology, Chinese Academy of Sciences Machine Learning Methods (Fall 2012) Outline Outline I 1 Linear Models for Regression Linear Regression Probabilistic Interpretation
More informationClustering non-stationary data streams and its applications
Clustering non-stationary data streams and its applications Amr Abdullatif DIBRIS, University of Genoa, Italy amr.abdullatif@unige.it June 22th, 2016 Outline Introduction 1 Introduction 2 3 4 INTRODUCTION
More informationA decentralized Polynomial based SLAM algorithm for a team of mobile robots
Preprints of the 19th World Congress The International Federation of Automatic Control A decentralized Polynomial based SLAM algorithm for a team of mobile robots Luigi D Alfonso, Antonio Grano, Pietro
More informationIncremental Sparse GP Regression for Continuous-time Trajectory Estimation & Mapping
Incremental Sparse GP Regression for Continuous-time Trajectory Estimation & Mapping Xinyan Yan College of Computing Georgia Institute of Technology Atlanta, GA 30332, USA xinyan.yan@cc.gatech.edu Vadim
More informationMachine Learning. Regression. Manfred Huber
Machine Learning Regression Manfred Huber 2015 1 Regression Regression refers to supervised learning problems where the target output is one or more continuous values Continuous output values imply that
More informationIntroduction to Statistical Inference
Structural Health Monitoring Using Statistical Pattern Recognition Introduction to Statistical Inference Presented by Charles R. Farrar, Ph.D., P.E. Outline Introduce statistical decision making for Structural
More informationLecture 15. Probabilistic Models on Graph
Lecture 15. Probabilistic Models on Graph Prof. Alan Yuille Spring 2014 1 Introduction We discuss how to define probabilistic models that use richly structured probability distributions and describe how
More informationCheng Soon Ong & Christian Walder. Canberra February June 2018
Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 218 Outlines Overview Introduction Linear Algebra Probability Linear Regression 1
More informationLEARNING WITH BAYESIAN NETWORKS
LEARNING WITH BAYESIAN NETWORKS Author: David Heckerman Presented by: Dilan Kiley Adapted from slides by: Yan Zhang - 2006, Jeremy Gould 2013, Chip Galusha -2014 Jeremy Gould 2013Chip Galus May 6th, 2016
More informationOutline. Binomial, Multinomial, Normal, Beta, Dirichlet. Posterior mean, MAP, credible interval, posterior distribution
Outline A short review on Bayesian analysis. Binomial, Multinomial, Normal, Beta, Dirichlet Posterior mean, MAP, credible interval, posterior distribution Gibbs sampling Revisit the Gaussian mixture model
More informationCSCI-567: Machine Learning (Spring 2019)
CSCI-567: Machine Learning (Spring 2019) Prof. Victor Adamchik U of Southern California Mar. 19, 2019 March 19, 2019 1 / 43 Administration March 19, 2019 2 / 43 Administration TA3 is due this week March
More informationToward Online Probabilistic Path Replanning
Toward Online Probabilistic Path Replanning R. Philippsen 1 B. Jensen 2 R. Siegwart 3 1 LAAS-CNRS, France 2 Singleton Technology, Switzerland 3 ASL-EPFL, Switzerland Workshop on Autonomous Robot Motion,
More informationStatistics Boot Camp. Dr. Stephanie Lane Institute for Defense Analyses DATAWorks 2018
Statistics Boot Camp Dr. Stephanie Lane Institute for Defense Analyses DATAWorks 2018 March 21, 2018 Outline of boot camp Summarizing and simplifying data Point and interval estimation Foundations of statistical
More informationIntroduction to Machine Learning. Maximum Likelihood and Bayesian Inference. Lecturers: Eran Halperin, Yishay Mansour, Lior Wolf
1 Introduction to Machine Learning Maximum Likelihood and Bayesian Inference Lecturers: Eran Halperin, Yishay Mansour, Lior Wolf 2013-14 We know that X ~ B(n,p), but we do not know p. We get a random sample
More informationCentral Bank of Chile October 29-31, 2013 Bruce Hansen (University of Wisconsin) Structural Breaks October 29-31, / 91. Bruce E.
Forecasting Lecture 3 Structural Breaks Central Bank of Chile October 29-31, 2013 Bruce Hansen (University of Wisconsin) Structural Breaks October 29-31, 2013 1 / 91 Bruce E. Hansen Organization Detection
More informationGaussian Mixture Models
Gaussian Mixture Models Pradeep Ravikumar Co-instructor: Manuela Veloso Machine Learning 10-701 Some slides courtesy of Eric Xing, Carlos Guestrin (One) bad case for K- means Clusters may overlap Some
More informationProbabilistic Graphical Models for Image Analysis - Lecture 1
Probabilistic Graphical Models for Image Analysis - Lecture 1 Alexey Gronskiy, Stefan Bauer 21 September 2018 Max Planck ETH Center for Learning Systems Overview 1. Motivation - Why Graphical Models 2.
More informationFinal Exam, Fall 2002
15-781 Final Exam, Fall 22 1. Write your name and your andrew email address below. Name: Andrew ID: 2. There should be 17 pages in this exam (excluding this cover sheet). 3. If you need more room to work
More informationAccelerated MRI Image Reconstruction
IMAGING DATA EVALUATION AND ANALYTICS LAB (IDEAL) CS5540: Computational Techniques for Analyzing Clinical Data Lecture 15: Accelerated MRI Image Reconstruction Ashish Raj, PhD Image Data Evaluation and
More informationUniformly Most Powerful Bayesian Tests and Standards for Statistical Evidence
Uniformly Most Powerful Bayesian Tests and Standards for Statistical Evidence Valen E. Johnson Texas A&M University February 27, 2014 Valen E. Johnson Texas A&M University Uniformly most powerful Bayes
More informationAccelerating the EM Algorithm for Mixture Density Estimation
Accelerating the EM Algorithm ICERM Workshop September 4, 2015 Slide 1/18 Accelerating the EM Algorithm for Mixture Density Estimation Homer Walker Mathematical Sciences Department Worcester Polytechnic
More informationCHAPTER 10 Comparing Two Populations or Groups
CHAPTER 10 Comparing Two Populations or Groups 10. Comparing Two Means The Practice of Statistics, 5th Edition Starnes, Tabor, Yates, Moore Bedford Freeman Worth Publishers Comparing Two Means Learning
More informationCHAPTER 10 Comparing Two Populations or Groups
CHAPTER 10 Comparing Two Populations or Groups 10.2 Comparing Two Means The Practice of Statistics, 5th Edition Starnes, Tabor, Yates, Moore Bedford Freeman Worth Publishers Comparing Two Means Learning
More informationProbabilistic Fundamentals in Robotics. DAUIN Politecnico di Torino July 2010
Probabilistic Fundamentals in Robotics Probabilistic Models of Mobile Robots Robotic mapping Basilio Bona DAUIN Politecnico di Torino July 2010 Course Outline Basic mathematical framework Probabilistic
More informationSpatial Normalized Gamma Process
Spatial Normalized Gamma Process Vinayak Rao Yee Whye Teh Presented at NIPS 2009 Discussion and Slides by Eric Wang June 23, 2010 Outline Introduction Motivation The Gamma Process Spatial Normalized Gamma
More informationTSRT14: Sensor Fusion Lecture 9
TSRT14: Sensor Fusion Lecture 9 Simultaneous localization and mapping (SLAM) Gustaf Hendeby gustaf.hendeby@liu.se TSRT14 Lecture 9 Gustaf Hendeby Spring 2018 1 / 28 Le 9: simultaneous localization and
More informationExpectation Propagation in Dynamical Systems
Expectation Propagation in Dynamical Systems Marc Peter Deisenroth Joint Work with Shakir Mohamed (UBC) August 10, 2012 Marc Deisenroth (TU Darmstadt) EP in Dynamical Systems 1 Motivation Figure : Complex
More informationBayesian Machine Learning - Lecture 7
Bayesian Machine Learning - Lecture 7 Guido Sanguinetti Institute for Adaptive and Neural Computation School of Informatics University of Edinburgh gsanguin@inf.ed.ac.uk March 4, 2015 Today s lecture 1
More information12 : Variational Inference I
10-708: Probabilistic Graphical Models, Spring 2015 12 : Variational Inference I Lecturer: Eric P. Xing Scribes: Fattaneh Jabbari, Eric Lei, Evan Shapiro 1 Introduction Probabilistic inference is one of
More informationMarkov Models. CS 188: Artificial Intelligence Fall Example. Mini-Forward Algorithm. Stationary Distributions.
CS 88: Artificial Intelligence Fall 27 Lecture 2: HMMs /6/27 Markov Models A Markov model is a chain-structured BN Each node is identically distributed (stationarity) Value of X at a given time is called
More informationMedical Question Answering for Clinical Decision Support
Medical Question Answering for Clinical Decision Support Travis R. Goodwin and Sanda M. Harabagiu The University of Texas at Dallas Human Language Technology Research Institute http://www.hlt.utdallas.edu
More informationMachine Learning and Bayesian Inference. Unsupervised learning. Can we find regularity in data without the aid of labels?
Machine Learning and Bayesian Inference Dr Sean Holden Computer Laboratory, Room FC6 Telephone extension 6372 Email: sbh11@cl.cam.ac.uk www.cl.cam.ac.uk/ sbh11/ Unsupervised learning Can we find regularity
More information2D Image Processing. Bayes filter implementation: Kalman filter
2D Image Processing Bayes filter implementation: Kalman filter Prof. Didier Stricker Dr. Gabriele Bleser Kaiserlautern University http://ags.cs.uni-kl.de/ DFKI Deutsches Forschungszentrum für Künstliche
More information