MétaCan
Menu
Back to cohort
Record W2796792578 · doi:10.1109/icassp.2018.8462054

A Joint Source Channel Arithmetic Map Decoder Using Probabilistic Relations Among Intra Modes in Predictive Video Compression

2018· article· en· W2796792578 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 institutionsConcordia University
Fundersnot available
KeywordsDecoding methodsMacroblockComputer scienceAlgorithmSoft-decision decoderRedundancy (engineering)Probabilistic logicData compressionA priori and a posterioriTree (set theory)Channel (broadcasting)Metric (unit)Tree structureMaximum a posteriori estimationSequential decodingMathematicsArtificial intelligenceBlock codeStatisticsMaximum likelihoodBinary treeTelecommunications

Abstract

fetched live from OpenAlex

In this paper, residual redundancy in compressed videos is exploited to alleviate transmission errors using joint source channel arithmetic decoding. A new method is proposed to estimate a priori probability in MAP metric of H.264 intra modes decoder. The decoder generates a decoding tree using a breadth first search algorithm. An introduced statistical model is then implemented stage by stage over the decoding tree. In this model, a priori PMF of intra block modes in a macroblock is estimated from the intra block modes seated in its spatially adjacent macroblocks previously generated up to the current stage of the decoding tree. The estimated PMFs are categorized as either reliable or unreliable based on their local entropies. In the unreliable case, the decoder assumes uniform PMF and switch to ML metric instead. The simulation results show the proposed method reduces the error rate 1 % to 13% at various SNRs compared to the ML.

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

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.001
Science and technology studies0.0000.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.037
GPT teacher head0.256
Teacher spread0.219 · 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