A Track Segment Association Method Based on Heuristic Optimization Algorithm and Multistage Discrimination
Bibliographic record
Abstract
The fragmentation of vessel tracks represents a significant challenge in the context of high-frequency surface wave radar (HFSWR) tracking. This paper proposes a new track segment association (TSA) algorithm that integrates optimal tracklet assignment, iterative discrimination, and multi-stage association. This paper reformulates the optimal tracklet assignment task as an optimal state search problem for modeling and solution purposes. To determine whether competing old and new tracklets can be associated, we assume the existence of a public state that represents the correlation between the tracklets. However, due to track fragmentation, this public state remains unknown. We need to search for the optimal public state of all candidate tracklet pairs within a feasible parameter space, using a fitness function value as the evaluation criterion. The old and new tracklets pairs that match the optimal public state are considered optimally associated. Since the solution process involves searching for the optimal state across multiple dimensions, it constitutes a high-dimensional optimization problem. To accomplish this task, the catch fish optimization algorithm (CFOA) is employed for its ability to escape local optima and handle high-dimensional optimization, enhancing the reliability of tracklet assignment. Furthermore, we achieve precise one-to-one associations by assigning new tracklet to old tracklet through the optimal tracklet assignment method we proposed, a process we abbreviate as AN2O, and its inverse process, which assigns old tracklet to new tracklet, abbreviated as AO2N. This dual approach is further complemented by an iterative discrimination mechanism that evaluates unselected tracklets to identify potential associations that may exist. The algorithm effectiveness of the proposed is validated using field experiment data from HFSWR in the Bohai Sea region, demonstrating its capability to accurately process complex tracklet 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 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.001 | 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.000 | 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".