Recovering Jointly Sparse Signals via Joint Basis Pursuit

Details Recovering Jointly Sparse Signals via Joint Basis Pursuit Recovering Jointly Sparse Signals via Joint Basis Pursuit

2012-02-16

arxiv.org/abs/1202.3531v1

Computer Science

Information Theory

8 pages, 1 figure, submitted to ISIT 2012

Scientific paper

This work considers recovery of signals that are sparse over two bases. For instance, a signal might be sparse in both time and frequency, or a matrix can be low rank and sparse simultaneously. To facilitate recovery, we consider minimizing the sum of the $\ell_1$-norms that correspond to each basis, which is a tractable convex approach. We find novel optimality conditions which indicates a gain over traditional approaches where $\ell_1$ minimization is done over only one basis. Next, we analyze these optimality conditions for the particular case of time-frequency bases. Denoting sparsity in the first and second bases by $k_1,k_2$ respectively, we show that, for a general class of signals, using this approach, one requires as small as $O(\max\{k_1,k_2\}\log\log n)$ measurements for successful recovery hence overcoming the classical requirement of $\Theta(\min\{k_1,k_2\}\log(\frac{n}{\min\{k_1,k_2\}}))$ for $\ell_1$ minimization when $k_1\approx k_2$. Extensive simulations show that, our analysis is approximately tight.

Affiliated with

Also associated with

No associations

Rating

Recovering Jointly Sparse Signals via Joint Basis Pursuit does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Recovering Jointly Sparse Signals via Joint Basis Pursuit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recovering Jointly Sparse Signals via Joint Basis Pursuit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-125122