An Assignment Method for Multiple Extended Target Tracking With Azimuth Ambiguity Based on Pseudo Measurement Set
Bibliographic record
Abstract
Autonomous vehicle technology is rapidly becoming the driving force in the automobile industry. As such, the interest in high-resolution radio detection and ranging (radar) for autonomous vehicle applications is increasing due to its affordability and high angular resolution. However, for Advanced Driver Assistance Systems (ADAS), the challenge of azimuth ambiguity caused by a large physical distance between radar antennas is prevalent. This causes false measurements in a direction different from the target’s true angle due to grating lobes. This challenge increases when extended targets are considered. This paper proposes a Pseudo-3D Assignment (P3DA) method based on a Pseudo Measurement Set (PMS) to resolve azimuth ambiguity in multiple extended target tracking. The proposed method can resolve mono (single) and split (duplicated) azimuth ambiguities common in extended target tracking. The proposed solution uses Lagrangian Relaxation based on a Flexible Search (LR-FS) algorithm to solve the P3DA-PMS problem efficiently. The performance of the proposed algorithm in a typical traffic scenario simulated in Unreal Engine 4, with an ego vehicle mounted with both 2D (unambiguous) and 3D (ambiguous) radars, is evaluated. Simulation and experiment results suggest that the proposed P3DA-PMS-based tracking algorithm can perform better than conventional methods.
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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| 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".