Weighted ℓ1 minimization for sparse recovery with prior information

@article{Khajehnejad2009WeightedM,
  title={Weighted ℓ1 minimization for sparse recovery with prior information},
  author={M. Amin Khajehnejad and Weiyu Xu and Amir Salman Avestimehr and Babak Hassibi},
  journal={2009 IEEE International Symposium on Information Theory},
  year={2009},
  pages={483-487}
}
In this paper we study the compressed sensing problem of recovering a sparse signal from a system of underdetermined linear equations when we have prior information about the probability of each entry of the unknown signal being nonzero. In particular, we focus on a model where the entries of the unknown vector fall into two sets, each with a different probability of being nonzero. We propose a weighted ℓ1 minimization recovery algorithm and analyze its performance using a Grassman angle… CONTINUE READING
Highly Cited
This paper has 191 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
102 Citations
16 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 102 extracted citations

191 Citations

0102030'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 191 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Mishali, “Robust recovery of signals from a union of subspace

  • Yonina Eldar, Moshe
  • (Preprint,
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…