资源分类
》 资源 》论文》Robust Sparse Coding and Compressed Sensing with the Difference Map

Robust Sparse Coding and Compressed Sensing with the Difference Map

2020-04-06 | |  61 |   36 |   0

Abstract

In compressed sensing, we wish to reconstruct a sparse sig- nal 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 dic- tionary. 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.

上一篇：Schwarps: Locally Pro jective Image Warps Based on 2D Schwarzian Derivatives

下一篇：Riemannian Sparse Coding for Positive Definite Matrices

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...