Related papers: Transformed $\ell_p$ Minimization Model and Sparse…
When the signal does not have a sparse structure but has sparsity under a certain transformation domain, Nam et al. \cite{NS} introduced the cosparse analysis model, which provides a dual perspective on the sparse representation model. This…
We study the properties of sparse reconstruction of transformed $\ell_1$ (TL1) minimization and present improved theoretical results about the recoverability and the accuracy of this reconstruction from undersampled measurements. We then…
In the context of compressed sensing, the nonconvex $\ell_q$ minimization with $0<q<1$ has been studied in recent years. In this paper, by generalizing the sharp bound for $\ell_1$ minimization of Cai and Zhang, we show that the condition…
We consider the compressed sensing problem, where the object $x_0 \in \bR^N$ is to be recovered from incomplete measurements $y = Ax_0 + z$; here the sensing matrix $A$ is an $n \times N$ random matrix with iid Gaussian entries and $n < N$.…
In this paper, we introduce a weighted $\ell_2/\ell_1$ minimization to recover block sparse signals with arbitrary prior support information. When partial prior support information is available, a sufficient condition based on the high…
Sparse signal recovery from under-determined systems presents significant challenges when using conventional L_0 and L_1 penalties, primarily due to computational complexity and estimation bias. This paper introduces a truncated Huber…
In this paper, we consider the efficient and robust reconstruction of signals and images via $\ell_{1}-\alpha \ell_{2}~(0<\alpha\leq 1)$ minimization in impulsive noise case. To achieve this goal, we introduce two new models: the…
Recovering nonlinearly degraded signal in the presence of noise is a challenging problem. In this work, this problem is tackled by minimizing the sum of a non convex least-squares fit criterion and a penalty term. We assume that the…
In this work we propose and analyze a novel approach for group sparse recovery. It is based on regularized least squares with an $\ell^0(\ell^2)$ penalty, which penalizes the number of nonzero groups. One distinct feature of the approach is…
We study the recovery conditions of weighted mixed $\ell_2/\ell_p\,(0<p\leq 1)$ minimization for block sparse signal reconstruction from compressed measurements when partial block support information is available. We show that the block…
In the past decade, sparse and low-rank recovery have drawn much attention in many areas such as signal/image processing, statistics, bioinformatics and machine learning. To achieve sparsity and/or low-rankness inducing, the $\ell_1$ norm…
In this note, we address the theoretical properties of $\Delta_p$, a class of compressed sensing decoders that rely on $\ell^p$ minimization with 0<p<1 to recover estimates of sparse and compressible signals from incomplete and inaccurate…
We develop a recursive least square (RLS) type algorithm with a minimax concave penalty (MCP) for adaptive identification of a sparse tap-weight vector that represents a communication channel. The proposed algorithm recursively yields its…
We propose a method to reconstruct sparse signals degraded by a nonlinear distortion and acquired at a limited sampling rate. Our method formulates the reconstruction problem as a nonconvex minimization of the sum of a data fitting term and…
We study high-dimensional estimators with the trimmed $\ell_1$ penalty, which leaves the $h$ largest parameter entries penalty-free. While optimization techniques for this nonconvex penalty have been studied, the statistical properties have…
It is known that a high-dimensional sparse vector x* in R^n can be recovered from low-dimensional measurements y= A^{m*n} x* (m<n) . In this paper, we investigate the recovering ability of l_p-minimization (0<=p<=1) as p varies, where…
In the paper, we introduce an unconstrained analysis model based on the $\ell_{1}-\alpha \ell_{2}$ $(0< \alpha \leq1)$ minimization for the signal and image reconstruction. We develop some new technology lemmas for tight frame, and the…
Signal reconstruction is a crucial aspect of compressive sensing. In weighted cases, there are two common types of weights. In order to establish a unified framework for handling various types of weights, the sparse function is introduced.…
In this paper, we bring together two trends that have recently emerged in sparse signal recovery: the problem of sparse signals that stem from finite alphabets and the techniques that introduce concave penalties. Specifically, we show that…
In this paper, the recursive least squares (RLS) algorithm is considered in the sparse system identification setting. The cost function of RLS algorithm is regularized by a $p$-norm-like ($0 \leq p \leq 1$) constraint of the estimated…