The Restricted Isometry Property for Random Block Diagonal Matrices (bibtex)

by A. Eftekhari, H.L. Yap, C.J. Rozell and M.B. Wakin

Abstract:

In Compressive Sensing, the Restricted Isometry Property (RIP) ensures that robust recovery of sparse vectors is possible from noisy, undersampled measurements via computationally tractable algorithms. It is by now well-known that Gaussian (or, more generally, sub-Gaussian) random matrices satisfy the RIP under certain conditions on the number of measurements. Their use can be limited in practice, however, due to storage limitations, computational considerations, or the mismatch of such matrices with certain measurement architectures. These issues have recently motivated considerable effort towards studying the RIP for structured random matrices. In this paper, we study the RIP for block diagonal measurement matrices where each block on the main diagonal is itself a sub-Gaussian random matrix. Our main result states that such matrices can indeed satisfy the RIP but that the requisite number of measurements depends on certain properties of the basis in which the signals are sparse. In the best case, these matrices perform nearly as well as dense Gaussian random matrices, despite having many fewer nonzero entries.

Reference:

The Restricted Isometry Property for Random Block Diagonal MatricesA. Eftekhari, H.L. Yap, C.J. Rozell and M.B. Wakin. Applied and Computational Harmonic Analysis, 38(1), pp. 1–31, January 2015.

Bibtex Entry:

@Article{yap.12d, author = {Eftekhari, A. and Yap, H.L. and Rozell, C.J. and Wakin, M.B.}, title = {The Restricted Isometry Property for Random Block Diagonal Matrices}, abstract = {In Compressive Sensing, the Restricted Isometry Property (RIP) ensures that robust recovery of sparse vectors is possible from noisy, undersampled measurements via computationally tractable algorithms. It is by now well-known that Gaussian (or, more generally, sub-Gaussian) random matrices satisfy the RIP under certain conditions on the number of measurements. Their use can be limited in practice, however, due to storage limitations, computational considerations, or the mismatch of such matrices with certain measurement architectures. These issues have recently motivated considerable effort towards studying the RIP for structured random matrices. In this paper, we study the RIP for block diagonal measurement matrices where each block on the main diagonal is itself a sub-Gaussian random matrix. Our main result states that such matrices can indeed satisfy the RIP but that the requisite number of measurements depends on certain properties of the basis in which the signals are sparse. In the best case, these matrices perform nearly as well as dense Gaussian random matrices, despite having many fewer nonzero entries. }, year = 2015, volume = {38}, number = {1}, month = jan, pages = {1--31}, url = {http://arxiv.org/pdf/1210.3395v2.pdf}, journal = {Applied and Computational Harmonic Analysis} }

Powered by bibtexbrowser