From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
From MaRDI portal
Publication:3614217
DOI10.1137/060657704zbMath1178.68619WikidataQ60547114 ScholiaQ60547114MaRDI QIDQ3614217
David L. Donoho, Alfred Marcel Bruckstein, Michael Elad
Publication date: 16 March 2009
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/63c53e35b25e09a3432e4f4dd786f5d539304f30
inverse problems; compression; underdetermined; denoising; sparse representation; mutual coherence; dictionary learning; linear system of equations; sparse coding; matching pursuit; basis pursuit; redundant; overcomplete; sparse-land
90C25: Convex programming
68U10: Computing methodologies for image processing
94A08: Image processing (compression, reconstruction, etc.) in information and communication theory
15A29: Inverse problems in linear algebra
15A06: Linear equations (linear algebraic aspects)
Related Items
The Little Engine that Could: Regularization by Denoising (RED), Analysis of a nonsmooth optimization approach to robust estimation, Nomonotone spectral gradient method for sparse recovery, Redundancy of fusion frames in Hilbert spaces, Computing and analyzing recoverable supports for sparse reconstruction, Wavelet inpainting with the \(\ell_{0}\) sparse regularization, Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity, Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets, A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron, Sparse solutions of linear complementarity problems, Split Bregman algorithms for sparse group lasso with application to MRI reconstruction, 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory, Robust classifier using distance-based representation with square weights, Tomographic image reconstruction using training images, Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations, A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions, Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies, A variational approach of the rank function, An efficient sparse channel estimator combining time-domain LS and iterative shrinkage for OFDM systems with IQ-imbalances, Recent advances in mathematical programming with semi-continuous variables and cardinality constraint, Restricted normal cones and sparsity optimization with affine constraints, Sparse conjugate directions pursuit with application to fixed-size kernel models, On the representation of functions with Gaussian wave packets, New bounds for RIC in compressed sensing, An infeasible-point subgradient method using adaptive approximate projections, Sparse recovery on Euclidean Jordan algebras, Coupled model and grid adaptivity in hierarchical reduction of elliptic problems, Sparse time-frequency representation of nonlinear and nonstationary data, A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging, Foveated compressive imaging for low power vehicle fingerprinting and tracking in aerial imagery, A modified greedy analysis pursuit algorithm for the cosparse analysis model, Sparse decomposition by iterating Lipschitzian-type mappings, Image reconstruction using analysis model prior, Sparse signal recovery using a new class of random matrices, A quantitative notion of redundancy for finite frames, The null space property for sparse recovery from multiple measurement vectors, The projected GSURE for automatic parameter tuning in iterative shrinkage methods, Observability for initial value problems with sparse initial data, Identification of switched linear systems via sparse optimization, Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing, A non-adapted sparse approximation of PDEs with stochastic inputs, A semidefinite programming study of the Elfving theorem, Adaptive algorithms for sparse system identification, Phase transitions for greedy sparse approximation algorithms, Sparse representations and approximation theory, Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions, A note on the complexity of \(L _{p }\) minimization, An inverse problem in reaction kinetics, Sparse fusion frames: existence and construction, Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty, Analysis of convergence for the alternating direction method applied to joint sparse recovery, Spectral dynamics and regularization of incompletely and irregularly measured data, Smoothing methods for nonsmooth, nonconvex minimization, A tensor-based dictionary learning approach to tomographic image reconstruction, Enhancing sparsity of Hermite polynomial expansions by iterative rotations, On some deterministic dictionaries supporting sparsity, Iterative hard thresholding based on randomized Kaczmarz method, A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization, Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach, Column subset selection via sparse approximation of SVD, Non-convex sparse regularisation, Sampling in the analysis transform domain, Sparse approximate solution of partial differential equations, Concave programming for minimizing the zero-norm over polyhedral sets, Convex optimization of measurement allocation for magnetic tracking systems, Equiangular tight frames that contain regular simplices, Prior model identification during subsurface flow data integration with adaptive sparse representation techniques, The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\), A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints, Peaceman-Rachford splitting for a class of nonconvex optimization problems, Sparse causality network retrieval from short time series, Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries, A two-level method for sparse time-frequency representation of multiscale data, Entropy dimension reduction method for randomized machine learning problems, The nonlocal sparse reconstruction algorithm by similarity measurement with shearlet feature vector, The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm, Total variation image restoration method based on subspace optimization, Analysis sparse representation for nonnegative signals based on determinant measure by DC programming, A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem, On Glowinski's open question on the alternating direction method of multipliers, Blind identification of fully observed linear time-varying systems via sparse recovery, Learning semidefinite regularizers, DC formulations and algorithms for sparse optimization problems, Dictionary evaluation and optimization for sparse coding based speech processing, Iterative reweighted methods for \(\ell _1-\ell _p\) minimization, Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach, Sparse feedback design in discrete-time linear systems, An efficient algorithm for learning dictionary under coherence constraint, Learning sparse FRAME models for natural image patterns, Structured overcomplete sparsifying transform learning with convergence guarantees and applications, Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays, An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography, Sparse signal recovery via ECME thresholding pursuits, Restricted \(p\)-isometry properties of partially sparse signal recovery, A proximal fully parallel splitting method for stable principal component pursuit, A general self-adaptive relaxed-PPA method for convex programming with linear constraints, Identification of alterations in the Jacobian of biochemical reaction networks from steady state covariance data at two conditions, The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement, Unnamed Item, Discriminative Sparse Representations, Splines Are Universal Solutions of Linear Inverse Problems with Generalized TV Regularization, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, A null-space-based weightedl1minimization approach to compressed sensing, Gradient-based method with active set strategy for $\ell _1$ optimization, Proximal Mapping for Symmetric Penalty and Sparsity, Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification, Sparse Support Vector Machines in Reproducing Kernel Banach Spaces, Calibration of reduced-order model for a coupled Burgers equations based on PC-EnKF, Hierachical Bayesian models and sparsity: ℓ 2 -magic, A Clustering Approach to Constrained Binary Matrix Factorization, Using automatic differentiation for compressive sensing in uncertainty quantification, A Multiple Measurement Vector Approach to Synthetic Aperture Radar Imaging, Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, Blind Source Separation with Outliers in Transformed Domains, Microlocal Analysis of the Geometric Separation Problem, Gauss–Newton Methods for Robust Parameter Estimation, Solving inverse problems using data-driven models, A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding, Sparse Bayesian Imaging of Solar Flares, A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization, Uniqueness Conditions for A Class of ℓ0-Minimization Problems, Sampling in Image Representation and Compression, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, A penalty PALM method for sparse portfolio selection problems, Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization, FRIST—flipping and rotation invariant sparsifying transform learning and applications, A gradient projection method for the sparse signal reconstruction in compressive sensing, Generalized Mercer Kernels and Reproducing Kernel Banach Spaces, Sparse Solutions of Linear Diophantine Equations, Penalty Methods for a Class of Non-Lipschitz Optimization Problems, Data-driven time-frequency analysis, Geometric separation by single-pass alternating thresholding, Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO, Convergence of a data-driven time-frequency analysis method, Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method, Necessary and sufficient conditions of solution uniqueness in 1-norm minimization, Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems, Alternating direction method for covariance selection models, Data-driven compressive sensing and applications in uncertainty quantification, A note on block-sparse signal recovery with coherent tight frames, Optimal subgradient methods: computational properties for large-scale linear inverse problems, Sparse reconstruction with multiple Walsh matrices, Alternating direction method of multipliers for solving dictionary learning models, Greedy signal space methods for incoherence and beyond, Finding sparse solutions of systems of polynomial equations via group-sparsity optimization, An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization, High-dimensional change-point estimation: combining filtering with convex optimization, Principle component analysis: robust versions, Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs, A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares, Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model, Basis adaptive sample efficient polynomial chaos (BASE-PC), A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions, A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors, Partial \(S\)-goodness for partially sparse signal recovery, Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization, Nonconvex sorted \(\ell_1\) minimization for sparse approximation, Statistical Methods in Imaging, Resolution Analysis of Imaging with $\ell_1$ Optimization, Fourier Operators in Applied Harmonic Analysis, On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms, A perturbation analysis of block-sparse compressed sensing via mixed ℓ2/ℓ1 minimization, EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION, Theory and applications of compressed sensing, An Overview of Computational Sparse Models and Their Applications in Artificial Intelligence, A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems, Entropic Regularization of the ℓ 0 Function, An L p Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model, An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming, On optimal solutions of the constrained ℓ 0 regularization and its penalty problem, Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets, Linearized Bregman iterations for compressed sensing, Concave programming for finding sparse solutions to problems with convex constraints, ADAPTIVE DATA ANALYSIS VIA SPARSE TIME-FREQUENCY REPRESENTATION, Principles and Typical Computational Limitations of Sparse Speaker Separation Based on Deterministic Speech Features, Average Performance of the Sparsest Approximation Using a General Dictionary, Boosting of Image Denoising Algorithms, Sparsity Based Methods for Overparameterized Variational Problems, Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging, Constructing Surrogate Models of Complex Systems with Enhanced Sparsity: Quantifying the Influence of Conformational Uncertainty in Biomolecular Solvation, Regularized sparse representation for image deconvolution
