MétaCan
Menu
Back to cohort
Record W2130186711 · doi:10.1109/icassp.1994.389241

Low-complexity encoding of speech LSF parameters using constrained-storage TSVQ

2002· article· en· W2130186711 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
TopicAdvanced Data Compression Techniques
Canadian institutionsMcGill University
Fundersnot available
KeywordsVector quantizationComputational complexity theoryAlgorithmEncoding (memory)Speech codingComputer scienceQuantization (signal processing)Coding (social sciences)Theoretical computer scienceTree (set theory)Linear predictive codingComputationSpeech recognitionMathematicsArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

Tree structured vector quantization (TSVQ) is employed as a low-complexity approach to performing vector quantization of speech linear prediction coefficients, expressed for the purpose of quantization as line spectral frequency (LSF) parameters. Good tradeoffs between search complexity and distortion-rate performance are obtained using multiple-survivor encoding. The exponential storage-complexity of conventional TSVQ is circumvented by using multiple stages, where one or more tree codebooks may be used in each stage. Experimental results show that for rates between 23-25 bits/frame,the encoding complexity required to achieve "transparent coding" quality ranges from below two hundred to several hundred weighted-squared-error distortion computations per frame.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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

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.098
GPT teacher head0.303
Teacher spread0.205 · 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

Quick stats

Citations7
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207