Sparse Approximation by Linear Programming using an L1 Data-Fidelity Term
This paper studies the problem of sparse signal approximation over redundant dictionaries. Our attention is focused on the minimization of a cost function where the error is measured by using the L1 norm, giving thus less importance to outliers. We show a constructive equivalence between the proposed minimization problem and Linear Programming. A recovery condition is then provided and an example illustrates the use of such a technique for denoising.
Cite this item
Granai, L., & Vandergheynst, P. (2005). Sparse Approximation by Linear Programming using an L1 Data-Fidelity Term. Proc. Of Workshop on Signal Processing with Adaptative Sparse Structured Representations, Parallel Computing in Electrical Engineering. https://infoscience.epfl.ch/handle/20.500.14299/231735
Click Copy to copy the citation, or select the text manually.
Granai2005_1403.pdf
openaccess
120.92 KB
Adobe PDF
bc212668f7bb5344bcb1845fc95ab50c