On block coherence of frames

DOI10.1016/J.ACHA.2014.03.003MaRDI QIDQ466973zbMATH OpenOpenAlexFDO

Authors Robert Calderbank, Andrew Thompson, Yao Xie

Publication date 3 November 2014

Published in Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1307.7544

zbMATH Keywords

Kronecker productcompressed sensingnumerical exampleblock coherenceframe constructionsGrassmann packingrandom subspacesworst-case block coherence

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) General harmonic expansions, frames (42C15)

Abstract: 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.

Recommendations

• Two are better than one: fundamental parameters of frame coherence
• Deterministic constructions of compressed sensing matrices
• Three deterministic constructions of compressed sensing matrices with low coherence
• A note on block-sparse signal recovery with coherent tight frames
• Frames for compressed sensing using coherence

Cites work

• scientific article; zbMATH DE number 3150170 (Why is no real title available?)
• scientific article; zbMATH DE number 3428111 (Why is no real title available?)
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• A family of optimal packings in Grassmannian manifolds
• A group-theoretic framework for the construction of packings in Grassmannian spaces
• Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• Compressed sensing
• Constructing Packings in Grassmannian Manifolds via Alternating Projection
• Designing structured tight frames via an alternating projection method
• Empirical Bayes Estimation of a Sparse Vector of Gene Expression Changes
• Grassmannian frames with applications to coding and communication
• Kirkman Equiangular Tight Frames and Codes
• Lower bounds on the maximum cross correlation of signals (Corresp.)
• On the existence of equiangular tight frames
• On the largest principal angle between random subspaces
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Steiner equiangular tight frames
• Two are better than one: fundamental parameters of frame coherence
• Z₄ -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets

Cited in

(10)

• Naimark-spatial families of equichordal tight fusion frames
• Harmonic Grassmannian codes
• One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
• Constructing subspace packings from other packings
• Grassmannian codes from paired difference sets
• scientific article; zbMATH DE number 7031437 (Why is no real title available?)
• Block sequences and g-frames
• Frame classification of the reduced labeled blocks
• Families of optimal packings in real and complex Grassmannian spaces
• Bayesian uncertainty quantification for low-rank matrix completion

This page was built for publication: On block coherence of frames

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466973)