The following pages link to Compressed sensing (Q5900527):
Displaying 50 items.
- Self-adaptive image reconstruction inspired by insect compound eye mechanism (Q1929511) (← links)
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays (Q1929588) (← links)
- An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems (Q1932970) (← links)
- Compressed sensing and matrix completion with constant proportion of corruptions (Q1939501) (← links)
- Discussion: Latent variable graphical model selection via convex optimization (Q1940763) (← links)
- Rejoinder: Latent variable graphical model selection via convex optimization (Q1940764) (← links)
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← links)
- Accelerated linearized Bregman method (Q1945379) (← links)
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration (Q1945380) (← links)
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements (Q1946588) (← links)
- A cyclic projected gradient method (Q1946620) (← links)
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing (Q1946621) (← links)
- Bregman operator splitting with variable stepsize for total variation image reconstruction (Q1946629) (← links)
- Minimax risks for sparse regressions: ultra-high dimensional phenomenons (Q1950804) (← links)
- Detecting a vector based on linear measurements (Q1950828) (← links)
- Detection of sparse additive functions (Q1950867) (← links)
- Detection boundary in sparse regression (Q1952112) (← links)
- Reconstruction of nonuniformly sampled time-limited signals using prolate spheroidal wave functions (Q1957701) (← links)
- Compressed sensing of color images (Q1957911) (← links)
- A short note on compressed sensing with partially known signal support (Q1957941) (← links)
- Regularization in a functional reproducing kernel Hilbert space (Q1979423) (← links)
- Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling (Q1979911) (← links)
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing (Q1979938) (← links)
- An enhanced diagnosis method for weak fault features of bearing acoustic emission signal based on compressed sensing (Q1981093) (← links)
- Fake and dishonest participant location scheme in secret image sharing (Q1981244) (← links)
- Compressed sparse tensor based quadrature for vibrational quantum mechanics integrals (Q1985519) (← links)
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design (Q1985532) (← links)
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms (Q1986965) (← links)
- An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion (Q1988232) (← links)
- Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion (Q1990969) (← links)
- The landscape of empirical risk for nonconvex losses (Q1991675) (← links)
- Sparse signal inversion with impulsive noise by dual spectral projected gradient method (Q1992541) (← links)
- Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization (Q1996752) (← links)
- Rapid compressed sensing reconstruction: a semi-tensor product approach (Q1999186) (← links)
- A non-convex regularization approach for compressive sensing (Q2000486) (← links)
- A performance guarantee for orthogonal matching pursuit using mutual coherence (Q2003290) (← links)
- Sparse approximate reconstruction decomposed by two optimization problems (Q2003320) (← links)
- Sparse system identification for stochastic systems with general observation sequences (Q2003800) (← links)
- Measurement matrix optimization via mutual coherence minimization for compressively sensed signals reconstruction (Q2004244) (← links)
- Maximum correntropy adaptation approach for robust compressive sensing reconstruction (Q2004743) (← links)
- A simple and feasible method for a class of large-scale \(l^1\)-problems (Q2006233) (← links)
- Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing (Q2006439) (← links)
- Sparse principal component analysis via fractional function regularity (Q2007153) (← links)
- A new linearized split Bregman iterative algorithm for image reconstruction in sparse-view X-ray computed tomography (Q2007198) (← links)
- An alternative adaptive method for seismic data denoising and interpolation (Q2007346) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes (Q2008183) (← links)
- Rate optimal estimation and confidence intervals for high-dimensional regression with missing covariates (Q2008214) (← links)
- 2D compressed learning: support matrix machine with bilinear random projections (Q2008636) (← links)
- An improved algorithm for basis pursuit problem and its applications (Q2009392) (← links)
