Robust Sparse Coding and Compressed Sensing with the Difference mAP
Abstract
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.
Cite
Text
Landecker et al. "Robust Sparse Coding and Compressed Sensing with the Difference mAP." European Conference on Computer Vision, 2014. doi:10.1007/978-3-319-10578-9_21Markdown
[Landecker et al. "Robust Sparse Coding and Compressed Sensing with the Difference mAP." European Conference on Computer Vision, 2014.](https://mlanthology.org/eccv/2014/landecker2014eccv-robust/) doi:10.1007/978-3-319-10578-9_21BibTeX
@inproceedings{landecker2014eccv-robust,
title = {{Robust Sparse Coding and Compressed Sensing with the Difference mAP}},
author = {Landecker, Will and Chartrand, Rick and DeDeo, Simon},
booktitle = {European Conference on Computer Vision},
year = {2014},
pages = {315-329},
doi = {10.1007/978-3-319-10578-9_21},
url = {https://mlanthology.org/eccv/2014/landecker2014eccv-robust/}
}