Results 131 to 140 of about 543 (157)
Some of the next articles are maybe not open access.

Maximum Correntropy Criterion for Robust Face Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2011
In this paper, we present a sparse correntropy framework for computing robust sparse representations of face images for recognition. Compared with the state-of-the-art l(1)norm-based sparse representation classifier (SRC), which assumes that noise also has a sparse representation, our sparse algorithm is developed based on the maximum correntropy ...
Ran He 0001   +2 more
openaire   +2 more sources

Sequential Maximum Correntropy Kalman Filtering

Asian Journal of Control, 2018
AbstractThis paper explores a linear state estimation problem in non‐Gaussian setting and suggests a computationally simple estimator based on the maximum correntropy criterion Kalman filter (MCC‐KF). The first MCC‐KF method was developed in Joseph stabilized form. It requires two n × n and one m × m matrix inversions, where n is a dimension of unknown
openaire   +1 more source

Kernel recursive maximum correntropy with Nyström approximation

Neurocomputing, 2019
Abstract Kernel adaptive filters (KAFs) with growing network structures incur high computational burden. Generally, sparsification methods are introduced to curb the growth of the filter structure under some threshold rules, resulting in a variable structure.
Shiyuan Wang   +3 more
openaire   +1 more source

Robust PCA Through Maximum Correntropy Power Iterations

ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2021
Principal component analysis (PCA) is considered a quintessential data analysis technique when it comes to describing linear relationships between the features of a dataset. However, the well-known lack of robustness of PCA for non-Gaussian data and/or outliers often makes its practical use unreliable.
Jean P. Chereau   +2 more
openaire   +1 more source

Maximum correntropy criterion for discriminative dictionary learning

2013 IEEE International Conference on Image Processing, 2013
In this paper, a novel discriminative dictionary learning with pairwise constraints by maximum correntropy criterion is proposed for pair matching problem. Comparing with the conventional dictionary learning approaches, the proposed method has several advantages: (i) It can deal with the outliers and noises problem more efficiently during the ...
Pengyi Hao, Sei-ichiro Kamata
openaire   +1 more source

Performance Analysis of Maximum-Correntropy Based Detection for SCMA

IEEE Communications Letters, 2021
Non-orthogonal multiple access (NOMA) has emerged as a promising multiple-access technique capable of accommodating many users over limited time-frequency resources. Among several NOMA techniques, sparse code multiple access (SCMA) has emerged as viable due to its promise of high coding-gain by appropriate codebook-design and simplistic detection using
Elie Sfeir   +3 more
openaire   +1 more source

A robust maximum correntropy criterion for dictionary learning

2016 IEEE 26th International Workshop on Machine Learning for Signal Processing (MLSP), 2016
We introduce a method that incorporates robustness to one of the main building blocks of sparse modeling: dictionary learning. Particularly, we exploit correntropy to compute the principal components in cases where outliers might be detrimental without proper care.
Carlos A. Loza, José C. Príncipe
openaire   +1 more source

Linear Discriminant Analysis with Maximum Correntropy Criterion

2013
Linear Discriminant Analysis (LDA) is a famous supervised feature extraction method for subspace learning in computer vision and pattern recognition. In this paper, a novel method of LDA based on a new Maximum Correntropy Criterion optimization technique is proposed.
Wei Zhou, Sei-ichiro Kamata
openaire   +1 more source

A maximum correntropy criterion for robust multidimensional scaling

2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2015
Multidimensional Scaling (MDS) refers to a class of dimensionality reduction techniques applied to pairwise dissimilarities between objects, so that the interpoint distances in the space of reduced dimensions approximate the initial pairwise dissimilarities as closely as possible.
Fotios D. Mandanas   +1 more
openaire   +1 more source

Maximum correntropy recursive three-step filter

Systems & Control Letters
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yike Zhang   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy