CoreTracking: an efficient approach to clustering moving targets and tracking clusters
暂无分享,去创建一个
[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.