.png){kind=icon}
Return
Blocked Maximum Correntropy Criterion Algorithm for Cluster-Sparse System Identifications
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2019.2891654.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A blocked proportionate normalized maximum correntropy criterion (PNMCC) is presented to improve the estimation behavior of the traditional maximum correntropy criterion (MCC) algorithm for identifying the blocked sparse systems. The proposed blocked MCC is implemented by constructing a new cost function based on a hybrid-norm constraint (HNC) of the filter coefficient vector to adaptively utilize the cluster-sparse characteristic of unknown systems, denoting as hybrid-norm constrained PNMCC (HNC-PNMCC). The proposed HNC-PNMCC algorithm is achieved by using the basis pursuit. Various simulations are brought out to confirm the validity of the HNC-PNMCC. Simulation results indicate that the HNC-PNMCC is better than the PNMCC, MCC, and sparse MCC with respect to the estimation performance for the cluster-sparse system identification under the impulsive noises.
Keywords:
Maximum correntropy criterion
PNMCC algorithm
l2,1 norm
cluster-sparse system
impulsive noise environments
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
Organization
Cited Papers
ShareSaveApproximation to independent lognormal sum with α-μ distribution and the application.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
ShareSave
ShareSaveShareSave
View more