2018
DOI: 10.1109/access.2018.2821141
|View full text |Cite
|
Sign up to set email alerts
|

Generalized Complex Correntropy: Application to Adaptive Filtering of Complex Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 37 publications
(18 citation statements)
references
References 15 publications
0
18
0
Order By: Relevance
“…The MCC contains higher moments of probability density function and is suitable for any noise environment. So far, many robust learning algorithms have been developed using MCC [12][13][14][15][16][17][18]. It has been proved that they can perform a robust analysis [19][20][21][22] and effectively deal with non-Gaussian situations and outliers [23][24][25].…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…The MCC contains higher moments of probability density function and is suitable for any noise environment. So far, many robust learning algorithms have been developed using MCC [12][13][14][15][16][17][18]. It has been proved that they can perform a robust analysis [19][20][21][22] and effectively deal with non-Gaussian situations and outliers [23][24][25].…”
Section: Literature Reviewmentioning
confidence: 99%
“…That is to say, maximizing J(ω, b) with respect to [ω, b] is equivalent to maximizing the augmented function J(ω, b, p) in the enlarged parameter space [ω, b, p]. Now, to overcome the second problem, we introduce a slack vector to convert the unconstrained optimization problem (16) to the following constrained problem…”
Section: Of 18mentioning
confidence: 99%
“…They cannot be directly employed to handle the complex-valued data. In fact, many signals are defined in the complex domain in practical applications [ 22 , 23 , 24 , 25 ]. Thus, in this work, we put forward a Hammerstein maximum complex correntropy criterion (HMCCC) algorithm, which extends the Hammerstein adaptive filter, using MCC criterion, to the complex domain.…”
Section: Introductionmentioning
confidence: 99%
“…To find out the solution for handling these problems, the maximum correntropy criterion (MCC) was proposed to give resistance to impulse-noise [36,37]. Then, a series of AF algorithms based on MCC were proposed to resist impulse-noise [38][39][40][41][42][43][44][45][46][47][48]. The variable kernel width MCC (VKW-MCC) uses a variable kernel width technique to enhance the identification ability of the famed MCC [49].…”
Section: Introductionmentioning
confidence: 99%