The following pages link to Compressed sensing (Q5900527):
Displaying 50 items.
- Bayesian inversion using adaptive polynomial chaos kriging within subset simulation (Q2133745) (← links)
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
- Constructing confidence intervals for the signals in sparse phase retrieval (Q2136624) (← 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)
- Neural network training using \(\ell_1\)-regularization and bi-fidelity data (Q2138992) (← links)
- Sparse filtering under bounded exogenous disturbances (Q2139473) (← 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)
- Compressive sensing of high betweenness centrality nodes in networks (Q2150293) (← links)
- Sparse signal recovery via generalized Gaussian function (Q2154451) (← links)
- Binomiality testing and computing sparse polynomials via witness sets (Q2155632) (← 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)
- Estimating shape parameters of piecewise linear-quadratic problems (Q2165586) (← links)
- Screening for a reweighted penalized conditional gradient method (Q2165597) (← links)
- Gradient projection Newton pursuit for sparsity constrained optimization (Q2168680) (← links)
- Super-resolution wavelets for recovery of arbitrarily close point-masses with arbitrarily small coefficients (Q2168684) (← links)
- The springback penalty for robust signal recovery (Q2168687) (← links)
- A solution approach for cardinality minimization problem based on fractional programming (Q2168753) (← links)
- On the robustness of noise-blind low-rank recovery from rank-one measurements (Q2168911) (← links)
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems (Q2168919) (← links)
- Property-preserving hash functions for Hamming distance from standard assumptions (Q2170070) (← links)
- Real-valued group testing for quantitative molecular assays (Q2170137) (← links)
- How can we identify the sparsity structure pattern of high-dimensional data: an elementary statistical analysis to interpretable machine learning (Q2170515) (← links)
- Complex best \(r\)-term approximations almost always exist in finite dimensions (Q2175019) (← links)
- Holographic sensing (Q2175025) (← links)
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising (Q2175442) (← links)
- A total fractional-order variation model for image super-resolution and its SAV algorithm (Q2177942) (← links)
- Tensor Bernstein concentration inequalities with an application to sample estimators for high-order moments (Q2178629) (← links)
- Stretchy binary classification (Q2179095) (← 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)
- On the volume of unit balls of finite-dimensional Lorentz spaces (Q2182910) (← links)
- Sparse probabilistic K-means (Q2185434) (← links)
- Nonlinear approximation via compositions (Q2185653) (← 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)
- Joint reconstruction in low dose multi-energy CT (Q2188157) (← links)
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm (Q2190319) (← links)
- Iterative hard thresholding for compressed data separation (Q2190470) (← links)
- A smoothing method for sparse optimization over convex sets (Q2191281) (← links)
- Learning rates for partially linear functional models with high dimensional scalar covariates (Q2191826) (← links)
- Exact asymptotic orders of various randomized widths on Besov classes (Q2191831) (← links)
- Analysis non-sparse recovery for relaxed ALASSO (Q2191835) (← links)
- Optimal nonlinear signal approximations based on piecewise constant functions (Q2192284) (← links)
- Large-scale regression with non-convex loss and penalty (Q2192647) (← links)
- Compressive total variation for image reconstruction and restoration (Q2194808) (← links)
- Deterministic construction of compressed sensing matrices from constant dimension codes (Q2197399) (← links)
