Track-to-Track Association for Intelligent Vehicles by Preserving Local Track Geometry
Bibliographic record
Abstract
Track-to-track association (T2TA) is a challenging task in situational awareness in intelligent vehicles and surveillance systems. In this paper, the problem of track-to-track association with sensor bias (T2TASB) is considered. Traditional T2TASB algorithms only consider a statistical distance cost between local tracks from different sensors, without exploiting the geometric relationship between one track and its neighboring ones from each sensor. However, the relative geometry among neighboring local tracks is usually stable, at least for a while, and thus helpful in improving the T2TASB. In this paper, we propose a probabilistic method, called the local track geometry preservation (LTGP) algorithm, which takes advantage of the geometry of tracks. Assuming that the local tracks of one sensor are represented by Gaussian mixture model (GMM) centroids, the corresponding local tracks of the other sensor are fitted to those of the first sensor. In this regard, a geometrical descriptor connectivity matrix is constructed to exploit the relative geometry of these tracks. The track association problem is formulated as a maximum likelihood estimation problem with a local track geometry constraint, and an expectation-maximization (EM) algorithm is developed to find the solution. Simulation results demonstrate that the proposed methods offer better performance than the state-of-the-art 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.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| 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".