The complex correntropy has been successfully applied to complex domain adaptive filtering, and the corresponding maximum complex correntropy criterion (MCCC) algorithm has been proved to be robust to non-Gaussian noises. However, the kernel function of the complex correntropy is usually limited to a Gaussian function whose center is zero. In order to improve the performance of MCCC in a non-zero mean noise environment, we firstly define a complex correntropy with variable center and provide its probability explanation. Then, we propose a maximum complex correntropy criterion with variable center (MCCC-VC), and apply it to the complex domain adaptive filtering. Next, we use the gradient descent approach to search the minimum of the cost function. We also propose a feasible method to optimize the center and the kernel width of MCCC-VC. It is very important that we further provide the bound for the learning rate and derive the theoretical value of the steady-state excess mean square error (EMSE). Finally, we perform some simulations to show the validity of the theoretical steady-state EMSE and the better performance of MCCC-VC.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC7516502 | PMC |
http://dx.doi.org/10.3390/e22010070 | DOI Listing |
Sensors (Basel)
February 2025
School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China.
The global navigation satellite system (GNSS) struggles to deliver the precision and reliability required for positioning, navigation, and timing (PNT) services in environments with severe interference. Fifth-generation (5G) cellular networks, with their low latency, high bandwidth, and large capacity, offer a robust communication infrastructure, enabling 5G base stations (BSs) to extend coverage into regions where traditional GNSSs face significant challenges. However, frequent multi-sensor faults, including missing alarm thresholds, uncontrolled error accumulation, and delayed warnings, hinder the adaptability of navigation systems to the dynamic multi-source information of complex scenarios.
View Article and Find Full Text PDFSensors (Basel)
November 2024
School of Automation, Northwestern Polytechnical University, Xi'an 710072, China.
ISA Trans
June 2024
Department of Electrical Engineering, City University of Hong Kong, Hong Kong, China. Electronic address:
Recently, there has been a strong interest in the minimum error entropy (MEE) criterion derived from information theoretic learning, which is effective in dealing with the multimodal non-Gaussian noise case. However, the kernel function is shift invariant resulting in the MEE criterion being insensitive to the error location. An existing solution is to combine the maximum correntropy (MC) with MEE criteria, leading to the MEE criterion with fiducial points (MEEF).
View Article and Find Full Text PDFNeural Netw
May 2024
National Key Laboratory of Human-Machine Hybrid Augmented Intelligence, Xi'an 710049, China; National Engineering Research Center for Visual Information and Applications, Xi'an 710049, China; Institute of Artificial Intelligence and Robotics, Xi'an Jiaotong University, Xi'an 710049, China.
Owing to its ability to handle negative data and promising clustering performance, concept factorization (CF), an improved version of non-negative matrix factorization, has been incorporated into multi-view clustering recently. Nevertheless, existing CF-based multi-view clustering methods still have the following issues: (1) they directly conduct factorization in the original data space, which means its efficiency is sensitive to the feature dimension; (2) they ignore the high degree of factorization freedom of standard CF, which may lead to non-uniqueness factorization thereby causing reduced effectiveness; (3) traditional robust norms they used are unable to handle complex noises, significantly challenging their robustness. To address these issues, we establish a fast multi-view clustering via correntropy-based orthogonal concept factorization (FMVCCF).
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!