Near-optimal sparse fourier representations via sampling
From MaRDI portal
Cited in
(36)- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Private multiparty sampling and approximation of vector combinations
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- A simple proof of the restricted isometry property for random matrices
- A recursive procedure for density estimation on the binary hypercube
- A deterministic sparse FFT for functions with structured Fourier sparsity
- High-dimensional sparse Fourier algorithms
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
- Spectral compressive sensing
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- List-decoding Barnes-Wall lattices
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
- A multiscale sub-linear time Fourier algorithm for noisy data
- Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games
- Compressed sensing and best \(k\)-term approximation
- Periodicity and cyclic shifts via linear sketches
- Book Review: A mathematical introduction to compressive sensing
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time
- A note on the high-dimensional sparse Fourier transform in the continuous setting
- Sketching with Kerdock's crayons: fast sparsifying transforms for arbitrary linear maps
- Estimating the frequency of a clustered signal
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
- Testing periodicity
- scientific article; zbMATH DE number 7053345 (Why is no real title available?)
- Performance of the multiscale sparse fast Fourier transform algorithm
- Deterministic sparse Fourier transform with an _ guarantee
- Sparse recovery for orthogonal polynomial transforms
- Sparse spectral methods for solving high-dimensional and multiscale elliptic PDEs
- Structured measurement matrices based on deterministic Fourier matrices and Gram matrices
- Nuclear norm minimization for the planted clique and biclique problems
- Optimal Extrapolation Bounds for Sparse Fourier Sums
- What's the frequency, Kenneth?: sublinear Fourier sampling off the grid
- Compressive sensing-based wind speed estimation for low-altitude wind-shear with airborne phased array radar
- A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation
- Combinatorial sublinear-time Fourier algorithms
This page was built for publication: Near-optimal sparse fourier representations via sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579182)
