Abstract

In compressed sensing, we wish to reconstruct a sparse signal xx from observed data yy. In sparse coding, on the other hand, we wish to find a representation of an observed signal yy as a sparse linear combination, with coefficients xx, of elements from an overcomplete dictionary. While many algorithms are competitive at both problems when xx is very sparse, it can be challenging to recover xx when it is less sparse. We present the Difference Map, which excels at sparse recovery when sparseness is lower and noise is higher. The Difference Map out-performs the state of the art with reconstruction from random measurements and natural image reconstruction via sparse coding.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.