Two are better than one: fundamental parameters of frame coherence
From MaRDI portal
Publication:427070
DOI10.1016/j.acha.2011.09.005zbMath1246.42026arXiv1103.0435OpenAlexW2083511239MaRDI QIDQ427070
Robert Calderbank, Dustin G. Mixon, Waheed U. Bajwa
Publication date: 13 June 2012
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.0435
Related Items
Properties of real and complex ETFs and their application to the design of low coherence frames ⋮ Equiangular tight frames that contain regular simplices ⋮ Unit time-phase signal sets: bounds and constructions ⋮ Toward the classification of biangular harmonic frames ⋮ The core of a Grassmannian frame ⋮ Full spark frames ⋮ Equiangular tight frames from group divisible designs ⋮ Equiangular tight frames with centroidal symmetry ⋮ DCACO: an algorithm for designing incoherent redundant matrices ⋮ On deterministic sketching and streaming for sparse recovery and norm estimation ⋮ On block coherence of frames ⋮ Greedy subspace pursuit for joint sparse recovery ⋮ Grassmannian codes from paired difference sets ⋮ On the geometry of nearly orthogonal lattices ⋮ Frame sequences and representations for samplable random processes ⋮ Harmonic equiangular tight frames comprised of regular simplices ⋮ Equiangular tight frames and unistochastic matrices ⋮ Polyphase equiangular tight frames and abelian generalized quadrangles ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compressed sensing with coherent and redundant dictionaries
- Steiner equiangular tight frames
- On the size of incoherent systems
- A construction of spherical 2-design
- Near-ideal model selection by \(\ell _{1}\) minimization
- Geometric properties of Grassmannian frames for \(\mathbb R^2\) and \(\mathbb R^3\)
- Fourier transforms of finite chirps
- On the conditioning of random subdictionaries
- A simple proof of the restricted isometry property for random matrices
- The road to equal-norm Parseval frames
- Grassmannian frames with applications to coding and communication
- Problems and results in extremal combinatorics. I.
- Optimal frames for erasures.
- Adaptive estimation of a quadratic functional by model selection.
- Norms of random submatrices and sparse approximation
- Linear independence of Gabor systems in finite dimensional vector spaces
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Fingerprinting With Equiangular Tight Frames
- Non-asymptotic theory of random matrices: extreme singular values
- Probability Inequalities for the Sum of Independent Random Variables
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Sparse representations in unions of bases
- On beamforming with finite rate feedback in multiple-antenna systems
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- Achieving the Welch Bound With Difference Sets
- A new binary sequence family with low correlation and large size
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Complex sequences with low periodic correlations (Corresp.)
- Atomic Decomposition by Basis Pursuit
- Identification of Matrices Having a Sparse Representation
- High-Resolution Radar via Compressed Sensing
- A generalized uncertainty principle and sparse representation in pairs of bases
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Symmetric informationally complete positive-operator-valued measures: A new computer study
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Probability Inequalities for Sums of Bounded Random Variables
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- The weight enumerators for certain subcodes of the second order binary Reed-Muller codes
This page was built for publication: Two are better than one: fundamental parameters of frame coherence
