Sequential Inference for Evolving Groups of Objects 2012-07-19 이범진 Biointelligence Lab Seoul National University.

Slides:



Advertisements
Similar presentations
Discussion for SAMSI Tracking session, 8 th September 2008 Simon Godsill Signal Processing and Communications Lab. University of Cambridge www-sigproc.eng.cam.ac.uk/~sjg.
Advertisements

Bayesian Belief Propagation
Motivating Markov Chain Monte Carlo for Multiple Target Tracking
State Estimation and Kalman Filtering CS B659 Spring 2013 Kris Hauser.
A Hierarchical Multiple Target Tracking Algorithm for Sensor Networks Songhwai Oh and Shankar Sastry EECS, Berkeley Nest Retreat, Jan
IR Lab, 16th Oct 2007 Zeyn Saigol
Visual Tracking CMPUT 615 Nilanjan Ray. What is Visual Tracking Following objects through image sequences or videos Sometimes we need to track a single.
Oklahoma State University Generative Graphical Models for Maneuvering Object Tracking and Dynamics Analysis Xin Fan and Guoliang Fan Visual Computing and.
PHD Approach for Multi-target Tracking
Probabilistic reasoning over time So far, we’ve mostly dealt with episodic environments –One exception: games with multiple moves In particular, the Bayesian.
TOWARD DYNAMIC GRASP ACQUISITION: THE G-SLAM PROBLEM Li (Emma) Zhang and Jeff Trinkle Department of Computer Science, Rensselaer Polytechnic Institute.
Motion Tracking. Image Processing and Computer Vision: 82 Introduction Finding how objects have moved in an image sequence Movement in space Movement.
Autonomous Robot Navigation Panos Trahanias ΗΥ475 Fall 2007.
Particle Filters Pieter Abbeel UC Berkeley EECS Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics TexPoint fonts used in EMF. Read.
Introduction to Kalman Filter and SLAM Ting-Wei Hsu 08/10/30.
CS 547: Sensing and Planning in Robotics Gaurav S. Sukhatme Computer Science Robotic Embedded Systems Laboratory University of Southern California
Sérgio Pequito Phd Student
SLAM: Simultaneous Localization and Mapping: Part I Chang Young Kim These slides are based on: Probabilistic Robotics, S. Thrun, W. Burgard, D. Fox, MIT.
Probabilistic Robotics
Particle filters (continued…). Recall Particle filters –Track state sequence x i given the measurements ( y 0, y 1, …., y i ) –Non-linear dynamics –Non-linear.
Bootstrap in Finance Esther Ruiz and Maria Rosa Nieto (A. Rodríguez, J. Romo and L. Pascual) Department of Statistics UNIVERSIDAD CARLOS III DE MADRID.
Particle Filters for Mobile Robot Localization 11/24/2006 Aliakbar Gorji Roborics Instructor: Dr. Shiri Amirkabir University of Technology.
Probabilistic Robotics Introduction Probabilities Bayes rule Bayes filters.
Today Introduction to MCMC Particle filters and MCMC
Probabilistic Robotics
Comparative survey on non linear filtering methods : the quantization and the particle filtering approaches Afef SELLAMI Chang Young Kim.
Optimal Filtering of Jump Diffusions: Extracting Latent States from Asset Prices Jonathan Stroud, Wharton, U. Pennsylvania Stern-Wharton Conference on.
Particle Filtering for Non- Linear/Non-Gaussian System Bohyung Han
Probabilistic Robotics Bayes Filter Implementations Gaussian filters.
Sampling Methods for Estimation: An Introduction
Novel approach to nonlinear/non- Gaussian Bayesian state estimation N.J Gordon, D.J. Salmond and A.F.M. Smith Presenter: Tri Tran
Bayesian Filtering for Robot Localization
Introduction to Monte Carlo Methods D.J.C. Mackay.
Markov Localization & Bayes Filtering
From Bayesian Filtering to Particle Filters Dieter Fox University of Washington Joint work with W. Burgard, F. Dellaert, C. Kwok, S. Thrun.
SIS Sequential Importance Sampling Advanced Methods In Simulation Winter 2009 Presented by: Chen Bukay, Ella Pemov, Amit Dvash.
Simultaneous Localization and Mapping Presented by Lihan He Apr. 21, 2006.
Probabilistic Robotics Bayes Filter Implementations Gaussian filters.
1 Robot Environment Interaction Environment perception provides information about the environment’s state, and it tends to increase the robot’s knowledge.
Probabilistic Robotics Bayes Filter Implementations.
National Taiwan University Graduate Institute of Electronics Engineering National Taiwan University Graduate Institute of Electronics Engineering A CCESS.
Overview Particle filtering is a sequential Monte Carlo methodology in which the relevant probability distributions are iteratively estimated using the.
Particle Filters.
Karman filter and attitude estimation Lin Zhong ELEC424, Fall 2010.
Forward-Scan Sonar Tomographic Reconstruction PHD Filter Multiple Target Tracking Bayesian Multiple Target Tracking in Forward Scan Sonar.
Dynamic Bayesian Networks and Particle Filtering COMPSCI 276 (chapter 15, Russel and Norvig) 2007.
The Hardware Design of the Humanoid Robot RO-PE and the Self-localization Algorithm in RoboCup Tian Bo Control and Mechatronics Lab Mechanical Engineering.
Mobile Robot Localization (ch. 7)
Processing Sequential Sensor Data The “John Krumm perspective” Thomas Plötz November 29 th, 2011.
State Estimation and Kalman Filtering
Boosted Particle Filter: Multitarget Detection and Tracking Fayin Li.
Sequential Monte-Carlo Method -Introduction, implementation and application Fan, Xin
OBJECT TRACKING USING PARTICLE FILTERS. Table of Contents Tracking Tracking Tracking as a probabilistic inference problem Tracking as a probabilistic.
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION Kalman Filter with Process Noise Gauss- Markov.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Reestimation Equations Continuous Distributions.
Markov Networks: Theory and Applications Ying Wu Electrical Engineering and Computer Science Northwestern University Evanston, IL 60208
Particle filters for Robot Localization An implementation of Bayes Filtering Markov Localization.
Particle Filtering for Geometric Active Contours
Probabilistic Robotics
Markov ó Kalman Filter Localization
Course: Autonomous Machine Learning
Probabilistic Reasoning Over Time
Visual Tracking CMPUT 615 Nilanjan Ray.
Particle filters for Robot Localization
Introduction to the Particle Filter Computer Practical
6.891 Computer Experiments for Particle Filtering
Biointelligence Laboratory, Seoul National University
MCMC Inference over Latent Diffeomorphisms
Biointelligence Laboratory, Seoul National University
Presentation transcript:

Sequential Inference for Evolving Groups of Objects 이범진 Biointelligence Lab Seoul National University

What are we going to do? Think about dynamically evolving groups of objects  Ex)  flocks of birds  Schools of fish  Group of aircraft

However... Difficulties on this research  1. recognizing groups are hard  2. incorporating new members into the groups,  Ex) splitting and merging of groups How many groups? Merging Spliting

Proposed solution Implementation rule  1. Targets themselves are dynamic  2. Targets’ grouping can change overtime  3. Assignment of a target to a group affects the probabilistic properties of the target dynamics  4. Group statistics belong to a second hidden layer, target statistics belong to the first hidden layer and the observation process usually depends only on the targets  5. Number of targets is typically unknown

Framework (1) Dynamic group tracking model G1G1 X1X1 Z1Z1 G2G2 X2X2 Z2Z2 GtGt XtXt ZtZt G t+1 X t+1 Z t+1

Framework (2) Main components of the group tracking model  1. group dynamical model :  Describes motion of members in a group   2. group structure transition model  Describes the way the group membership or group matic states X t  Markovian assumption

How do we inference? Proposed MCMC-particle algorithm

Why is it better!? No resampling is required  Particle filters use MCMC to rejuvenate degenerate samples after resampling Less computationally intensive than the MCMC- based particle filter  Because avoids numerical integration of the predictive density at every MCMC iteration Consider the general joint distribution of S t and S t-1 

How good is it?

Framework (2) Main components of the group tracking model  1. group dynamical model :  Describes motion of members in a group   2. group structure transition model  Describes the way the group membership or group matic states X t  Markovian assumption

Experiments(1) Ground target tracking  For group dynamical model(with repulsive force, virtual leader)  Use stochastic differential equations (SDEs) and Itô stochastic calculus –Using velocity, position, acceleration, restoring force, etc.  For state-dependent group structure transition model  For observation model  Using single discretized sensor model which scans a fixed rectangular region, and track-before-detect approach(TBD) otherwise

Experiments(1)

Experiments(1) result MCMC-particles algorithm is used to detect and track the group targets N burn = 1000 iteration for burn-in

Experiments(1) result cont.

Experiments(2)

Experiments(2) cont.

Experiments(2) result MCMC-particles algorithm is used to inference {G t, π t } These models can identify groupings of stock based only on their stock price behaviour

Thank you