MétaCan
Menu
Back to cohort
Record W2119361621 · doi:10.1109/scft.1993.762344

Tree-structured vector quantization of speech lsf parameters

2005· article· en· W2119361621 on OpenAlex
D. Chemla, Sau-Wah Soong, Wai-Yip Chan

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
KeywordsCodebookVector quantizationSpeech codingComputational complexity theoryCode-excited linear predictionAlgorithmLinear predictive codingVector sum excited linear predictionComputer scienceLinde–Buzo–Gray algorithmEncoding (memory)Coding (social sciences)MathematicsLinear predictionSpeech recognitionTree (set theory)Artificial intelligenceStatistics

Abstract

fetched live from OpenAlex

Multistage tree-structured vector quantization (MSTVQ) of speech linear prediction filter parameters is evaluated, aiming to obtain good distortion-rate performance at low en coding search complexity. For each speech analysis frame, the coefficients of the tenth order linear-prediction filter are represented as line spectral frequencies and intraframe coded using several stages of binary tree-structured VQ (TSVQ) codebooks. Experimental performance data are gathered for various degrees of codebook storage and encoding search complexity by varying respectively the number of stages and the number of encoding-search survivors. The results show that MSTVQ can furnish transparent coding quality for rates between 23-25 bits per frame. The required encoding complexity ranges from below 200 to several hundred weighted squared error distortion computations, and the required stor age complexity ranges from below 200 to about 1500 code vectors.

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: Methods
Teacher disagreement score0.871
Threshold uncertainty score0.310

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.017
GPT teacher head0.276
Teacher spread0.259 · 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

Citations3
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207