Near-optimal sparse fourier representations via sampling

DOI10.1145/509907.509933zbMATH Open1192.94078OpenAlexW2012365979WikidataQ60204983 ScholiaQ60204983MaRDI QIDQ3579182FDOQ3579182

Authors:

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.509933

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Cited In (31)

• A note on the high-dimensional sparse Fourier transform in the continuous setting
• Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
• A simple proof of the restricted isometry property for random matrices
• Title not available (Why is that?)
• A multiscale sub-linear time Fourier algorithm for noisy data
• Testing periodicity
• List-decoding Barnes-Wall lattices
• A deterministic sparse FFT for functions with structured Fourier sparsity
• A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Combinatorial sublinear-time Fourier algorithms
• Spectral compressive sensing
• Detecting the large entries of a sparse covariance matrix in sub-quadratic time
• High-dimensional sparse Fourier algorithms
• Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games
• Compressed sensing and best \(k\)-term approximation
• Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
• Title not available (Why is that?)
• Sketching with Kerdock's crayons: fast sparsifying transforms for arbitrary linear maps
• Private multiparty sampling and approximation of vector combinations
• A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing
• What's the frequency, Kenneth?: sublinear Fourier sampling off the grid
• Book Review: A mathematical introduction to compressive sensing
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Performance of the multiscale sparse fast Fourier transform algorithm
• Compressive sensing-based wind speed estimation for low-altitude wind-shear with airborne phased array radar
• A recursive procedure for density estimation on the binary hypercube
• Periodicity and cyclic shifts via linear sketches
• Rapidly computing sparse Legendre expansions via sparse Fourier transforms
• Nuclear norm minimization for the planted clique and biclique problems
• Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation

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)