MétaCan
Menu
Back to cohort
Record W1991711869 · doi:10.1117/12.452142

Survey of motion estimation techniques for video compression

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

VenueProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2003
Typearticle
Languageen
FieldComputer Science
TopicVideo Coding and Compression Technologies
Canadian institutionsConcordia University
Fundersnot available
KeywordsMotion compensationComputer scienceData compressionVideo compression picture typesQuarter-pixel motionMotion estimationBlock-matching algorithmNTSCVideo processingVideo captureComputer visionMultimediaVideo trackingReal-time computingHigh-definition televisionComputer graphics (images)Telecommunications

Abstract

fetched live from OpenAlex

The introduction of new, more powerful personal computers and workstations has ushered in a new era of computing. New machines are now capable of supporting full-motion video. The problem of video compression is a difficult and important one, and has inspired a great deal of research and development activity. A number of video compression techniques and standards have been introduced in the past few years, particularly MPEG for interactive multimedia and for digital NTSC and HDTV applications, and H.261/H.263 for video telecommunications. These techniques use motion estimation techniques to reduce the amount of data that is stored and transmitted for each frame of video. This paper is about these motion estimation techniques, their implementations, their complexity, advantages, and drawbacks. An overview of the MPEG video compression standard is first presented with an emphasis on how it utilizes motion compensation to achieve its high compression gains. Then a survey of current motion estimation techniques is presented, including the exhaustive search and a number of fast block-based search algorithms.

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.002
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.660
Threshold uncertainty score0.788

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.002
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.021
GPT teacher head0.255
Teacher spread0.234 · 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