.png){kind=icon}
返回
Convex regularized recursive maximum correntropy algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2016.05.030.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this brief, a robust and sparse recursive adaptive filtering algorithm, called convex regularized recursive maximum correntropy (CR-RMC), is derived by adding a general convex regularization penalty term to the maximum correntropy criterion (MCC). An approximate expression for automatically selecting the regularization parameter is also introduced. Simulation results show that the CR-RMC can significantly outperform the original recursive maximum correntropy (RMC) algorithm especially when the underlying system is very sparse. Compared with the convex regularized recursive least squares (CR-RLS) algorithm, the new algorithm also shows strong robustness against impulsive noise. The CR-RMC also performs much better than other LMS-type sparse adaptive filtering algorithms based on MCC. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Maximum correntropy criterion (MCC)
Sparse adaptive filtering
Recursive maximum correntropy (RMC)
Convex regularized recursive maximum correntropy (CR-RMC)
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容