MétaCan
Menu
Back to cohort
Record W2165475569 · doi:10.1109/ccece.2010.5575234

Iterative Joint Source-Channel Decoding for H.264 video transmission using virtual checking method at source decoder

2010· article· en· W2165475569 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 institutionsMcGill UniversityConcordia University
Fundersnot available
KeywordsComputer scienceDecoding methodsRedundancy (engineering)Channel (broadcasting)Joint (building)EncoderAlgorithmMaximum a posteriori estimationTransmission (telecommunications)Error detection and correctionTheoretical computer scienceComputer networkTelecommunicationsMaximum likelihood

Abstract

fetched live from OpenAlex

This paper proposes an Iterative Joint Source-Channel Decoding (IJSCD) scheme for error resilient transmission of H.264 compressed video over noisy channels. Here both the redundancy systematically added by the channel coding and the source semantic residual redundancy in the compressed video sequence are exploited, in a co-operative manner, to detect and correct transmission errors. Specifically, the soft values produced by the maximum a posteriori (MAP) decoder are used to generate a list of slice candidates for each slice, which are then verified for semantic errors. A new semantic checking method is proposed to accelerate the semantic verification process.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.618
Threshold uncertainty score1.000

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.000
Science and technology studies0.0010.000
Scholarly communication0.0000.001
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.053
GPT teacher head0.312
Teacher spread0.259 · 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

Citations11
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicVideo Coding and Compression TechnologiesFrench-language works237,207