In compressed sensing, we wish to reconstruct a sparse signal x from observed data y. In sparse coding, on the other hand, we wish to find a representation of an observed signal y as a sparse linear combination, with coefficients x, of elements from an overcomplete dictionary. While many algorithms are competitive at both problems when x is very sparse, it can be challenging to recover x when it is less sparse. We present the Difference Map, which excels at sparse recovery when sparseness is lower. The Difference Map out-performs the state of the art with reconstruction from random measurements and natural image reconstruction via sparse coding. © 2014 Springer International Publishing.
CITATION STYLE
Landecker, W., Chartrand, R., & DeDeo, S. (2014). Robust sparse coding and compressed sensing with the difference map. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8691 LNCS, pp. 315–329). Springer Verlag. https://doi.org/10.1007/978-3-319-10578-9_21
Mendeley helps you to discover research relevant for your work.