In this paper, we mainly study the subframe condition numbers of numerically erasure-robust frames, which can be used in signal processing, and establish a comparison theorem on the condition numbers of different frames, which can be applied to inverse problems for signal processing.
You will need Adobe Acrobat reader. For more information and free download of the reader, please follow this link.
References
[1] M. Fickus, J. Jasper, D.G. Mixon, and J. Peterson, Grouptheoretic constructions of erasure-robust frames, Linear Algebra and its Applications,
479 (2015), 131-154.
[2] M. Fickus and D.G. Mixon, Numerically erasure-robust frames, Linear
Algebra and its Applications, 437, No 6 (2012), 1394-1407.
[3] R. Gribonval and M. Nielsen, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Applied and
Computational Harmonic Analysis, 22, No 3 (2007), 335-355.
[4] M.J. Lai and Y. Liu,The probabilistic estimates on the largest and smallest
q-singular values of random matrices, Mathematics of Computation, 84, No
294 (2015), 1775-1794.
[5] Y. Liu, Probabilistic estimates of the largest strictly convex singular values
of pregaussian random matrices, Journal of Mathematics and Statistics,
11, No 1 (2015), 7-15.
[6] Y. Liu and Y. Wang, On the decay of the smallest singular value of submatrices of rectangular matrices, Asian-European Journal of Mathematics, 9,
No 4 (2016), # 1650075.
[7] H. Ohlsson, A. Yang, R. Dong, and S. Sastry, Cprl–an extension of compressive sensing to the phase retrieval problem, In: Advances in Neural
Information Processing Systems (2012), 1367-1375.
[8] M. Rudelson and R. Vershynin, Non-asymptotic theory of random matrices: Extreme singular values, In: Proc. of the International Congress of
Mathematicians 2010 (ICM 2010), In 4 Volumes: Vol. I: Plenary Lectures
and Ceremonies, Vols. II–IV: Invited Lectures, 1576-1602, World Scientific,
2010.