MétaCan
Menu
Back to cohort
Record W2547753340 · doi:10.1109/ccece.2016.7726703

RDO cost modeling for low-complexity HEVC intra coding

2016· article· en· W2547753340 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicVideo Coding and Compression Technologies
Canadian institutionsÉcole de Technologie SupérieureUniversité du Québec à Montréal
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceCoding (social sciences)Computational complexity theoryContext-adaptive binary arithmetic codingAlgorithmRate distortionRate–distortion optimizationData compressionAlgorithmic efficiencyCoding tree unitReal-time computingMultiview Video CodingArtificial intelligenceDecoding methodsMathematicsVideo processingStatistics

Abstract

fetched live from OpenAlex

High efficiency video coding (HEVC) is the newest international standard for video compression, providing improved coding performance that achieves compression ratios up to 50% higher than those obtained with H.264/AVC. However, this improvement comes at the expense of high computational complexity and coding time. In this paper, we propose a novel method for fast and low-complexity intra HEVC mode decision based on rate-distortion optimization (RDO) cost modeling, which permits the exclusion of non-promising candidates from the RDO processing. To achieve even more complexity reduction, an additional rough most probable modes examination is coupled with the main algorithm. Experimental results show that the proposed algorithms reduce the encoding time by 41.8% on average, with a negligible quality loss of 0.058 dB (BD-PSNR) for all-intra scenarios, as compared to the HEVC reference implementation, the HM 15.0.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.890
Threshold uncertainty score0.309

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.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.100
GPT teacher head0.294
Teacher spread0.194 · 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