MétaCan
Menu
Back to cohort
Record W2046924915 · doi:10.1145/2597176.2578262

Complexity Aware Encoding of the Motion Compensation Process of the H.264/AVC Video Coding Standard

2014· article· en· W2046924915 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 OttawaSimon Fraser University
Fundersnot available
KeywordsComputer scienceMotion compensationCodecQuarter-pixel motionMotion vectorComputational complexity theoryCoding (social sciences)Motion estimationScalable Video CodingRate–distortion optimizationBlock-matching algorithmVideo qualityReal-time computingEncoding (memory)Video processingComputer engineeringVideo trackingComputer visionComputer hardwareAlgorithmArtificial intelligence

Abstract

fetched live from OpenAlex

Advances in battery technology have not kept pace with other recent advances in mobile multimedia systems with the result that power consumption is a major concern. The computational complexity of video codecs, which consists of CPU operations and memory accesses, is one of the main factors affecting power consumption. In this paper, we propose a method that achieves good video quality while at the same time guaranteeing that the complexity needed to decode the video does not exceed a specific threshold defined by a user. We focus on the motion compensation process, including motion vector prediction and interpolation, which is the biggest single component in computation-based power consumption. We formulate the rate-distortion optimization problem and present an efficient method for decoder complexity-aware video encoding in the H.264 video codec. Our results show that our method can achieve up to 95% of the optimal solution value.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.787
Threshold uncertainty score0.316

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.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.036
GPT teacher head0.269
Teacher spread0.233 · 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