MétaCan
Menu
Back to cohort
Record W2120623902 · doi:10.1109/vetecs.2009.5073532

End-to-End Performance of Robust Multiple Description Scalar Quantizer

2009· article· en· W2120623902 on OpenAlexaff
Rui Ma, Fabrice Labeau

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsMcGill University
Fundersnot available
KeywordsComputer scienceForward error correctionNetwork packetRobustness (evolution)Bit error ratePacket lossMultiple description codingError detection and correctionEncoderComputer networkReal-time computingDecoding methodsAlgorithm

Abstract

fetched live from OpenAlex

Transmissions over hybrid wireline-wireless networks suffer both packet losses and bit errors. To facilitate delay-sensitive audio/video communications over hybrid networks, low-delay error recovery techniques, such as forward error correction (FEC) and multiple description coding (MDC), are utilized to provide protection against bit errors and packet losses, respectively. As a means of joint source-channel coding, the robust multiple description scalar quantizer (RMDSQ) was introduced to combat both packet losses and bit errors. In this paper, a novel RMDSQ system is proposed by utilizing both MDC and FEC-based techniques. In the sense of rate distortion, end-to-end performance of the RMDSQ system against packet losses and bit errors is compared with that of individual FEC and MDC-based techniques. Instead of the traditional two-state Gilbert channel model, a three-state Markov chain is proposed to model hybrid networks and work as the testbed. Experimental results show that the proposed RMDSQ system achieves higher robustness against increasing packet losses and bit errors. In contrast, FEC-based techniques achieve better performance against bit errors; however, their performance deteriorates significantly due to packet losses.

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.505
Threshold uncertainty score0.438

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.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.033
GPT teacher head0.262
Teacher spread0.228 · 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
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207