Non-convex Fraction Function Penalty: Sparse Signals Recovered from Quasi-linear Systems

arXiv1705.00937MaRDI QIDQ6286181FDOQ6286181

Authors: Angang Cui, Ji-Gen Peng, Hai-Yang Li 

Publication date: 2 May 2017

Abstract: The goal of compressed sensing is to reconstruct a sparse signal under a few linear measurements far less than the dimension of the ambient space of the signal. However, many real-life applications in physics and biomedical sciences carry some strongly nonlinear structures, and the linear model is no longer suitable. Compared with the compressed sensing under the linear circumstance, this nonlinear compressed sensing is much more difficult, in fact also NP-hard, combinatorial problem, because of the discrete and discontinuous nature of the $el{l}_0$-norm and the nonlinearity. In order to get a convenience for sparse signal recovery, we set most of the nonlinear models have a smooth quasi-linear nature in this paper, and study a non-convex fraction function $h{o}_a$ in this quasi-linear compressed sensing. We propose an iterative fraction thresholding algorithm to solve the regularization problem $(Q{P}_a^{lambda})$ for all $a>0$. With the change of parameter $a>0$, our algorithm could get a promising result, which is one of the advantages for our algorithm compared with other algorithms. Numerical experiments show that our method performs much better compared with some state-of-art methods.

This page was built for publication: Non-convex Fraction Function Penalty: Sparse Signals Recovered from Quasi-linear Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286181)