MétaCan
Menu
Back to cohort
Record W2110084697 · doi:10.1109/itcc.2003.1197583

Feature-bit-plane motion estimation using enhanced motion vector

2004· article· en· W2110084697 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 estimationMotion vectorQuarter-pixel motionComputer scienceBlock (permutation group theory)Block-matching algorithmBit planeMotion (physics)Artificial intelligenceMatching (statistics)AlgorithmFeature (linguistics)Computer visionPlane (geometry)ScalabilityMathematicsImage (mathematics)

Abstract

fetched live from OpenAlex

This paper presents a fast block-based motion estimation algorithm based on a bit plane technique. This algorithm can produce the eligible candidates for finding the enhanced motion vectors. The proposed method translates the expensive 2D block-matching problem to a simpler 1D matching by choosing some blocks as eligible candidates and eliminating the others. The bit-plane idea combined with the enhanced motion vector leads to a novel motion estimation algorithm. This novel algorithm offers computational scalability through two parameters, so the speed/performance trade-off of the proposed method can easily be controlled. Experiments show that the proposed method is several times faster than the full search algorithm and it produces a better prediction performance. There are some cases in which existing motion estimation techniques obtain a false motion vector with a huge prediction error, while the proposed method can find an enhanced motion vector with an excellent accuracy.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.693
Threshold uncertainty score0.386

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.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.022
GPT teacher head0.260
Teacher spread0.237 · 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