Tracking multiple unresolved targets using MIMO radars
Bibliographic record
Abstract
Multiple Input Multiple Output (MIMO) radars are a new generation of radar systems that may bring about many benefits compared to traditional phased-array and multistatic radars. Although different aspects of MIMO radars have been discussed in the literature, the application of MIMO radars in target tracking problems has not been explored in depth. Target localization using MIMO radars with co-located antennas has been discussed in the literature. The main limitation of those approaches is that the number of targets that can be uniquely localized in one cell is restricted. This paper presents a new application of MIMO radars in Multi-Target Tracking (MTT) problems. The main contribution is to show that the use of prior information about the motion of targets relaxes the limitation on the number of targets that can be uniquely detected. A general MTT problem with several targets in the same resolution cell is considered. The goal is to propose a technique to estimate targets' states and the number of targets in one cell. Because multiple targets may fall in the same cell, the measurement in a cell is associated with more than one target. Measurements are outputs of matched filters and range bins that are nonlinear functions of targets' states. Multiple hypotheses are generated based on the uncertainty in target-to-cell association. Then, the best model which gives the number of new targets whose estimates are obtained by the localization algorithm, is selected according to its likelihood . Finally, due to the nonlinearity in measurement model, a UKF based method is used to update estimates of new targets and initialize new born targets. Simulation results show the superiority of the proposed method for joint localization and tracking compared to the previous localization approach suggested in the literature for unresolved targets.
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.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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.001 | 0.001 |
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".