.png){kind=icon}
.png){kind=icon}
Return
The Quarternion Maximum Correntropy Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2015.2407751.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We develop a kernel adaptive filter for quaternion data based on maximizing correntropy. We apply a modified form of the HR calculus that is applicable to Hilbert spaces for evaluating the cost function gradient to develop the quaternion kernel maximum correntropy (KMC) algorithm. The KMC method uses correntropy to measure similarity between the filter output and the desired response. Here, the approach is applied to quaternions for improving performance for biased or non-Gaussian signals compared with the minimum mean square error criterion of the kernel least-mean-square algorithm. Simulation results demonstrate the improved performance with non-Gaussian inputs.
Keywords:
Adaptive filters
correntropy
kernel least mean square (LMS) algorithm
quaternions
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W