Sparsity and uniqueness for some specific under-determined linear systems

The paper extends some results on sparse representations of signals in redundant bases developed for arbitrary bases to two frequently encountered bases. The general problem is the following: given an n/spl times/m matrix, A, with m>n, and a vector, b=Ax/sub 0/, with x/sub 0/ having q<n nonzero components, find sufficient conditions for x/sub 0/ to be the unique sparsest solution to Ax=Ax/sub 0/. The answer gives an upper-bound on q depending upon A. We consider the cases where A is a Vandermonde matrix or a real Fourier matrix and the components of x/sub 0/ are known to be greater than or equal to zero. The sufficient conditions we get are much weaker than those valid for arbitrary matrices and guarantee further that x/sub 0/ can be recovered by solving a linear program.

[1]  Michael Elad,et al.  A generalized uncertainty principle and sparse representation in pairs of bases , 2002, IEEE Trans. Inf. Theory.

[2]  V. Pisarenko.  The Retrieval of Harmonics from a Covariance Function , 1973 .

[3]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[4]  J. Fuchs.  More on sparse representations in arbitrary bases , 2003 .

[5]  Jean-Jacques Fuchs,et al.  On sparse representations in arbitrary redundant bases , 2004, IEEE Transactions on Information Theory.

[6]  S. Muthukrishnan,et al.  Approximation of functions over redundant dictionaries using coherence , 2003, SODA '03.

[7]  Jean-Jacques Fuchs,et al.  On the application of the global matched filter to DOA estimation with uniform circular arrays , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[8]  Thomas Strohmer,et al.  GRASSMANNIAN FRAMES WITH APPLICATIONS TO CODING AND COMMUNICATION , 2003, math/0301135.

[9]  Rémi Gribonval,et al.  Sparse representations in unions of bases , 2003, IEEE Trans. Inf. Theory.

[10]  Thomas Kailath,et al.  Linear Systems , 1980 .

[11]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[12]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[13]  U. Grenander,et al.  Toeplitz Forms And Their Applications , 1958 .

[14]  Dmitry M. Malioutov,et al.  Optimal sparse representations in general overcomplete bases , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[15]  Xiaoming Huo,et al.  Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.