2013 ExactSparseRecoverywithL0Projec

From GM-RKB
Jump to navigation Jump to search

Subject Headings:

Notes

Cited By

Quotes

Author Keywords

Abstract

Many applications (e.g., anomaly detection) concern sparse signals. This paper focuses on the problem of recovering a K - sparse signal x ∈ R / 1× N, i.e., K << N and ∑ N / i =1 1{ x i ≠ 0} = K. In the mainstream framework of compressed sensing (CS), × is recovered from [[M linear measurements y = xS ∈ R / 1× M, where S ∈ R N × M is often a Gaussian (or Gaussian-like) design matrix.

In our proposed method, the design matrix S is generated from an α-stable distribution with α ≈ 0. Our decoding algorithm mainly requires one linear scan of the coordinates, followed by a few iterations on a small number of coordinates which are “undetermined” in the previous iteration. Our practical algorithm consists of two estimators. In the first iteration, the (absolute) minimum estimator is able to filter out a majority of the zero coordinates. The gap estimator, which is applied in each iteration, can accurately recover the magnitudes of the nonzero coordinates. Comparisons with linear programming (LP) and orthogonal matching pursuit (OMP) demonstrate that our algorithm can be significantly faster in decoding speed and more accurate in recovery quality, for the task of exact spare recovery. Our procedure is robust against measurement noise. Even when there are no sufficient measurements, our algorithm can still reliably recover a significant portion of the nonzero coordinates.

References

;

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2013 ExactSparseRecoverywithL0ProjecPing Li
Cun-Hui Zhang
Exact Sparse Recovery with L0 Projections10.1145/2487575.24876942013