By Topic

Analyzing Weighted \ell _1 Minimization for Sparse Recovery With Nonuniform Sparse Models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
M. Amin Khajehnejad ; California Institute of Technology, Pasadena ; Weiyu Xu ; A. Salman Avestimehr ; Babak Hassibi

In this paper, we introduce a nonuniform sparsity model and analyze the performance of an optimized weighted ℓ1 minimization over that sparsity model. In particular, we focus on a model where the entries of the unknown vector fall into two sets, with entries of each set having a specific probability of being nonzero. We propose a weighted ℓ1 minimization recovery algorithm and analyze its performance using a Grassmann 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 nonzero-so that when i.i.d. random Gaussian measurement matrices are used, the weighted ℓ1 minimization recovers a randomly selected signal drawn from the considered sparsity model with overwhelming probability as the problem dimension increases. This allows us to compute the optimal weights. We demonstrate through rigorous analysis and simulations that for the case when the support of the signal can be divided into two different subclasses with unequal sparsity fractions, the weighted ℓ1 minimization outperforms the regular ℓ1 minimization substantially. We also generalize our results to signal vectors with an arbitrary number of subclasses for sparsity.

Published in:

IEEE Transactions on Signal Processing  (Volume:59 ,  Issue: 5 )