Abstract
Recently, an extended version of correntropy, whose center can locate at any position has been proposed and applied in a new optimization criterion called maximum correntropy criterion with variable center (MCC-VC). In order to optimize the performance of adaptive filtering in non-Gaussian and non-zero mean noise environments, in this paper, we propose a stochastic gradient adaptive filtering algorithm for online learning based on MCC-VC and analyze its stability and convergence performance. Moreover, we also extend an online learning approach to estimate the kernel width and the center location, in which two parameters have a great influence on the accuracy of the algorithm. The simulation results of the online learning model have verified the superiority and robustness of the new method.
| Original language | English |
|---|---|
| Article number | 8782582 |
| Pages (from-to) | 105902-105908 |
| Number of pages | 7 |
| Journal | IEEE Access |
| Volume | 7 |
| DOIs | |
| Publication status | Published - 2019 |
Keywords
- Adaptive filtering
- maximum correntropy criterion with variable center(MCC-VC)
- steady-state excess mean square error
- stochastic gradient algorithm
Fingerprint
Dive into the research topics of 'Adaptive Filtering under the Maximum Correntropy Criterion with Variable Center'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver