Compressive sampling
From MaRDI portal
Sampling theory, sample surveys (62D05) Image analysis in multivariate analysis (62H35) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Sampling theory in information and communication theory (94A20)
Recommendations
Cited in
(only showing first 100 items - show all)- Sparse solutions to underdetermined Kronecker product systems
- Sparse recovery from inaccurate saturated measurements
- A flexible coordinate descent method
- The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)
- Random sampling of bandlimited signals on graphs
- A hierarchical framework for recovery in compressive sensing
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression
- Time-optimal hands-off control for linear time-invariant systems
- A CS recovery algorithm for model and time delay identification of MISO-FIR systems
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Geometry of the Welch bounds
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Strengthening hash families and compressive sensing
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements
- A super-resolution direction of arrival estimation algorithm for coprime array via sparse Bayesian learning inference
- Measurement matrix optimization via mutual coherence minimization for compressively sensed signals reconstruction
- Maximum correntropy adaptation approach for robust compressive sensing reconstruction
- \textit{hp}-VPINNs: variational physics-informed neural networks with domain decomposition
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems
- Adaptive dimension-discriminative low-rank tensor recovery for computational hyperspectral imaging
- Efficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimation
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- Memoryless scalar quantization for random frames
- Image reconstruction based on improved block compressed sensing
- Random sampling and approximation of signals with bounded derivatives
- Efficiency of orthogonal super greedy algorithm under the restricted isometry property
- Atmospheric radar imaging improvements using compressed sensing and MIMO
- Complex best \(r\)-term approximations almost always exist in finite dimensions
- Bipolar measurement matrix using chaotic sequence
- Bayesian approach with extended support estimation for sparse linear regression
- Fixed-point proximity algorithms solving an incomplete Fourier transform model for seismic wavefield modeling
- A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit
- A perturbation analysis based on group sparse representation with orthogonal matching pursuit
- Efficient sensing of von Kármán vortices using compressive sensing
- Spectral compressive sensing
- Fast thresholding algorithms with feedbacks for sparse signal recovery
- A numerical exploration of compressed sampling recovery
- On rank awareness, thresholding, and MUSIC for joint sparse recovery
- A compressive sensing based privacy preserving outsourcing of image storage and identity authentication service in cloud
- Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision
- How to get high resolution results from sparse and coarsely sampled data
- Information based complexity for high dimensional sparse functions
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- Compressed-sensing-based gradient reconstruction for ghost imaging
- Sparse feature map-based Markov models for nonlinear fluid flows
- Stable recovery of low rank matrices from nuclear norm minimization
- An asymptotic existence result on compressed sensing matrices
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- Three stochastic measurement schemes for direction-of-arrival estimation using compressed sensing method
- Sparse proximal support vector machine with a specialized interior-point method
- Use of EM algorithm for data reduction under sparsity assumption
- A novel coherence reduction method in compressed sensing for DOA estimation
- Compressed sensing by inverse scale space and curvelet thresholding
- The linearized alternating direction method of multipliers for sparse group LAD model
- Randomized first order algorithms with applications to \(\ell _{1}\)-minimization
- Average case recovery analysis of tomographic compressive sensing
- Learning and estimation applications of an online homotopy algorithm for a generalization of the LASSO
- Variations on a theorem of Candès, Romberg and Tao
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- Recent advances in compressive sensing
- Dynamic mode decomposition with control
- Guarantees of Riemannian optimization for low rank matrix recovery
- Sparse sensor placement optimization for classification
- Stability and robustness of weak orthogonal matching pursuits
- Adaptive compressed image sensing using dictionaries
- Compressed Signal Processing on Nyquist-Sampled Signals
- A proximal method for composite minimization
- Linearized Bregman iterations for compressed sensing
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- Compressed sensing and dynamic mode decomposition
- MAGMA: multilevel accelerated gradient mirror descent algorithm for large-scale convex composite minimization
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- Compressive sensing. Paper from 27th Brazilian Mathematics colloquium -- 27 Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 27--31, 2009
- Structured sparsity: discrete and convex approaches
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed Sensing and Source Separation
- Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain
- A novel cognitive ISAR imaging method with random stepped frequency chirp signal
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
- Compressive imaging: an application
- The restricted isometry property for time-frequency structured random matrices
- The bounds of restricted isometry constants for low rank matrices recovery
- Sparse non Gaussian component analysis by semidefinite programming
- Theory of compressive sensing via _1-minimization: a non-RIP analysis and extensions
- The L₁ penalized LAD estimator for high dimensional linear regression
- Fast first-order methods for composite convex optimization with backtracking
- Sparse conjugate directions pursuit with application to fixed-size kernel models
- A novel sparsity reconstruction method from Poisson data for 3D bioluminescence tomography
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Mirror averaging with sparsity priors
- Convex feasibility modeling and projection methods for sparse signal recovery
- Average best \(m\)-term approximation
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries
- Computational spectral and ultrafast imaging via convex optimization
- Sparse reduced-order modelling: sensor-based dynamics to full-state estimation
- Performance Limits of Segmented Compressive Sampling: Correlated Measurements Versus Bits
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- The restricted isometry property for random block diagonal matrices
This page was built for publication: Compressive sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491042)
