A Multi-Stage Vessel Tracklet Association Method for Compact High-Frequency Surface Wave Radar
Bibliographic record
Abstract
A compact high-frequency surface wave radar, used for target detection, suffers from a low signal-to-noise ratio, low detection probability, a high false alarm rate, and low positioning accuracy; this is due to its low transmit power and the reduced aperture size of the receiving antenna array. When target tracking algorithms are applied to compact high-frequency surface wave radar data, track fragmentation often occurs and a long track may be broken into several track segments (a.k.a. tracklets), which degrade the tracking continuity for a maritime surveillance system. We present a multi-stage vessel tracklet association method, based on bidirectional prediction and optimal assignment, to associate the broken tracklets belonging to the same target, and connect them to form one continuous track in a multi-target tracking scenario. Firstly, two global motion parameters, i.e., the average heading and average speed, were, respectively, extracted from the newly initiated and terminated tracklets as features for a rough tracklet association, then k-means clustering was used to produce the preliminary tracklet pairs. Subsequently, the temporal and spatial constraints on the initiated and terminated tracklets were considered to refine the preliminary tracklet pairs, to obtain the candidate tracklet pairs. Finally, the tracklet association costs were calculated using Doppler velocity, range, and azimuth to determine the similarity between tracklets in the candidate tracklet pairs, and an association cost matrix was obtained. Then an optimal assignment method based on Jonker–Volgenant–Castanon algorithm was applied to the association matrix to achieve optimal tracklet matching by minimizing the total association costs. Tracklet association experiments with both simulated and field data were conducted; experimental results show that, compared with existing track segment association methods, the association accuracy of the proposed method is significantly improved with better tracking continuity.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".