Full spark frames
type: Item
instance of: scholarly article
title: Full spark frames
zbMATH Open document ID: 1257.42040
author: Boris Alexeev
author: Jameson Cahill
author: Dustin G. Mixon
published in: The Journal of Fourier Analysis and Applications
publication date: 2013-01-29T00:00:00Z
full work available at URL: https://arxiv.org/abs/1110.3548
Mathematics Subject Classification ID: 42C15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6132228
zbMATH Keywords: frames
zbMATH Keywords: spark
zbMATH Keywords: sparsity
zbMATH Keywords: erasures
describes a project that uses: PhaseLift
MaRDI profile type: Publication
OpenAlex ID: W2022267471
arXiv ID: 1110.3548
cites work: Two are better than one: fundamental parameters of frame coherence
cites work: On signal reconstruction without phase
cites work: Painless reconstruction from magnitudes of frame coefficients
cites work: Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
cites work: The restricted isometry property and its implications for compressed sensing
cites work: Decoding by Linear Programming
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
cites work: The Kadison–Singer Problem in mathematics and engineering
cites work: Optimally Sparse Frames
cites work: Rank-deficient submatrices of Fourier matrices
cites work: Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
cites work: Q3428415
cites work: Generalized Vandermonde Determinants and Roots of Unity of Prime Order
cites work: The road to deterministic matrices with the restricted isometry property
cites work: Steiner equiangular tight frames
cites work: On Representatives of Subsets
cites work: Q4143433
cites work: Optimal frames for erasures.
cites work: A Theory for Sampling Signals From a Union of Subspaces
cites work: A parameterized view on matroid optimization problems
cites work: Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
cites work: Fingerprinting With Equiangular Tight Frames
cites work: Fast Sparse Representation Based on Smoothed ℓ0 Norm
cites work: Lower Bounds on Crosspoints in Concentrators
cites work: On the Vector Representation of Matroids
cites work: On minimization on Stiefel manifolds
cites work: Equiangular tight frames from Paley tournaments
cites work: Symmetric informationally complete quantum measurements
cites work: On sparse reconstruction from Fourier and Gaussian measurements
cites work: Chebotarëv and his density theorem
cites work: Finite frame varieties: Nonsingular points, tangent spaces, and explicit local parameterizations
cites work: A note on equiangular tight frames
cites work: Grassmannian frames with applications to coding and communication
cites work: Performance Analysis for Sparse Support Recovery
cites work: An uncertainty principle for cyclic groups of prime order
cites work: On the conditioning of random subdictionaries
cites work: NP is as easy as detecting unique solutions
cites work: Sparse Bayesian Learning for Basis Selection
cites work: Achieving the Welch Bound With Difference Sets
DOI: 10.1007/S00041-012-9235-4
description: scientific article