MétaCan
Menu
Back to cohort
Record W2060542827 · doi:10.1142/s021848851100712x

COVARIANCE TRACKING WITH FORGETTING FACTOR AND RANDOM SAMPLING

2011· article· en· W2060542827 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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal of Uncertainty Fuzziness and Knowledge-Based Systems · 2011
Typearticle
Languageen
FieldComputer Science
TopicVideo Surveillance and Tracking Methods
Canadian institutionsUniversity of Ottawa
FundersNational Science Fund for Distinguished Young ScholarsNational Natural Science Foundation of China
KeywordsCovariance intersectionCovarianceRobustness (evolution)ClutterCovariance functionComputer scienceAlgorithmMatérn covariance functionForgettingArtificial intelligenceMathematicsCovariance matrixStatisticsRadar

Abstract

fetched live from OpenAlex

Covariance matching is an excellent algorithm of target tracking. In this paper, forgetting factor and random sampling methods are proposed to improve the robustness and efficiency of covariance tracking. First, a distance function between covariance matrixes is weighted by using a forgetting factor based on a fuzzy membership function to overcome the disturbances from similar targets. Then a random sampling method is applied to reduce the computing time in covariance matching and to facilitate real-time object tracking. Experiment results show that the algorithm proposed in this paper can effectively mitigate the clutter and occlusion problems at a high computing speed.

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.001
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: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.877
Threshold uncertainty score0.547

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.001
Open science0.0010.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.070
GPT teacher head0.306
Teacher spread0.236 · 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