MétaCan
Menu
Back to cohort
Record W2086174525 · doi:10.1109/tasl.2011.2181834

Context-Based Adaptive Arithmetic Encoding of EAVQ Indices

2011· article· en· W2086174525 on OpenAlex
Khaled Lakhdhar, Roch Lefebvre

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

VenueIEEE Transactions on Audio Speech and Language Processing · 2011
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversité de Sherbrooke
Fundersnot available
KeywordsLossless compressionComputer scienceEncoding (memory)CodecContext (archaeology)Data compressionSpeech recognitionBinary numberAlgorithmArithmetic codingArithmeticContext-adaptive binary arithmetic codingMathematicsArtificial intelligenceComputer hardware

Abstract

fetched live from OpenAlex

This paper presents a lossless compression algorithm for the binary indices of the embedded algebraic vector quantizer (EAVQ) used by the AMR-WB (Extended Adaptive Multi-Rate Wide Band) codec. We present a statical study of the EAVQ indices for diverse audio types (speech, music, etc.) and we discuss the design of the lossless algorithm including the choice of different strategies. The proposed algorithm combines run length encoding (RLE) and context-based arithmetic encoding to reduce the bitrate of the EAVQ indices by about 10% at the expense of 1% rise in complexity of the codec. The proposed algorithm can increase the segmental signal to noise ratio of about 9% at low rates for speech signals and improve the subjective scores in noisy channels by about 0.5 on a five-point scale if combined with an additional protection layer.

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

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.028
GPT teacher head0.265
Teacher spread0.237 · 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