.png){kind=icon}
.png){kind=icon}
Return
Multikernel adaptive filtering based on random features approximation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2020.107712.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multikernel adaptive filters (MKAFs) have been proposed to address the selection issue of kernel parameter in single kernel based kernel adaptive filters (KAFs). However, the conventional MKAFs suffer from large memory requirements and computational burdens owing to their growing network structures. To address this issue, a random features approximation for online multikernel adaptive filtering is presented in this paper. Based on this efficient approximation, a novel robust MKAF based on the minimum kernel mean p-power error criterion, namely multiple random features kernel mean p-power (MRFKMP) algorithm, is therefore proposed in a fixed-dimensional random Fourier features space. The mean square steady-state performance of MRFKMP is derived for theoretical analysis in terms of excess mean square error (EMSE). In addition, an extension of MRFKMP is further developed in a recursive form for performance improvement. Monte Carlo simulations are conducted to validate the obtained theoretical results and the superiorities of the proposed algorithms from the aspects of computational efficiency, filtering accuracy, robustness to large outliers. (c) 2020 Elsevier B.V. All rights reserved.
Keywords:
Multikernel adaptive filter
Random features approximation
Kernel mean p-power error
Computational efficiency
Recursive form
Robustness
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.