On block coherence of frames
From MaRDI portal
Publication:466973
DOI10.1016/J.ACHA.2014.03.003zbMATH Open1302.65097arXiv1307.7544OpenAlexW1981270255MaRDI QIDQ466973FDOQ466973
Andrew Thompson, Yao Xie, Robert Calderbank
Publication date: 3 November 2014
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1307.7544
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
Kronecker productcompressed sensingnumerical exampleblock coherenceframe constructionsGrassmann packingrandom subspacesworst-case block coherence
Cites Work
- Title not available (Why is that?)
- On the largest principal angle between random subspaces
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- Title not available (Why is that?)
- Designing structured tight frames via an alternating projection method
- Grassmannian frames with applications to coding and communication
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- On the existence of equiangular tight frames
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Steiner equiangular tight frames
- Two are better than one: fundamental parameters of frame coherence
- Kirkman Equiangular Tight Frames and Codes
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- A group-theoretic framework for the construction of packings in Grassmannian spaces
- A family of optimal packings in Grassmannian manifolds
- Constructing Packings in Grassmannian Manifolds via Alternating Projection
- Title not available (Why is that?)
- Empirical Bayes Estimation of a Sparse Vector of Gene Expression Changes
Cited In (10)
- Grassmannian codes from paired difference sets
- Title not available (Why is that?)
- Harmonic Grassmannian codes
- Constructing subspace packings from other packings
- Block sequences and g-frames
- Frame classification of the reduced labeled blocks
- Naimark-spatial families of equichordal tight fusion frames
- One-bit compressed sensing via ℓ p (0 < p < 1)-minimization method
- 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)
