scientific article; zbMATH DE number 5057540
From MaRDI portal
zbMath1130.94013MaRDI QIDQ5491042
Publication date: 26 September 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Image analysis in multivariate analysis (62H35) Sampling theory, sample surveys (62D05) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Sampling theory in information and communication theory (94A20)
Related Items
Use of EM algorithm for data reduction under sparsity assumption, Sparse recovery from inaccurate saturated measurements, A proximal method for composite minimization, A novel coherence reduction method in compressed sensing for DOA estimation, A flexible coordinate descent method, Compressed sensing and dynamic mode decomposition, Sparse high-dimensional FFT based on rank-1 lattice sampling, Compressed sensing SAR imaging based on sparse representation in fractional Fourier domain, A novel cognitive ISAR imaging method with random stepped frequency chirp signal, The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\), Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization, 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, Complex best \(r\)-term approximations almost always exist in finite dimensions, Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions, The \(L_1\) penalized LAD estimator for high dimensional linear regression, Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays, Strengthening hash families and compressive sensing, Fast first-order methods for composite convex optimization with backtracking, Random sampling of bandlimited signals on graphs, A hierarchical framework for recovery in compressive sensing, Sparse conjugate directions pursuit with application to fixed-size kernel models, Sparse representation based Fisher discrimination dictionary learning for image classification, Phase transitions for greedy sparse approximation algorithms, A novel sparsity reconstruction method from Poisson data for 3D bioluminescence tomography, On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization, Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements, An implementable proximal point algorithmic framework for nuclear norm minimization, Limiting empirical singular value distribution of restrictions of discrete Fourier transform matrices, Bipolar measurement matrix using chaotic sequence, Mirror averaging with sparsity priors, Convex feasibility modeling and projection methods for sparse signal recovery, Average best \(m\)-term approximation, Idempotents and compressive sampling, Bayesian approach with extended support estimation for sparse linear regression, Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression, Time-optimal hands-off control for linear time-invariant systems, Image decoding optimization based on compressive sensing, The restricted isometry property for random block diagonal matrices, Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions, Compressed classification learning with Markov chain samples, 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, Sparse dual frames and dual Gabor functions of minimal time and frequency supports, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, A perturbation analysis based on group sparse representation with orthogonal matching pursuit, A CS recovery algorithm for model and time delay identification of MISO-FIR systems, Expectation propagation in linear regression models with spike-and-slab priors, Linear versus non-linear acquisition of step-functions, A remark on compressed sensing, Sparse and nonnegative sparse D-MORPH regression, Efficient sensing of von Kármán vortices using compressive sensing, Sparse decomposition by iterating Lipschitzian-type mappings, Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset, Compressed sensing from a harmonic analysis point of view, Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\), Data based identification and prediction of nonlinear and complex dynamical systems, Spectral compressive sensing, Fast thresholding algorithms with feedbacks for sparse signal recovery, Geometry of the Welch bounds, The null space property for sparse recovery from multiple measurement vectors, 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, Sparse approximate solution of partial differential equations, A box constrained gradient projection algorithm for compressed sensing, A numerical exploration of compressed sampling recovery, On support sizes of restricted isometry constants, A convergent overlapping domain decomposition method for total variation minimization, Alternating direction method of multipliers for penalized zero-variance discriminant analysis, \textit{hp}-VPINNs: variational physics-informed neural networks with domain decomposition, On the size of incoherent systems, On rank awareness, thresholding, and MUSIC for joint sparse recovery, Adaptive multiscale model reduction with generalized multiscale finite element methods, New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints, A compressive sensing based privacy preserving outsourcing of image storage and identity authentication service in cloud, GPU accelerated greedy algorithms for compressed sensing, Matrix-free interior point method for compressed sensing problems, Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision, Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems, Information based complexity for high dimensional sparse functions, 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, Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions, Image reconstruction based on improved block compressed sensing, Optimal subgradient methods: computational properties for large-scale linear inverse problems, Random sampling and approximation of signals with bounded derivatives, Efficiency of orthogonal super greedy algorithm under the restricted isometry property, Compressed-sensing-based gradient reconstruction for ghost imaging, Sparse solutions to underdetermined Kronecker product systems, Sparse feature map-based Markov models for nonlinear fluid flows, Stable recovery of low rank matrices from nuclear norm minimization, Atmospheric radar imaging improvements using compressed sensing and MIMO, 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, Effect of sensing matrices on quality index parameters for block sparse bayesian learning-based EEG compressive sensing, Sparse Sensing and DMD-Based Identification of Flow Regimes and Bifurcations in Complex Flows, WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions, Compressed sensing by inverse scale space and curvelet thresholding, MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization, A survey on compressive sensing: classical results and recent advancements, Structured Sparsity: Discrete and Convex Approaches, 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, High-dimensional sparse FFT based on sampling along multiple rank-1 lattices, Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms, On sparse approximations of solutions to linear systems with orthogonal matrices, A theory of capacity and sparse neural encoding, The linearized alternating direction method of multipliers for sparse group LAD model, DOA estimation using GRNN for acoustic sensor arrays, Faster randomized block sparse Kaczmarz by averaging, Scaled proximal gradient methods for sparse optimization problems, On sparse reconstruction from Fourier and Gaussian measurements, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, 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, Short-Term Memory Capacity in Networks via the Restricted Isometry Property, Stability analysis of a class of sparse optimization problems, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, A globally convergent gradient-like method based on the Armijo line search, Search for Sparse Active Inputs: A Review, IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems, Linearized Bregman iterations for compressed sensing, Convergence of the linearized Bregman iteration for ℓ₁-norm minimization, Dynamic Mode Decomposition with Control, Chaotic Binary Sensing Matrices, Compressed Sensing and Source Separation, Variations on a theorem of Candès, Romberg and Tao, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery, Analysis of Quantization Noise Spectrum in Signal Reconstruction, Constrained sparse Galerkin regression, Sparse Sensor Placement Optimization for Classification, Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization, Variable Metric Forward-Backward Algorithm for Composite Minimization Problems, Stability and Robustness of Weak Orthogonal Matching Pursuits, Sparse recovery with general frame via general-dual-based analysis Dantzig selector, Unnamed Item
