Restricted isometries for partial random circulant matrices
The theory of compressed sensing, e.g.[\textit{J.-M. Azais} and \textit{M. Wschebor}, Level sets and extrema of random processes and fields. Hoboken, NJ: John Wiley \& Sons (2009; Zbl 1168.60002)] predicts that a small number of linear samples suffice to capture all the information in a sparse vector and that it is possible to recover the sparse vector from these samples using efficient algorithm. The linear data acquisition process is described by a measurement matrix. The restricted isometry property [\textit{E. J. Candès, J. K. Romberg} and \textit{T. Tao}, Commun. Pure Appl. Math. 59, No. 8, 1207--1223 (2006; Zbl 1098.94009)] is a standard tool for studying how efficiently this matrix captures information about sparse signals.NEWLINENEWLINE Many potential applications of compressed sensing involve sampling processes that can be modeled by convolution with a random pulse. This random process can be modeled using a random circulant matrix. When only a limited number of samples from the output of the convolution is retained then the measurement process is described by a partial random circulant matrix. So far, the best available analysis of a partial random circulant matrix suggests that its restricted isometry constants do not exhibit optimal scaling. This work describes a new analysis that dramatically improves the previous estimates. It is shown that the \(s\)th-order restricted isometry constant is small when the number \(m\) of samples satisfies the condition \(m > \sim(s \text{log}n)^{3/2}\), where \(n\) is the length of the pulse.
- Sparse reconstruction with multiple Walsh matrices
- Improved bounds for the RIP of subsampled circulant matrices
- Structured random measurements in signal processing
- Deterministic bounds for restricted isometry in compressed sensing matrices
- Deterministic convolutional compressed sensing matrices
- RIPless compressed sensing from anisotropic measurements
- Compressed sensing and -quantization
- Restricted isometry properties and nonconvex compressive sensing
- Error estimates for orthogonal matching pursuit and random dictionaries
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- A simple proof of the restricted isometry property for random matrices
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices
- Atomic Decomposition by Basis Pursuit
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Compressed Sensing and Redundant Dictionaries
- Compressive sensing
- Compressive sensing and structured random matrices
- Compressive sensing by random convolution
- Concentration inequalities using the entropy method
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Greed is Good: Algorithmic Results for Sparse Approximation
- Hard thresholding pursuit: an algorithm for compressive sensing
- High-Resolution Radar via Compressed Sensing
- scientific article; zbMATH DE number 3944477 (Why is no real title available?)
- scientific article; zbMATH DE number 3772326 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
- Iterative hard thresholding for compressed sensing
- Level Sets and Extrema of Random Processes and Fields
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- On sparse reconstruction from Fourier and Gaussian measurements
- Operator Khintchine inequality in non-commutative probability
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Shifting Inequality and Recovery of Sparse Signals
- Sparse Approximate Solutions to Linear Systems
- Sparse Legendre expansions via _1-minimization
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Stability Results for Random Sampling of Sparse Trigonometric Polynomials
- Stable signal recovery from incomplete and inaccurate measurements
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- The Generic Chaining
- The restricted isometry property and its implications for compressed sensing
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
- Improved bounds for sparse recovery from subsampled random convolutions
- An enhanced diagnosis method for weak fault features of bearing acoustic emission signal based on compressed sensing
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets
- Quantized compressed sensing for random circulant matrices
- Preconditioning filter bank decomposition using structured normalized tight frames
- New analysis of manifold embeddings and signal recovery from compressive measurements
- Recovery error analysis of noisy measurement in compressed sensing
- Quantization of compressive samples with stable and robust recovery
- Restricted isometry property for random matrices with heavy-tailed columns
- Fast and RIP-optimal transforms
- Compressive Sensing
- Theory and applications of compressed sensing
- Suprema of chaos processes and the restricted isometry property
- Design of an ordered Gaussian circular measurement matrix and analysis of its property
- Compressed sensing: how sharp is the restricted isometry property?
- Deterministic convolutional compressed sensing matrices
- Improved bounds for the RIP of subsampled circulant matrices
- A novel compressed sensing scheme for photoacoustic tomography
- Compressive sensing with redundant dictionaries and structured measurements
- Sparse model uncertainties in compressed sensing with application to convolutions and sporadic communication
- Cosparsity in Compressed Sensing
- Compressive sensing by random convolution
- The restricted isometry property for time-frequency structured random matrices
- The Restricted Isometry Property for Banded Random Matrices
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Time for dithering: fast and quantized random embeddings via the restricted isometry property
- The restricted isometry property for random block diagonal matrices
- Learning circulant sensing kernels
- Structured random measurements in signal processing
- One-bit compressed sensing with partial Gaussian circulant matrices
- Signal analysis based on complex wavelet signs
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Quasi-linear compressed sensing
- Super-sparse tri-value circulant measurement matrices design
- LONELY RUNNERS IN FUNCTION FIELDS
- Compressive time-of-flight 3D imaging using block-structured sensing matrices
- Compressive imaging through optical fiber with partial speckle scanning
- Randomized numerical linear algebra: Foundations and algorithms
- Enhanced total variation minimization for stable image reconstruction
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices
- Bisparse blind deconvolution through hierarchical sparse recovery
- Training multi-layer over-parametrized neural network in subquadratic time
- On log-concave-tailed chaoses and the restricted isometry property
- Sparse recovery from group orbits
This page was built for publication: Restricted isometries for partial random circulant matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412402)
