Extending Kalman Filters for non-Gaussian Process Noise Sources via Approximate Message Passing

Estimating time-varying signals becomes particularly challenging in the face of non-Gaussian (e.g., sparse) and rapidly time-varying noise dynamics. By building upon the recent progress in the approximate message passing (AMP) realm, this paper unifies the vector AMP (VAMP) paradigm and the Kalman filter (KF) into a common message passing framework. The new algorithm - coined VAMP-KF - does not restrict the process noise dynamics to a specific structure (e.g., same support over time), thereby accounting for both uncorrelated and correlated noise. Numerical results on rapidly time-varying noise with different sparsity rates and distributions demonstrate unambiguously the effectiveness of the proposed VAMP-KF algorithm and its superiority against state-of-the-art baselines in terms of reconstruction accuracy.

Authors

Institutions

Publication Details

Published
2024-10-27
DOI
https://doi.org/10.1109/ieeeconf60004.2024.10942942
Primary Topic
Target Tracking and Data Fusion in Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Extending Kalman Filters for non-Gaussian Process Noise Sources via Approximate Message Passing

Faouzi Bellili, Tiancheng Gao, Mohamed Akrout, Amine Mezghani
Target Tracking and Data Fusion in Sensor Networks
article

Extending Kalman Filters for non-Gaussian Process Noise Sources via Approximate Message Passing

Faouzi Bellili, Tiancheng Gao, Mohamed Akrout, Amine Mezghani
article en

Abstract

Estimating time-varying signals becomes particularly challenging in the face of non-Gaussian (e.g., sparse) and rapidly time-varying noise dynamics. By building upon the recent progress in the approximate message passing (AMP) realm, this paper unifies the vector AMP (VAMP) paradigm and the Kalman filter (KF) into a common message passing framework. The new algorithm - coined VAMP-KF - does not restrict the process noise dynamics to a specific structure (e.g., same support over time), thereby accounting for both uncorrelated and correlated noise. Numerical results on rapidly time-varying noise with different sparsity rates and distributions demonstrate unambiguously the effectiveness of the proposed VAMP-KF algorithm and its superiority against state-of-the-art baselines in terms of reconstruction accuracy.

University of Manitoba (CA)
Openalex Percentile: Top 74%
Target Tracking and Data Fusion in Sensor Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.