CoreTracking: an efficient approach to clustering moving targets and tracking clusters

Detecting the activities and predicting the tendencies of large groups of targets in wide battlefields are critical inputs to formulating sound military decisions. Modern airborne radar sensors can provide wide-area surveillance coverage of battlefield ground activities. When obscured by terrain or other factors, some objects may only be detectable at intervals, generating intermittent radar data and creating difficulties for tracking groups over time. We present an algorithm, termed CoreTracking, which dynamically groups individual targets into clusters and tracks the clusters over time. Most traditional clustering techniques are static-object-oriented. We propose a "core member" concept to support dynamic-object-oriented clustering and to mitigate the effects of data intermittence. Observing the movement of the core cluster members, we can track the clusters across frames and predict their future movements. The performance and results of applying the CoreTracking algorithm to CASTFOREM data sets is also presented.

[1]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[2]  Tian Zhang,et al.  BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.

[3]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[4]  Samuel S. Blackman,et al.  Multiple-Target Tracking with Radar Applications , 1986 .

[5]  Vipin Kumar,et al.  Chameleon: Hierarchical Clustering Using Dynamic Modeling , 1999, Computer.

[6]  Sudipto Guha,et al.  CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.

[7]  Peter J. Rousseeuw,et al.  Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .

[8]  Erwin Taenzer Tracking Multiple Targets Simultaneously with a Phased Array Radar , 1980, IEEE Transactions on Aerospace and Electronic Systems.

[9]  George Karypis,et al.  C HAMELEON : A Hierarchical Clustering Algorithm Using Dynamic Modeling , 1999 .

[10]  Amir Averbuch,et al.  Interacting Multiple Model Methods in Target Tracking: A Survey , 1988 .

[11]  Dimitri P. Bertsekas,et al.  A forward/reverse auction algorithm for asymmetric assignment problems , 1992, Comput. Optim. Appl..

[12]  Lawrence D. Stone,et al.  Bayesian Multiple Target Tracking , 1999 .

[13]  Henk A. P. Blom,et al.  Joint probabilistic data association methods avoiding track coalescence , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[14]  Daniel A. Keim,et al.  An Efficient Approach to Clustering in Large Multimedia Databases with Noise , 1998, KDD.

[15]  Hans-Peter Kriegel,et al.  OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.