Online Visual Multiple Target Tracking by Intuitionistic Fuzzy Data Association

2016 ◽  
Vol 19 (2) ◽  
pp. 355-366 ◽  
Author(s):  
Li Jun ◽  
Xie Wei-xin ◽  
Li Liang-qun
Keyword(s):  
Target Tracking ◽  
Data Association ◽  
Fuzzy Data ◽  
Multiple Target Tracking ◽  
Multiple Target ◽  
Intuitionistic Fuzzy ◽  
Intuitionistic Fuzzy Data

Modified Maximum Entropy Fuzzy Data Association Filter

2010 ◽  
Vol 132 (2) ◽  
Author(s):  
Abdolreza Dehghani Tafti ◽  
Nasser Sadati
Keyword(s):  
Target Tracking ◽  
Maximum Entropy ◽  
Fuzzy Clustering ◽  
Data Association ◽  
Computational Cost ◽  
Fuzzy Data ◽  
Multiple Target Tracking ◽  
Multiple Target ◽  
Cluttered Environment ◽  
Fuzzy Clustering Method

The problem of fuzzy data association for target tracking in a cluttered environment is discussed in this paper. In data association filters based on fuzzy clustering, the association probabilities of tracking filters are reconstructed by utilizing the fuzzy membership degree of the measurement belonging to the target. Clearly in these filters, the fuzzy clustering method has an important role; better approach causes better precision in target tracking. Recently, by using the information theory, the maximum entropy fuzzy data association filter (MEF-DAF), as a fast and efficient algorithm, is introduced in literature. In this paper, by modification of a fuzzy clustering objective function, which is prepared for using in target tracking, a modified maximum entropy fuzzy data association filter (MMEF-DAF) is proposed. The MMEF-DAF has a better performance in case of single and multiple target tracking than MEF-DAF, and the other known algorithms such as probabilistic data association filter and the hybrid fuzzy data association filter. Using Monte Carlo simulations, the superiority of the proposed algorithm in comparison with the previous ones is demonstrated. Simply, less computational cost and suitability for real-time applications are the main advantages of the proposed algorithm.

scholarly journals Statistical consistency of the data association problem in multiple target tracking

2011 ◽  
Vol 5 (0) ◽  
pp. 1227-1275 ◽  
Author(s):  
Curtis B. Storlie ◽  
Jan Hannig ◽  
Thomas C.M. Lee
Keyword(s):  
Target Tracking ◽  
Data Association ◽  
Multiple Target Tracking ◽  
Multiple Target ◽  
Statistical Consistency

scholarly journals Passive Sonar Multiple-Target Tracking with Nonlinear Doppler and Bearing Measurements Using Multiple Sensors

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Xiaohua Li ◽  
Bo Lu ◽  
Wasiq Ali ◽  
Jun Su ◽  
Haiyan Jin
Keyword(s):  
Target Tracking ◽  
Tracking System ◽  
Data Association ◽  
Measurement Data ◽  
Target Range ◽  
Multiple Target Tracking ◽  
Multiple Target ◽  
Multiple Sensors ◽  
Passive Sensors ◽  
Passive Measurements

The major advantage of the passive multiple-target tracking is that the sonars do not emit signals and thus they can remain covert, which will reduce the risk of being attacked. However, the nonlinearity of the passive Doppler and bearing measurements, the range unobservability problem, and the measurement to target data association uncertainty make the passive multiple-target tracking problem challenging. To deal with the target to measurement data association uncertainty problem from multiple sensors, this paper proposed a batch recursive extended Rauch-Tung-Striebel smoother- (RTSS-) based probabilistic multiple hypothesis tracker (PMHT) algorithm, which can effectively handle a large number of passive measurements including clutters. The recursive extended RTSS which consists of a forward filter and a backward smoothing is used to deal with the nonlinear Doppler and bearing measurements. The target range unobservability problem is avoided due to using multiple passive sensors. The simulation results show that the proposed algorithm works well in a passive multiple-target tracking system under dense clutter environment, and its computing cost is low.

scholarly journals Reinforcement Learning-Based Data Association for Multiple Target Tracking in Clutter

Sensors ◽  
2020 ◽  
Vol 20 (22) ◽  
pp. 6595
Author(s):  
Chengzhi Qu ◽  
Yan Zhang ◽  
Xin Zhang ◽  
Yang Yang
Keyword(s):  
Reinforcement Learning ◽  
Target Tracking ◽  
Nearest Neighbor ◽  
Data Association ◽  
Multiple Target Tracking ◽  
Multiple Target ◽  
Probabilistic Data ◽  
Probabilistic Data Association ◽  
Association Method ◽  
Motion Characteristics

Data association is a crucial component of multiple target tracking, in which each measurement obtained by the sensor can be determined whether it belongs to the target. However, many methods reported in the literature may not be able to ensure the accuracy and low computational complexity during the association process, especially in the presence of dense clutters. In this paper, a novel data association method based on reinforcement learning (RL), i.e., the so-called RL-JPDA method, has been proposed for solving the aforementioned problem. In the presented method, the RL is leveraged to acquire available information of measurements. In addition, the motion characteristics of the targets are utilized to ensure the accuracy of the association results. Experiments are performed to compare the proposed method with the global nearest neighbor data association method, the joint probabilistic data association method, the fuzzy optimal membership data association method and the intuitionistic fuzzy joint probabilistic data association method. The results show that the proposed method yields a shorter execution time compared to other methods. Furthermore, it can obtain an effective and feasible estimation in the environment with dense clutters.

Extended Probabilistic Data Association Algorithm

2013 ◽  
Vol 380-384 ◽  
pp. 1600-1604
Author(s):  
Wan Li Xu ◽  
Zhun Liu ◽  
Jun Hui Liu
Keyword(s):  
Target Tracking ◽  
Data Association ◽  
Experimental Results ◽  
Effective Algorithm ◽  
Multiple Target Tracking ◽  
Multiple Target ◽  
Probabilistic Data ◽  
Probabilistic Data Association ◽  
Event Based ◽  
Association Algorithm

[Purpos In order to improve the accuracy of target tracking and reduce losing rate of target in the multiple target tracking, a new algorithm called Extended Probabilistic Data Association (EPDA) is presented in this paper. [Metho This paper defines joint association event based on the number of target and puts forward the EPDA for target tracking. [Result Experimental results show that this algorithm has higher accuracy of target tracking than the Probabilistic Data Association algorithm and costs much less time relative to the Joint Probabilistic Data Association algorithm. [Conclusion Consequently, EPDA is an effective algorithm to balance the accuracy and the losing rate in target tracking.

Sign in / Sign up

Export Citation Format

Share Document