How do kernel-based sensor fusion algorithms behave under high-dimensional noise?

DOI10.1093/IMAIAI/IAAD051WikidataQ130202209 ScholiaQ130202209MaRDI QIDQ6498541FDOQ6498541

Authors: Xiucai Ding, H.-T. Wu 

Publication date: 7 May 2024

Published in: Information and Inference: A Journal of the IMA (Search for Journal in Brave)

Recommendations

• Learning low-dimensional nonlinear structures from high-dimensional noisy data: an integral operator approach
• On information plus noise kernel random matrices
• Latent common manifold learning with alternating diffusion: analysis and applications
• Cauchy kernel-based maximum correntropy Kalman filter
• A new algorithm of non-Gaussian component analysis with radial kernel functions

zbMATH Keywords

random matrix theoryhigh-dimensional noisealternating diffusionnonparametric canonical correlation analysis

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

This page was built for publication: How do kernel-based sensor fusion algorithms behave under high-dimensional noise?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6498541)