Full spark frames

DOI10.1007/S00041-012-9235-4zbMath1257.42040arXiv1110.3548OpenAlexW2022267471MaRDI QIDQ1934656

Jameson Cahill, Dustin G. Mixon, Boris Alexeev

Publication date: 29 January 2013

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

framessparsitysparkerasures

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (55)

Nilpotent bridging for unions of two bases ⋮ Phase retrieval via polarization in dynamical sampling ⋮ The Paulsen problem made simple ⋮ Full-spark frames arising from one-parameter groups ⋮ On structural decompositions of finite frames ⋮ Reconstruction of signals from magnitudes of redundant representations: the complex case ⋮ A Quiver Invariant Theoretic Approach to Radial Isotropy and the Paulsen Problem for Matrix Frames ⋮ Dihedral group frames which are maximally robust to erasures ⋮ Maximum robustness and surgery of frames in finite dimensions ⋮ Equiangular tight frames that contain regular simplices ⋮ Parseval transforms for finite frames ⋮ Surgery of frames in Hilbert spaces ⋮ Equiangular tight frames with simplices and with full spark in \(\mathbb{R}^d\) ⋮ Toric symplectic geometry and full spark frames ⋮ A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing ⋮ Phase retrieval of real-valued signals in a shift-invariant space ⋮ Sparsity and spectral properties of dual frames ⋮ Connectivity and Irreducibility of Algebraic Varieties of Finite Unit Norm Tight Frames ⋮ Towards a classification of incomplete Gabor POVMs in ℂ ^d ⋮ On root frames in \(\mathbb{R}^d\) ⋮ Characterization of (weak) phase retrieval dual frames ⋮ Optimal Parseval frames: total coherence and total volume ⋮ Dual frames compensating for erasures -- a non-canonical case ⋮ Robust Phase Retrieval Algorithm for Time-Frequency Structured Measurements ⋮ Matrix methods for perfect signal recovery underlying range space of operators ⋮ Time-frequency analysis on flat tori and Gabor frames in finite dimensions ⋮ Bridging erasures and the infrastructure of frames ⋮ Full spark frames in the orbit of a representation ⋮ Fusion frame homotopy and tightening fusion frames by gradient descent ⋮ Riesz bases of exponentials on unbounded multi-tiles ⋮ Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain ⋮ Processing of sparse signals and mutual coherence of ``measurable vectors ⋮ Numerically erasure-robust frames ⋮ Balanced frames: a useful tool in signal processing with good properties ⋮ Smoothness in Some Varieties with Dihedral Symmetry and the DFT Matrix ⋮ Prime tight frames ⋮ Phase retrieval from very few measurements ⋮ The road to deterministic matrices with the restricted isometry property ⋮ Spark-level sparsity and the \(\ell_1\) tail minimization ⋮ Uniform excess frames in Hilbert spaces ⋮ Saving phase: injectivity and stability for phase retrieval ⋮ Sparse matrices in frame theory ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Symplectic geometry and connectivity of spaces of frames ⋮ Unnamed Item ⋮ Tight and full spark Chebyshev frames with real entries and worst-case coherence analysis ⋮ An effective algorithm for the spark of sparse binary measurement matrices ⋮ A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing ⋮ Signal reconstruction from frame and sampling erasures ⋮ Full spark frames and totally positive matrices ⋮ Erasure recovery matrices for encoder protection ⋮ Safe feature elimination for non-negativity constrained convex optimization ⋮ ABOUT THE SYSTEMS WITH FULL SPARK ⋮ Preserving injectivity under subgaussian mappings and its application to compressed sensing ⋮ Group-theoretic constructions of erasure-robust frames

Uses Software

• PhaseLift

Cites Work

• Unnamed Item
• Unnamed Item
• Two are better than one: fundamental parameters of frame coherence
• The road to deterministic matrices with the restricted isometry property
• Finite frame varieties: Nonsingular points, tangent spaces, and explicit local parameterizations
• Steiner equiangular tight frames
• The restricted isometry property and its implications for compressed sensing
• A note on equiangular tight frames
• On the conditioning of random subdictionaries
• Rank-deficient submatrices of Fourier matrices
• Equiangular tight frames from Paley tournaments
• A parameterized view on matroid optimization problems
• Painless reconstruction from magnitudes of frame coefficients
• NP is as easy as detecting unique solutions
• Chebotarëv and his density theorem
• Grassmannian frames with applications to coding and communication
• Optimal frames for erasures.
• An uncertainty principle for cyclic groups of prime order
• On minimization on Stiefel manifolds
• On signal reconstruction without phase
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• Fingerprinting With Equiangular Tight Frames
• The Kadison–Singer Problem in mathematics and engineering
• On sparse reconstruction from Fourier and Gaussian measurements
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Achieving the Welch Bound With Difference Sets
• Fast Sparse Representation Based on Smoothed ℓ0 Norm
• Lower Bounds on Crosspoints in Concentrators
• Generalized Vandermonde Determinants and Roots of Unity of Prime Order
• A Theory for Sampling Signals From a Union of Subspaces
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• On Representatives of Subsets
• Symmetric informationally complete quantum measurements
• Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
• Performance Analysis for Sparse Support Recovery
• Optimally Sparse Frames
• Sparse Bayesian Learning for Basis Selection
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• On the Vector Representation of Matroids

This page was built for publication: Full spark frames