We consider the recovery of high-dimensional sparse signals via -minimization under mutual incoherence condition, which is shown to be sufficient for sparse signals recovery in the noiseless and noise cases. We study both -minimization under the constraint and the Dantzig selector. Using the two -minimization methods and a technical inequality, some results are obtained. They improve the results of the error bounds in the literature and are extended to the general case of reconstructing an arbitrary signal
Compressive sensing theory has attracted widespread attention in recent years and sparse signal reco...
International audienceWe discuss two new methods of recovery of sparse signals from noisy observatio...
We consider the orthogonal matching pursuit (OMP) algorithm for the recovery of a high-dimensional s...
This paper considers constrained lscr1 minimization methods in a unified framework for the recovery ...
In this paper, we present a concise and coherent analysis of the constrained ??1 minimization method...
Abstract—This paper considers constrained minimization methods in a unified framework for the recov...
This article considers sparse signal recovery in the presence of noise. A mutual incoherence conditi...
We consider the problem of recovering a sparse signal from underdetermined measurements when we have...
We consider the problem of recovering a sparse signal from underdetermined measurements when we have...
In this paper, we consider using total variation (TV) minimization to recover signals whose gradient...
It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what ap...
We propose a new algorithm to recover a sparse signal from a system of linear measurements. By proje...
The problem of recovering sparse signals from a limited number of measurements is now ubiquitous in ...
We present a probabilistic analysis on conditions of the exact recovery of block-sparse signals whos...
International audienceWe propose novel necessary and sufficient conditions for a sensing matrix to b...
Compressive sensing theory has attracted widespread attention in recent years and sparse signal reco...
International audienceWe discuss two new methods of recovery of sparse signals from noisy observatio...
We consider the orthogonal matching pursuit (OMP) algorithm for the recovery of a high-dimensional s...
This paper considers constrained lscr1 minimization methods in a unified framework for the recovery ...
In this paper, we present a concise and coherent analysis of the constrained ??1 minimization method...
Abstract—This paper considers constrained minimization methods in a unified framework for the recov...
This article considers sparse signal recovery in the presence of noise. A mutual incoherence conditi...
We consider the problem of recovering a sparse signal from underdetermined measurements when we have...
We consider the problem of recovering a sparse signal from underdetermined measurements when we have...
In this paper, we consider using total variation (TV) minimization to recover signals whose gradient...
It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what ap...
We propose a new algorithm to recover a sparse signal from a system of linear measurements. By proje...
The problem of recovering sparse signals from a limited number of measurements is now ubiquitous in ...
We present a probabilistic analysis on conditions of the exact recovery of block-sparse signals whos...
International audienceWe propose novel necessary and sufficient conditions for a sensing matrix to b...
Compressive sensing theory has attracted widespread attention in recent years and sparse signal reco...
International audienceWe discuss two new methods of recovery of sparse signals from noisy observatio...
We consider the orthogonal matching pursuit (OMP) algorithm for the recovery of a high-dimensional s...