MétaCan
Menu
Back to cohort
Record W1988694162 · doi:10.1109/vcip.2011.6115914

Unequal channel error protection of multiple description codes for wireless media streaming

2011· article· en· W1988694162 on OpenAlexaff
Tanay Dey, Abdul Bais, Nima Sarshar

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsComputer scienceForward error correctionChannel (broadcasting)Network packetWirelessOptimization problemAlgorithmConvex optimizationVideo qualityComputer networkDecoding methodsMathematical optimizationReal-time computingRegular polygonTelecommunicationsMathematics

Abstract

fetched live from OpenAlex

We investigate the problem of optimal channel protection of multiple-description coded (MDC) multimedia contents at a wireless access point (WAP). For each MDC packet, the WAP has the option to protect and broadcast the packet using one of the available channel coders, or to drop the packet altogether. For a fixed FEC-based MDC, we show how this optimization can be approximated by a convex optimization problem with linear constraints, and thus, can be solved efficiently. We verify the validity of our results through ex- tensive simulations of a wireless image streaming application that employs multiple turbo channel coders, where we report gains of more than 2.50 dB PSNR in average reconstruction quality at receivers. We also devise an iterative algorithm for joint optimization of the channel code rate assignment and the design of the MDC. Our simulations show further gains of up to 5.40 dB in average PSNR when this joint optimization is employed.

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.

How this classification was reachedexpand

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.618
Threshold uncertainty score0.372

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.001
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.111
GPT teacher head0.283
Teacher spread0.173 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207