Structured random measurements in signal processing

DOI10.1002/GAMM.201410010zbMath1308.94033arXiv1401.1106OpenAlexW2963798253MaRDI QIDQ4982276

Felix Krahmer, Holger Rauhut

Publication date: 24 March 2015

Published in: GAMM-Mitteilungen (Search for Journal in Brave)

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

zbMATH Keywords

matrix completionphase retrievalcompressed sensingstructured random measurements

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (7)

Low rank tensor recovery via iterative hard thresholding ⋮ Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class ⋮ Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems ⋮ Restricted isometries for partial random circulant matrices ⋮ Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials ⋮ Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation ⋮ A partial derandomization of phaselift using spherical designs

Cites Work

• The restricted isometry property for time-frequency structured random matrices
• Restricted isometries for partial random circulant matrices
• Compressive sensing of analog signals using discrete prolate spheroidal sequences
• Solving quadratic equations via phaselift when there are about as many equations as unknowns
• Compressed sensing with coherent and redundant dictionaries
• User-friendly tail bounds for sums of random matrices
• Analysis of sparse MIMO radar
• Random sampling of sparse trigonometric polynomials
• On compressive sensing applied to radar
• Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Matrix recipes for hard thresholding methods
• Simultaneous analysis of Lasso and Dantzig selector
• Phase retrieval: stability and recovery guarantees
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• On signal reconstruction without phase
• An algebraic characterization of injectivity in phase retrieval
• Absolute uniqueness of phase retrieval with random illumination
• Blind Deconvolution Using Convex Programming
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Compressed Sensing and Redundant Dictionaries
• Stable and Robust Sampling Strategies for Compressive Imaging
• Compressive Sensing
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• A Probabilistic and RIPless Theory of Compressed Sensing
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• Compressed sensing

This page was built for publication: Structured random measurements in signal processing