Abstract
Robust compressive sensing (CS) aims to recover the sparse signals from noisy measurements perturbed by non-Gaussian (i.e., heavy-tailed) noises, where traditional CS reconstruction algorithms may perform poorly owing to utilizing the l2 error norm in optimization. In this paper, we propose a novel maximum correntropy adaptation approach for robust CS reconstruction. The task is formulated as a l0 regularized maximum correntropy criterion (l0-MCC) optimization problem and is solved by adaptive filtering approach. The proposed l0-MCC algorithm has a simple algorithm structure and can adaptively estimate the sparsity. It can efficiently alleviate the negative impact of noise in the presence of large outliers. Moreover, a novel theoretical analysis on convergence of l0-MCC is also performed. Furthermore, a mini-batch-based l0-MCC (MB-l0-MCC) algorithm is developed to speed up the convergence. Comparison with existing robust CS reconstruction algorithms is conducted via simulations, showing that the proposed methods can achieve better performance than existing state-of-the-art algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.