Split and merge data association filter for dense multi-target tracking

被引:34
作者
Genovesio, A [1 ]
Olivo-Marin, JC [1 ]
机构
[1] Inst Pasteur, Quantitat Image Anal Unit, F-75015 Paris, France
来源
PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 4 | 2004年
关键词
D O I
10.1109/ICPR.2004.1333863
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Bayesian target tracking methods consist in filtering successive measurements coming from a detector In the presence of clutter or multiple targets, the filter must be coupled with an association procedure. Classical Bayesian multi-target tracking methods rely on the hypothesis that a target can generate at most one measurement per scan and that a measurement originates from at most one target. When tracking a high number of deformable sources, the previous assumptions are often not met, leading existing methods to fail. Here, we propose an algorithm which allows to perform the tracking in the cases when a single target generates several measurements or several targets generate a single measurement. The novel idea presented in this paper is the introduction of a set that we call virtual measurement set which supersedes and extends the set of measurements. This set is chosen to optimally fit the set of predicted measurements at each time step. This is done in two stages : i) a set of feasible joint association events is built from virtual measurements that are created by successively splitting and merging real measurements; ii) the joint probability is maximized over all feasible joint association events. The method has been tested on microscopy image sequences which typically contains densely moving objects and gives satisfactory preliminary results.
引用
收藏
页码:677 / 680
页数:4
相关论文
共 13 条
[1]   A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking [J].
Arulampalam, MS ;
Maskell, S ;
Gordon, N ;
Clapp, T .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2002, 50 (02) :174-188
[2]  
Bar-Shalom Y., 1988, Tracking and Data Association
[3]  
BARSHALOM Y, 2000, MULTITARGETMULTISENS, V3
[4]   THE INTERACTING MULTIPLE MODEL ALGORITHM FOR SYSTEMS WITH MARKOVIAN SWITCHING COEFFICIENTS [J].
BLOM, HAP ;
BARSHALOM, Y .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1988, 33 (08) :780-783
[5]   An efficient implementation of Reid's multiple hypothesis tracking algorithm and its evaluation for the purpose of visual tracking [J].
Cox, IJ ;
Hingorani, SL .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1996, 18 (02) :138-150
[6]  
DOUCET A, 1998, SEQUENTIAL SIMULATIO
[7]  
Fortmann T.E., 1980, P 19 IEEE C DEC CONT
[8]  
Genovesio A, 2003, IEEE IMAGE PROC, P1105
[9]   Sequential Monte Carlo methods for multiple target tracking and data fusion [J].
Hue, C ;
Le Cadre, JP ;
Pérez, P .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2002, 50 (02) :309-325
[10]   A SHORTEST AUGMENTING PATH ALGORITHM FOR DENSE AND SPARSE LINEAR ASSIGNMENT PROBLEMS [J].
JONKER, R ;
VOLGENANT, A .
COMPUTING, 1987, 38 (04) :325-340