MétaCan
Menu
Back to cohort
Record W4393931291 · doi:10.23977/acss.2024.080210

Tracking algorithm based on spatial progressive matching strategy and optimized correlation

2024· article· en· W4393931291 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueAdvances in Computer Signals and Systems · 2024
Typearticle
Languageen
FieldEngineering
TopicAdvanced Algorithms and Applications
Canadian institutionsnot available
FundersYunnan Normal University
KeywordsTracking (education)Matching (statistics)CorrelationComputer scienceAlgorithmArtificial intelligenceSpatial correlationMathematicsStatisticsPsychologyTelecommunications

Abstract

fetched live from OpenAlex

The task of multi-target tracking is to correctly associate the identity of the same target in the two scene scenes. How to improve the accuracy of target tracking is still full of challenges. In this article, we propose a tracking algorithm based on spatial progressive matching strategy and optimized correlation. In it, we divide the targets in the scene according to the area of the target detection frame in the scene. By Prioritizing matching of target groups with a larger target frame area, and then matching target groups with a smaller target frame area is the spatial progressive matching strategy we propose. We noticed that in certain scenes where the target moves too quickly, the traditional intersection-to-union method becomes limited to some extent. Therefore, we substituted it with a circular intersection-to-union ratio method, which is more effective in accurately associating the targets in those scenes.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.956
Threshold uncertainty score0.517

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.010
GPT teacher head0.260
Teacher spread0.250 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it