MétaCan
Menu
Back to cohort
Record W2122421814 · doi:10.1109/icecs.2007.4511252

Iterative Noise-Compensated Method to Improve LPC Based Speech Analysis

2007· article· en· W2122421814 on OpenAlexaff
A. Trabelsi, François-Raymond Boyer, Yvon Savaria, Mounir Boukadoum

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSpeech and Audio Processing
Canadian institutionsUniversité du Québec à MontréalPolytechnique Montréal
Fundersnot available
KeywordsAutocorrelationNoise (video)Noise powerEstimatorLinear predictive codingNoise measurementLinear predictionSpectral densityComputer scienceSpeech enhancementMathematicsAlgorithmAutocorrelation matrixSpeech recognitionSpectral density estimationNoise reductionSpeech codingFourier transformStatisticsPower (physics)Artificial intelligencePhysics

Abstract

fetched live from OpenAlex

It is well known that linear predictive coding (LPC) performs well when the prediction coefficients are estimated from noise-free speech, and the system tends to degrade and perform poorly on noisy speech. This paper describes a method to minimize the degradation on the prediction coefficients in the presence of noise when an LPC analysis is used. In this method, a more accurate estimation of noise power is computed by using a simplified noise power spectral density (PSD) estimator. After an inverse discrete Fourier transform (DFT), the extracted noise autocorrelation coefficients are gradually subtracted from the coefficients derived from noisy speech according to an iterative processing scheme. The proposed processing scheme takes the absolute value of the estimated reflection coefficients as the decision criterion. It is shown that performing this iterative procedure on every autocorrelation lag ensures a substantial decrease in the degrading effects of noise, while the estimated autocorrelation matrix is guaranteed to be positive-definite. Experimental results indicate that the variance of the estimated prediction coefficients can be decreased significantly using the proposed method.

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 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.001
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.682
Threshold uncertainty score0.617

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.004
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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.013
GPT teacher head0.307
Teacher spread0.294 · 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 teacher head, not a consensus.

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

Citations4
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicSpeech and Audio ProcessingFrench-language works237,207