Robust semi-supervised nonnegative matrix factorization for image clustering

S Peng, W Ser, B Chen, Z Lin - Pattern Recognition, 2021 - Elsevier
Nonnegative matrix factorization (NMF) is a powerful dimension reduction method, and has
received increasing attention in various practical applications. However, most traditional …

Local feature descriptor for image matching: A survey

C Leng, H Zhang, B Li, G Cai, Z Pei, L He - IEEE Access, 2018 - ieeexplore.ieee.org
Image registration is an important technique in many computer vision applications such as
image fusion, image retrieval, object tracking, face recognition, change detection and so on …

Mixture correntropy for robust learning

B Chen, X Wang, N Lu, S Wang, J Cao, J Qin - Pattern Recognition, 2018 - Elsevier
Correntropy is a local similarity measure defined in kernel space, hence can combat large
outliers in robust signal processing and machine learning. So far, many robust learning …

Efficient correntropy-based multi-view clustering with anchor graph embedding

B Yang, X Zhang, B Chen, F Nie, Z Lin, Z Nan - Neural Networks, 2022 - Elsevier
Although multi-view clustering has received widespread attention due to its far superior
performance to single-view clustering, it still faces the following issues:(1) high …

Maximum correntropy criterion with variable center

B Chen, X Wang, Y Li… - IEEE Signal Processing …, 2019 - ieeexplore.ieee.org
Correntropy is a local similarity measure defined in kernel space, and the maximum
correntropy criterion (mcc) has been successfully applied in many areas of signal …

Robust rigid registration algorithm based on pointwise correspondence and correntropy

S Du, G Xu, S Zhang, X Zhang, Y Gao… - Pattern Recognition Letters, 2020 - Elsevier
The iterative closest point (ICP) algorithm is fast and accurate for rigid point set registration,
but it works badly when handling noisy data or point clouds with outliers. This paper instead …

Constrained maximum correntropy adaptive filtering

S Peng, B Chen, L Sun, W Ser, Z Lin - Signal Processing, 2017 - Elsevier
Constrained adaptive filtering algorithms have been extensively studied in many
applications. Most existing constrained adaptive filtering algorithms are developed under the …

ECCA: Efficient correntropy-based clustering algorithm with orthogonal concept factorization

B Yang, X Zhang, F Nie, B Chen… - … on Neural Networks …, 2022 - ieeexplore.ieee.org
One of the hottest topics in unsupervised learning is how to efficiently and effectively cluster
large amounts of unlabeled data. To address this issue, we propose an orthogonal …

Robust orthogonal nonnegative matrix tri-factorization for data representation

S Peng, W Ser, B Chen, Z Lin - Knowledge-Based Systems, 2020 - Elsevier
Nonnegative matrix factorization (NMF) has been a vital data representation technique, and
has demonstrated significant potential in the field of machine learning and data mining …

Cauchy kernel-based maximum correntropy Kalman filter

J Wang, D Lyu, Z He, H Zhou… - International Journal of …, 2020 - Taylor & Francis
Non-Gaussian noise processing is a difficult and hot spot in the study of filters. A currently
effective method to deal with non-Gaussian noise is replacing the minimum mean square …