Download presentation

Presentation is loading. Please wait.

Published byDelilah Ficke Modified over 3 years ago

1
A Hierarchical Multiple Target Tracking Algorithm for Sensor Networks Songhwai Oh and Shankar Sastry EECS, Berkeley Nest Retreat, Jan. 2004

2
Outline Survey of Multiple Target Tracking Algorithms Tracking Multiple Objects in Sensor Networks Sensor Network Model Algorithm Overview Some Simulation Results

3
Multiple Target Tracking (MTT) Applications Surveillance, computer vision, signal processing, etc. General setup (Sittler, 1964) A varying number of indistinguishable targets Arise at random in space and time Move with continuous motions Persist for a random length of time and disappear Positions of targets are sampled at random intervals Measurements are noisy and Detection probability < 1.0 (missing observations) False alarms Goal: For each target, find its track!!!

4
MTT Algorithms Require solutions to Data association: find a partition of observations such that each element of a partition is a collection of observations generated by a single target or clutter State estimation: for each time, estimate the position of each target “Chicken-and-Egg” problem Existing Algorithms MHT (Multiple Hypothesis Tracker) JPDAF (Joint Probabilistic Data Association Filter) MTMR, PMHT, etc.

5
MHT (Multiple Hypothesis Tracker) (1) t=1 t=2 t=3 … …… Search for a hypothesis with the highest likelihood

6
MHT (2) Pros Track unknown number of targets Track initiation and termination Optimal (?) Cons Exponential complexity Heuristics: Gating, Pruning, N-scan-back, clustering Can deteriorate performance under dense environment or low detection probability Running time and memory requirement not known in advance

7
JPDAF (Joint Probabilistic Data Association Filter) A fixed number of targets At each time, weight the latest observations (y1,y2) with all known tracks (t1,t2). E.g. P(y1|t1) = P( 2|Y)+P( 3|Y) Track of a target is estimated by weighted sum of conditional expectations. E.g. E(x(t1)) = E(x(t1)|yi) P(yi|t1) More efficient than MHT But JPDAF is suboptimal and prone to make erroneous associations number of targets are fixed can’t initiate or terminate targets fa t1 t2 y1 y2 fa t1 t2 y1 y2 fa t1 t2 y1 y2 fa t1 t2 y1 y2 … P( 1|Y)P( 2|Y)P( 3|Y)P( 4|Y)

8
Hardness of Data Association Combinatorial optimization approach (e.g. MHT) NP-hard Because the multidimensional assignment problem is NP-hard Sequential Bayesian approach (e.g. JPDAF) NP-hard (at each time) Because finding permanent of 0-1 matrix is #P- complete So we can’t expect to solve a data association problem only with local information

9
MTT in Sensor Networks (Requirements) Autonomous Unknown number of targets Track initiation and termination Can’t use JPDAF, MTMR, PMHT Low computation and memory usages Can ’ t use MHT Robust against transmission failures communication delays Scalable Low communication load

10
MTT in Sensor Networks (Our Approach) Autonomous Low computation and memory usages Robust against failures and delays Scalable Low communication load MCMC data association Hierarchy Local data fusion MCMC data association Optimization algorithm (stochastic search) Solution space: constrained partitions of observations Search for a partition with maximum posterior

11
Sensor Network Model (few) Supernodes (e.g. Stargate) More computational power Longer communication range (many) Regular nodes Form a tracking group around the nearest supernode Region: 200x200 1600 nodes 4 supernodes Rt=10, Rs=5

12
Transmission Failures Assumption: A transmission failure between a pair of nodes is independent and identically distributed Transmission failures are detection failures Transmission failure vs. effective probability of detection Probability of detection = 1 (at each sensor)

13
Algorithm Overview (1)

14
Algorithm Overview (2) Fuse observations from sensing neighborhood E.g. weighted sum

15
Algorithm Overview (3) Forward fused observations to its supernode shortest-path routing Some observations get dropped or delayed

16
Algorithm Overview (4) Supernode: Attach new observations into its observation window Y Run MCMC data association on Y Exchange track information with neighboring supernodes

17
Simulation Region: 200x200 1600 nodes 4 supernodes Rt=10, Rs=5

18
Simulation

19
Simulation: Transmission Failures Average Estimation Error Average Log Posterior

20
Simulation: Communication Delays Average Estimation Error Average Log Posterior

21
Conclusions Presented a hierarchical multiple target tracking algorithm for sensor networks, i.e., Autonomous Low memory and computation requirement (predictable running time) Robust against transmission failures and communication delays Scalable Future works: Merge tracks hierarchically Find methods to reduce transmission failure rates Use a better sensor network model Test on a real sensor network

Similar presentations

OK

1 Chapter 14 Probabilistic Reasoning. 2 Outline Syntax of Bayesian networks Semantics of Bayesian networks Efficient representation of conditional distributions.

1 Chapter 14 Probabilistic Reasoning. 2 Outline Syntax of Bayesian networks Semantics of Bayesian networks Efficient representation of conditional distributions.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on air pollution for class 6 Ppt on ufo and aliens Ppt on brand marketing resume Story like ppt on parts of speech Ppt on viruses and bacteria Time management for kids ppt on batteries Edit ppt on mac Ppt on human nutrition and digestion of annelids Ppt on layers of soil Ppt on mhd power generation