On block coherence of frames

Journal article

Block coherence of matrices plays an important role in analyzing the performance of block compressed sensing recovery algorithms (Bajwa and Mixon, 2012). In this paper, we characterize two block coherence metrics: worst-case and average block coherence. First, we present lower bounds on worst-case block coherence, in both the general case and also when the matrix is constrained to be a union of orthobases. We then present deterministic matrix constructions based upon Kronecker products which obtain these lower bounds. We also characterize the worst-case block coherence of random subspaces. Finally, we present a flipping algorithm that can improve the average block coherence of a matrix, while maintaining the worst-case block coherence of the original matrix. We provide numerical examples which demonstrate that our proposed deterministic matrix construction performs well in block compressed sensing.

Authors: Calderbank, R; Thompson, A; Xie, Y

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Elsevier
• Journal: Applied and Computational Harmonic Analysis
• Volume: 38
• Issue: 1
• Pages: 50-71
• Publication date: 2015-01-01
• DOI: 10.1016/j.acha.2014.03.003
• ISSN: 1063-5203
• Keywords: random subspaces; compressed sensing; frame constructions; block coherence; grassmann packing