Deterministic Constructions of Compressed Sensing Matrices From Unitary Geometry.

Compressed sensing is an emerging theory of signal processing and it has wide applications in many frontier fields. The construction of the measurement matrices is still a central problem in compressed sensing. In this paper, two types of deterministic constructions of binary measurement matrices are presented via unitary geometry. Then, the lower bounds of the spark of unitary geometry measurement matrices are theoretically analyzed, and an asymptotic comparison between unitary geometry measurement matrices and projective geometry measurement matrices is given via the worst-case recovery capability. After that, a clipping-embedding operation is proposed for binary matrices to generate measurement matrices with more sizes, which can strongly extend the applicability of the deterministic binary matrices in practice. Finally, simulation results demonstrate that the performance of our measurement matrices is comparable to, sometimes even better than, that of the corresponding Gaussian random matrices under OMP and BP. [ABSTRACT FROM AUTHOR]