MétaCan
Menu
Back to cohort
Record W2121078004 · doi:10.1109/glocom.1994.512714

Classification and spectral extrapolation based packet reconstruction for low-delay speech coding

2002· article· en· W2121078004 on OpenAlexaff
Aamir Husain, V. Cuperman

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsExtrapolationComputer scienceSpeech codingSpeech recognitionErasureNetwork packetLinear predictive codingVoice activity detectionAlgorithmFrame (networking)Decoding methodsFilter (signal processing)Speech processingMathematicsStatisticsTelecommunicationsComputer network

Abstract

fetched live from OpenAlex

A common aspect of speech transmission through packetized networks is the need to consider discarded (missing) packets as a result of error detection or network overload. The missing packets and the possible mistracking that results in the speech decoder lead to significant quality degradation. In this paper, we examine recovery techniques based on speech classification and spectral extrapolation. The recovery system extrapolates independently the excitation signal and the short-term synthesis filter using an extrapolation strategy based on speech classification (voiced, unvoiced, transition, silence). The extrapolation of the short-term filter uses a least-squares fading memory polynomial filter applied to reflection coefficients. Objective and subjective quality evaluations of the recovery system applied to the LD-CELP G.728 standard for random and burst frame erasures are presented. The results indicate that the system is robust up to a frame erasure rate of 10%. Very little degradation in quality was observed at erasure rates up to 3% for random frame erasures.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.001
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.046
GPT teacher head0.280
Teacher spread0.233 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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

Citations3
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207