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.
- Learning to scan: a deep reinforcement learning approach for personalized scanning in CT imaging (Q2072167) (← links)
- Two-stage geometric information guided image reconstruction (Q2072570) (← links)
- A simple recovery framework for signals with time-varying sparse support (Q2072588) (← links)
- IDPCNN: iterative denoising and projecting CNN for MRI reconstruction (Q2074885) (← links)
- Sparsest piecewise-linear regression of one-dimensional data (Q2074905) (← links)
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems (Q2079693) (← links)
- Commonsense explanations of sparsity, Zipf law, and Nash's bargaining solution (Q2086143) (← links)
- Fast and memory-optimal dimension reduction using Kac's walk (Q2090615) (← links)
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion (Q2095166) (← links)
- A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration (Q2095175) (← links)
- Improved unitary uncertainty relations (Q2102268) (← links)
- Unbiasing in iterative reconstruction algorithms for discrete compressed sensing (Q2106477) (← links)
- Compressed sensing in the spherical near-field to far-field transformation (Q2106500) (← links)
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints (Q2108537) (← links)
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions (Q2118948) (← links)
- Research on IQ imbalance error of orthogonal alternating sampling (Q2122275) (← links)
- Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery (Q2124653) (← links)
- An efficient approach for encrypting double color images into a visually meaningful cipher image using 2D compressive sensing (Q2127056) (← links)
- On the randomised stability constant for inverse problems (Q2128524) (← links)
- Generative imaging and image processing via generative encoder (Q2128594) (← links)
- Stable high-order cubature formulas for experimental data (Q2133503) (← links)
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
- On the Fourier transform of a quantitative trait: implications for compressive sensing (Q2137407) (← links)
- Sparse Bayesian learning for network structure reconstruction based on evolutionary game data (Q2137626) (← links)
- Feasibility-based fixed point networks (Q2138454) (← links)
- A new approach to sparse decomposition of nonstationary signals with multiple scale structures using self-consistent nonlinear waves (Q2147704) (← links)
- Sequential image recovery from noisy and under-sampled Fourier data (Q2149043) (← links)
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence (Q2149565) (← links)
- A novel method for nonlinear impulsive differential equations in broken reproducing kernel space (Q2153376) (← links)
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery (Q2155809) (← links)
- Reliable data transmission in wireless sensor networks with data decomposition and ensemble recovery (Q2160794) (← links)
- Inverting incomplete Fourier transforms by a sparse regularization model and applications in seismic wavefield modeling (Q2161553) (← links)
- Two-level optimization approach with accelerated proximal gradient for objective measures in sparse speech reconstruction (Q2165805) (← links)
- A hybrid quasi-Newton method with application in sparse recovery (Q2167383) (← links)
- Gradient projection Newton pursuit for sparsity constrained optimization (Q2168680) (← links)
- The springback penalty for robust signal recovery (Q2168687) (← links)
- On the robustness of noise-blind low-rank recovery from rank-one measurements (Q2168911) (← links)
- A globally convergent algorithm for a constrained non-Lipschitz image restoration model (Q2173566) (← links)
- Generalized greedy alternatives (Q2175011) (← links)
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising (Q2175442) (← links)
- Smoothing inertial projection neural network for minimization \(L_{p-q}\) in sparse signal reconstruction (Q2179318) (← links)
- An alternating minimization method for matrix completion problems (Q2182816) (← links)
- A smoothing neural network for minimization \(l_1\)-\(l_p\) in sparse signal reconstruction with measurement noises (Q2185680) (← links)
- Image restoration from noisy incomplete frequency data by alternative iteration scheme (Q2188154) (← links)
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm (Q2190319) (← links)
- A smoothing method for sparse optimization over convex sets (Q2191281) (← links)
- Analysis non-sparse recovery for relaxed ALASSO (Q2191835) (← links)
- Large-scale regression with non-convex loss and penalty (Q2192647) (← links)
- Compressive total variation for image reconstruction and restoration (Q2194808) (← links)
- Random sampling in reproducing kernel subspaces of \(L^p(\mathbb{R}^n)\) (Q2195184) (← links)