MétaCan
Menu
Back to cohort
Record W2101999036 · doi:10.1109/tsa.2005.851943

Speech enhancement employing Laplacian-Gaussian mixture

2005· article· en· W2101999036 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

VenueIEEE Transactions on Speech and Audio Processing · 2005
Typearticle
Languageen
FieldComputer Science
TopicSpeech and Audio Processing
Canadian institutionsQueen's University
Fundersnot available
KeywordsSpeech recognitionWiener filterComputer scienceEstimatorMinimum mean square errorSpeech enhancementGaussianComputational complexity theoryFilter (signal processing)Noise (video)AlgorithmMathematicsArtificial intelligenceStatisticsPhysics

Abstract

fetched live from OpenAlex

A new, efficient speech enhancement algorithm (SEA) is developed in this paper. In this low-complexity SEA, a noisy speech signal is first decorrelated and then the clean speech components are estimated from the decorrelated noisy speech samples. The distributions of clean speech and noise signals are assumed to be Laplacian and Gaussian, respectively. The clean speech components are estimated either by maximum likelihood (ML) or minimum-mean-square-error (MMSE) estimators. These estimators require some statistical parameters derived from speech and noise. These parameters are adaptively extracted by the ML approach during the active speech or silence intervals, respectively. In addition, a voice activity detector (VAD) that uses the same statistical model is employed to detect whether the speech is active or not. The simulation results show that our SEA approach performs as well as a recent high efficiency SEA that employs the Wiener filter. The computational complexity of this algorithm is very low compared with existing SEAs with low computational complexity.

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 categoriesMeta-epidemiology (narrow)
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.966
Threshold uncertainty score1.000

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.001
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0010.000
Research integrity0.0000.001
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.014
GPT teacher head0.255
Teacher spread0.241 · 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