Conference proceeding
Weighted ℓ1 minimization for sparse recovery with prior information
2009 IEEE International Symposium on Information Theory, pp.483-487
06/2009
DOI: 10.1109/ISIT.2009.5205716
Abstract
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 approach. We compute explicitly the relationship between the system parameters (the weights, the number of measurements, the size of the two sets, the probabilities of being non-zero) so that an iid random Gaussian measurement matrix along with weighted ¿ 1 minimization recovers almost all such sparse signals with overwhelming probability as the problem dimension increases. This allows us to compute the optimal weights. We also provide simulations to demonstrate the advantages of the method over conventional ¿ 1 optimization.
Details
- Title: Subtitle
- Weighted ℓ1 minimization for sparse recovery with prior information
- Creators
- M Amin Khajehnejad - Caltech EE, Pasadena, CA, USAWeiyu Xu - California Institute of TechnologyA. Salman Avestimehr - Caltech CMI, Pasadena, CA, USABabak Hassibi - California Institute of Technology
- Resource Type
- Conference proceeding
- Publication Details
- 2009 IEEE International Symposium on Information Theory, pp.483-487
- DOI
- 10.1109/ISIT.2009.5205716
- ISSN
- 2157-8095
- eISSN
- 2157-8117
- Publisher
- IEEE
- Language
- English
- Date published
- 06/2009
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984197424902771
Metrics
14 Record Views