MétaCan
Menu
Back to cohort

A Decomposition-Based Kalman Filter for the Identification of Acoustic Impulse Responses

2023· article· en· W4388115379 on OpenAlex
Laura-Maria Dogariu, Constantin Paleologu, Jacob Benesty, Cristian-Lucian Stanciu, Silviu Ciochină

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 institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
Fundersnot available
KeywordsFinite impulse responseKalman filterAdaptive filterComputer scienceImpulse responseReverberationImpulse (physics)Recursive least squares filterAlgorithmInfinite impulse responseComputational complexity theorySystem identificationDigital filterSpeech recognitionFilter (signal processing)MathematicsAcousticsArtificial intelligenceData modelingPhysics

Abstract

fetched live from OpenAlex

The identification of acoustic impulse responses usually involves long length adaptive filters, with hundreds or even thousands of coefficients. This issue raises significant challenges in terms of both the computational complexity and convergence features. Recently, a decomposition-based solution using the Kronecker product and low-rank approximations was proposed in this context, by exploiting the intrinsic nature of the acoustic impulse responses. These systems are characterized by early reflections and late reverberation, each of these components having different characteristics that should be considered. In this paper, we propose a Kalman filter following this approach, which outperforms the previously developed solution based on the recursive least-squares algorithm. Simulations performed in the framework of acoustic echo cancellation support the performance features of the proposed algorithm.

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: Empirical · Consensus signal: none
Teacher disagreement score0.938
Threshold uncertainty score0.220

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.024
GPT teacher head0.308
Teacher spread0.283 · 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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207