MétaCan
Menu
Back to cohort
Record W1751402335 · doi:10.1109/iscas.2003.1205981

A continuous tracking algorithm for long-term memory motion estimation [video coding]

2003· article· en· W1751402335 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicVideo Coding and Compression Technologies
Canadian institutionsConcordia University
Fundersnot available
KeywordsMotion estimationComputer scienceReference frameCoding (social sciences)Motion vectorQuarter-pixel motionComputer visionBlock-matching algorithmArtificial intelligenceTerm (time)Inter frameMotion compensationFrame (networking)Tracking (education)Fast motionResidual frameAlgorithmMatch movingMotion (physics)Video trackingVideo processingMathematicsTelecommunications

Abstract

fetched live from OpenAlex

It is known that long-term memory motion estimation can bring a significant coding gain to a video coding system. In this paper, a fast algorithm for long-term memory motion estimation is presented. The proposed algorithm attempts to track the direction of the best long-term motion vector in a frame-by-frame manner from the most recent reference frame to the oldest reference frame. Nine direction patterns for the direction tracking are used and the search locations of the long-term memory motion estimation are adaptively selected according to the chosen direction pattern. Simulation results demonstrate that the proposed algorithms can speed up long-term motion estimation by more than 40 times.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.976
Threshold uncertainty score0.500

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.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.029
GPT teacher head0.276
Teacher spread0.247 · 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