Adaptive Neuro-Fuzzy Inference System in Fuzzy Measurement to Track Association
Bibliographic record
Abstract
The main issue in a surveillance environment is the target tracking. The most important concern in this problem is the association of the various measurements with the existing target tracks. The fuzzy c-means data association (FCMDA) algorithm, based on the fuzzy c-means (FCM) algorithm, is an efficient solution for the problem of measurement to track association in a multisensor multitarget environment. It has a high accuracy in measurement to track association when targets are far from each other. However, its accuracy remains low when targets are close to one another. The FCMDA algorithm performance is usually lost in this environment, especially when measurement noise is high. In the FCMDA algorithm, the association between measurements and tracks is determined using an optimal membership function derived from the FCM algorithm for the fixed predicted state of targets. The prediction of the target state deviates from its correct value based on updating the tracker/filter with the wrong associated measurement. Consequently, the wrong association can take place using a deviated prediction of target state in the FCMDA algorithm. In this paper, to overcome this shortcoming of the FCMDA algorithm, the predicted state of every target in a surveillance environment is compensated for the effect of wrong associated measurement by an adaptive neurofuzzy inference system (ANFIS). An ANFIS has both the advantages of expert knowledge of a fuzzy inference system and the learning capability of neural networks. So a trained ANFIS is able to compensate the effect of a wrong associated measurement on the prediction of target state. Using the compensated prediction of target state in the FCMDA algorithm can always save the performance of the FCMDA algorithm and extend its domain of usage in practical applications. The simulation results demonstrate that considerable improvements in terms of accuracy and performance are achieved by using the compensated prediction of target state in the FCMDA algorithm.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".