MétaCan
Menu
Back to cohort
Record W2136760469 · doi:10.1109/adfsp.1998.685689

A new fast block matching algorithm using the simplex technique

2002· article· en· W2136760469 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 institutionsUniversity of Victoria
Fundersnot available
KeywordsMotion estimationComputer scienceEncoderAlgorithmSimplexComputationBlock (permutation group theory)Data compressionPoint set registrationSearch algorithmMatching (statistics)Simplex algorithmComputational complexity theoryBlock sizePoint (geometry)MathematicsLinear programming

Abstract

fetched live from OpenAlex

A new fast technique for block-based motion estimation using the simplex technique is presented. Block-based motion estimation is used in several video compression applications and standards. The simplex search is a fast search technique that converges rapidly towards the minimum point in small or irregular search areas. It starts with a certain initial-point configuration and then moves towards the solution through a set of operations. These operations include reflection, expansion, and contraction. The proposed technique was implemented as part of the MPEG-2 encoder and was compared with different search techniques. The results obtained show that the technique has better performance over some existing techniques in terms of computation complexity and motion estimation 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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.970
Threshold uncertainty score0.311

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.0010.001
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.042
GPT teacher head0.266
Teacher spread0.223 · 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