An Open Problem on Sparse Representations in Unions of Bases

We consider sparse representations of signals from redundant dictionaries which are unions of several orthonormal bases. The spark introduced by Donoho and Elad plays an important role in sparse representations. However, numerical computations of sparks are generally combinatorial. For unions of several orthonormal bases, two lower bounds on the spark via the mutual coherence were established in previous work. We constructively prove that both of them are tight. Our main results give positive answers to Gribonval and Nielsen’s open problem on sparse representations in unions of orthonormal bases. Constructive proofs rely on a family of mutually unbiased bases which first appears in quantum information theory. Index Terms Sparse Approximation, Spark, Mutual Coherence, Latin Squares, Mutually Unbiased Bases.

[1]  F. Krahmer,et al.  Uncertainty in time–frequency representations on finite Abelian groups and applications , 2006, math/0611493.

[2]  Mátyás A. Sustik,et al.  On the existence of equiangular tight frames , 2007 .

[3]  Tao Feng,et al.  The Shift Bound for Abelian Codes and Generalizations of the Donoho-Stark Uncertainty Principle , 2018, IEEE Transactions on Information Theory.

[4]  J. Sylvester.  LX. Thoughts on inverse orthogonal matrices, simultaneous signsuccessions, and tessellated pavements in two or more colours, with applications to Newton's rule, ornamental tile-work, and the theory of numbers , 1867 .

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

[6]  S. Agaian.  Hadamard Matrices and Their Applications , 1985 .

[7]  Emmanuel J. Candès,et al.  Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions , 2004, Found. Comput. Math..

[8]  Bart Preneel,et al.  A new inequality in discrete Fourier theory , 2003, IEEE Trans. Inf. Theory.

[9]  D. Donoho,et al.  Uncertainty principles and signal recovery , 1989 .

[10]  Maurice R. Kibler,et al.  Quantum Information: A Brief Overview and Some Mathematical Aspects , 2018, Mathematics.

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

[12]  J. Dénes,et al.  Latin squares and their applications , 1974 .

[13]  Lie Wang,et al.  Stable Recovery of Sparse Signals and an Oracle Inequality , 2010, IEEE Transactions on Information Theory.

[14]  Pawel Wocjan,et al.  New construction of mutually unbiased bases in square dimensions , 2005, Quantum Inf. Comput..

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

[16]  T. Tao.  An uncertainty principle for cyclic groups of prime order , 2003, math/0308286.

[17]  T. Blumensath,et al.  Theory and Applications , 2011 .

[18]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[19]  R. Gribonval,et al.  Highly sparse representations from dictionaries are unique and independent of the sparseness measure , 2007 .

[20]  S. Chaturvedi.  Mutually unbiased bases , 2002 .

[21]  Michael Elad,et al.  From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images , 2009, SIAM Rev..

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

[23]  Michael Elad,et al.  Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[24]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.