English

Compressed Sensing With Side Information: Geometrical Interpretation and Performance Bounds

Information Theory 2014-10-13 v1 math.IT Optimization and Control Machine Learning

Abstract

We address the problem of Compressed Sensing (CS) with side information. Namely, when reconstructing a target CS signal, we assume access to a similar signal. This additional knowledge, the side information, is integrated into CS via L1-L1 and L1-L2 minimization. We then provide lower bounds on the number of measurements that these problems require for successful reconstruction of the target signal. If the side information has good quality, the number of measurements is significantly reduced via L1-L1 minimization, but not so much via L1-L2 minimization. We provide geometrical interpretations and experimental results illustrating our findings.

Keywords

Cite

@article{arxiv.1410.2724,
  title  = {Compressed Sensing With Side Information: Geometrical Interpretation and Performance Bounds},
  author = {João F. C. Mota and Nikos Deligiannis and Miguel R. D. Rodrigues},
  journal= {arXiv preprint arXiv:1410.2724},
  year   = {2014}
}

Comments

This paper, to be presented at GlobalSIP 2014, is a shorter version of http://arxiv.org/abs/1408.5250

R2 v1 2026-06-22T06:19:12.080Z