A Two-Step Multiframe Assignment Method for Multiple Extended Target Tracking With Azimuth Ambiguity Based on Pseudo Measurement Set
Bibliographic record
Abstract
Autonomous vehicle technology uses perception modules to detect and track people and objects around autonomous vehicles. These perception modules often employ high-resolution radars for tracking due to their relatively low cost and high angle resolution. A major challenge in using high-resolution radar for advanced driver assistance systems (ADAS) or autonomous vehicles is the azimuth ambiguity and related split ambiguity for extended targets, which are caused by grating lobes due to the large physical distance between radar antenna elements relative to signal wavelength. These grating lobes give false measurements in a direction different from the target's actual direction. Due to azimuth ambiguity, data association with multiframe measurements using traditional methods is limited and generates large missed detection errors. To address this limitation, a two-step multiframe assignment method is proposed to resolve the split and azimuth ambiguity separately. In the first step, each ambiguous radar measurement (cluster) is used to generate a pseudo measurement set (PMS). Then, the split ambiguity is resolved by the PMS-to-PMS association, resulting in a merged PMS (MPMS); in the second step, the azimuth ambiguity is resolved by the Track-to-MPMS association. Simulation results indicate that the proposed method outperforms the pseudo 3-D assignment (P3DA)-PMS method in reducing false detection errors when resolving azimuth ambiguity, due to the utilization of additional frame data. The effectiveness of the proposed method in addressing azimuth ambiguity is also demonstrated using real data.
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.001 | 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.002 | 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".