Pages that link to "Item:Q3546643"
From MaRDI portal
The following pages link to Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information (Q3546643):
Displayed 50 items.
- Simultaneously inpainting in image and transformed domains (Q2391126) (← links)
- Efficient block-coordinate descent algorithms for the group Lasso (Q2392933) (← links)
- A polynomial case of the cardinality-constrained quadratic optimization problem (Q2393087) (← links)
- Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property (Q2397162) (← links)
- High-dimensional change-point estimation: combining filtering with convex optimization (Q2397167) (← links)
- Recovery error analysis of noisy measurement in compressed sensing (Q2398228) (← links)
- Reconstruction of sparse signals in impulsive disturbance environments (Q2399059) (← links)
- Alternating proximal gradient method for convex minimization (Q2399191) (← links)
- Low rank tensor recovery via iterative hard thresholding (Q2400255) (← links)
- A new bound on the block restricted isometry constant in compressed sensing (Q2400748) (← links)
- Adaptive step-size matching pursuit algorithm for practical sparse reconstruction (Q2402080) (← links)
- Improved RIP conditions for compressed sensing with coherent tight frames (Q2403862) (← links)
- The modified accelerated Bregman method for regularized basis pursuit problem (Q2405606) (← links)
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing (Q2405990) (← links)
- Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields (Q2410045) (← links)
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
- Arbitrary block-sparse signal reconstruction based on incomplete single measurement vector (Q2411715) (← links)
- Compressed sensing construction for underdetermined source separation (Q2411721) (← links)
- Sparse variational Bayesian approximations for nonlinear inverse problems: applications in nonlinear elastography (Q2414583) (← links)
- Non-iterative CS recovery algorithm for surveillance applications: subjective and real-time experience (Q2415873) (← links)
- L1-norm minimization for multi-dimensional signals based on geometric algebra (Q2416610) (← links)
- Projective method of multipliers for linearly constrained convex minimization (Q2419546) (← links)
- Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model (Q2423989) (← links)
- Spatially distributed sampling and reconstruction (Q2424626) (← links)
- Correcting for unknown errors in sparse high-dimensional function approximation (Q2424851) (← links)
- Basis adaptive sample efficient polynomial chaos (BASE-PC) (Q2425254) (← links)
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions (Q2425261) (← links)
- Deterministic sampling of sparse trigonometric polynomials (Q2431334) (← links)
- Noncommutative Bennett and Rosenthal inequalities (Q2434917) (← links)
- Anomaly detection in large-scale data stream networks (Q2435710) (← links)
- RIPless compressed sensing from anisotropic measurements (Q2437334) (← links)
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures (Q2437335) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- Superiorization of EM algorithm and its application in single-photon emission computed tomography (SPECT) (Q2437932) (← links)
- Partial \(S\)-goodness for partially sparse signal recovery (Q2438325) (← links)
- Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials (Q2447624) (← links)
- Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications (Q2449220) (← links)
- Efficient algorithms for robust and stable principal component pursuit problems (Q2450901) (← links)
- A unified approach for minimizing composite norms (Q2452377) (← links)
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder). (Q2473068) (← links)
- A framelet-based image inpainting algorithm (Q2476267) (← links)
- Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization (Q2509909) (← links)
- Nesterov's algorithm solving dual formulation for compressed sensing (Q2511178) (← links)
- Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing'' (Q2511274) (← links)
- How many Fourier samples are needed for real function reconstruction? (Q2511349) (← links)
- Variations on a theorem of Candès, Romberg and Tao (Q2511495) (← links)
- Robust multi-image processing with optimal sparse regularization (Q2515365) (← links)
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation (Q2516375) (← links)
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames (Q2627887) (← links)
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)