Compressive Sensing
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3944477 (Why is no real title available?)
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- scientific article; zbMATH DE number 713342 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- A convergent overlapping domain decomposition method for total variation minimization
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A generalized uncertainty principle and sparse representation in pairs of bases
- A new approach to variable selection in least squares problems
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- A simple proof of the restricted isometry property for random matrices
- An introduction to frames and Riesz bases
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic Decomposition by Basis Pursuit
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed remote sensing of sparse objects
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Compressive sensing by random convolution
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
- Exact matrix completion via convex optimization
- Explicit constructions of RIP matrices and related problems
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- For most large underdetermined systems of linear equations the minimal đ1ânorm solution is also the sparsest solution
- Grassmannian frames with applications to coding and communication
- Greed is Good: Algorithmic Results for Sparse Approximation
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Handbook of the geometry of Banach spaces. Volume 1
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Iterative hard thresholding for compressed sensing
- Iteratively reweighted least squares minimization for sparse recovery
- Least angle regression. (With discussion)
- Linear Inversion of Band-Limited Reflection Seismograms
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Matching pursuits with time-frequency dictionaries
- Matrix completion from noisy entries
- NORMS OF RANDOM MATRICES AND WIDTHS OF FINITE-DIMENSIONAL SETS
- Neighborliness of randomly projected simplices in high dimensions
- New and Improved JohnsonâLindenstrauss Embeddings via the Restricted Isometry Property
- Nonlinear total variation based noise removal algorithms
- On Sparse Representations in Arbitrary Redundant Bases
- On compressive sensing applied to radar
- On signal reconstruction without phase
- On sparse reconstruction from Fourier and Gaussian measurements
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Optimal recovery and n-widths for convex classes of functions
- Optimally sparse representation in general (nonorthogonal) dictionaries via â 1 minimization
- Phase transitions for greedy sparse approximation algorithms
- Probing the Pareto frontier for basis pursuit solutions
- Random projections of regular simplices
- Random sampling of sparse trigonometric polynomials
- Rate of Convergence of Lawson's Algorithm
- Remote sensing via _1-minimization
- Restoration of Color Images by Vector Valued BV Functions and Variational Calculus
- Restricted isometries for partial random circulant matrices
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Selecting a proportion of characters
- Signal Recovery and the Large Sieve
- Sparse Approximate Solutions to Linear Systems
- Sparse representations in unions of bases
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Sparsity in time-frequency representations
- 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 application of joint sparsity and total variation minimization algorithms to a real-life art restoration problem
- The restricted isometry property and its implications for compressed sensing
- The restricted isometry property for time-frequency structured random matrices
- Uncertainty principles and ideal atomic decomposition
- Widths of embeddings in function spaces
Cited in
(21)- Compressed sensing in the spherical near-field to far-field transformation
- scientific article; zbMATH DE number 7498864 (Why is no real title available?)
- Compressed sensing in imaging mass spectrometry
- Sensitivity to Basis Mismatch in Compressed Sensing
- Optimized Projections for Compressed Sensing
- scientific article; zbMATH DE number 7128825 (Why is no real title available?)
- scientific article; zbMATH DE number 6311302 (Why is no real title available?)
- Spectral compressive sensing
- scientific article; zbMATH DE number 6312913 (Why is no real title available?)
- Theory and applications of compressed sensing
- A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game
- Compressed Sensing With Cross Validation
- Compressed sensing and dynamic mode decomposition
- Competitive optimization of compressed sensing
- Cosparsity in Compressed Sensing
- Compressed sensing of data with a known distribution
- Accelerating the Bayesian inference of inverse problems by using data-driven compressive sensing method based on proper orthogonal decomposition
- Compressed sensing with structured sparsity and structured acquisition
- Algebraic compressed sensing
- Compressed Sensing and Redundant Dictionaries
- Sensor selection via compressed sensing
This page was built for publication: Compressive Sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789803)
