MétaCan
Menu
Back to cohort
Record W1980117552 · doi:10.1109/isspit.2006.270859

Modeling of Loss-Distortion in Hierarchical Prediction Codecs

2006· article· en· W1980117552 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 British Columbia
Fundersnot available
KeywordsCodecComputer scienceDistortion (music)ScalabilityHierarchical database modelCover (algebra)Frame (networking)Sensitivity (control systems)HomogeneousArtificial intelligenceAlgorithmComputer visionData miningTelecommunicationsElectronic engineeringMathematicsEngineering

Abstract

fetched live from OpenAlex

Existing video distortion models used for hybrid video codecs do not match the hierarchical prediction structure employed in SVC. In this paper, we derive a new video distortion model that captures the sensitivity to frame losses of a hierarchical prediction video decoder using the picture copy (PC) concealment strategy of SVC. Existing frameworks only cover non-scalable coders, and therefore, fall short of accurately modeling scalable coders due to the additional parameters that come into play. Performance evaluations show that our model closely approximates the loss-distortion of hierarchical coders for video sequences with different levels of motion, with exceptional performance in sequences with homogeneous levels of motion

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.700
Threshold uncertainty score0.170

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.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.016
GPT teacher head0.230
Teacher spread0.214 · 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

Quick stats

Citations15
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicVideo Coding and Compression TechnologiesFrench-language works237,207