MétaCan
Menu
Back to cohort
Record W2163296209 · doi:10.1109/iscas.2009.5117977

A time-frequency domain formant frequency estimation scheme for noisy speech signals

2009· article· en· W2163296209 on OpenAlexaff
Shaikh Anowarul Fattah, Wei‐Ping Zhu, M. Omair Ahmad

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSpeech and Audio Processing
Canadian institutionsConcordia University
Fundersnot available
KeywordsFormantSpeech recognitionFrequency domainComputer scienceNoise (video)AutocorrelationTime domainSpeech processingSIGNAL (programming language)MathematicsArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

Formant frequency is a one of the most important speech feature, which has widespread applications in speech recognition, synthesis, and compression. In this paper, a new time-frequency domain scheme for the estimation of formant frequencies from noise-corrupted speech signals is presented. In order to overcome the adverse effect of noise, instead of conventional autocorrelation function (ACF), a repeated ACF (RACF) of the noisy speech is employed. Exploiting the characteristics of the zero lag, a set of equations containing the lower lags of the RACF of the noisy speech is used to estimate the formant frequencies. In order to avoid estimation errors that may occur in the case of weak formants, a frequency-domain algorithm is introduced utilizing the RACF of the observed speech. Formant frequency estimation accuracy is measured for different natural and synthetic vowels in noisy environments and even at low levels of signal-to-noise ratio, a better performance is obtained by the proposed scheme in comparison to some of the existing methods.

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.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.568
Threshold uncertainty score0.665

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.002
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.261
Teacher spread0.248 · 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

Citations2
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicSpeech and Audio ProcessingFrench-language works237,207