MétaCan
Menu
Back to cohort
Record W1579840434 · doi:10.1109/icdsp.2015.7251879

Robust nonlinear acoustic echo cancellation using a metaheuristic optimization approach

2015· article· en· W1579840434 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
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsUniversité du Québec à Trois-Rivières
Fundersnot available
KeywordsNonlinear systemSigmoid functionRobustness (evolution)Computer scienceNonlinear distortionMetaheuristicAlgorithmControl theory (sociology)Mathematical optimizationAmplifierMathematicsBandwidth (computing)Artificial neural networkArtificial intelligenceTelecommunications

Abstract

fetched live from OpenAlex

Nonlinearities in audio systems are caused by different nonlinear components like amplifiers and speakers. The nature of these impairments makes acoustic echo cancellation (AEC) harder to achieve, requiring the use of advanced and complex algorithms to offer satisfying performance. Adaptive filters in combination with nonlinear mapping schemes like Volterra and Hammerstein are widely used for this purpose. In this work, we address the AEC problem in the presence of severe nonlinear distortion. The proposed method based on metaheuristic optimization uses a genetic algorithm (GA) to estimate the nonlinear function parameters and the room impulse response. The method is compared to a reference technique that uses a sigmoid transform approach in conjunction with the recursive least square (RLS) algorithm. Simulation results show high robustness of the proposed approach to strong nonlinearities and saturation effects compared to the reference 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.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.196
Threshold uncertainty score0.614

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.000
Open science0.0000.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.095
GPT teacher head0.257
Teacher spread0.162 · 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

Citations2
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207