Greed is Good: Algorithmic Results for Sparse Approximation
From MaRDI portal
Publication:3547716
DOI10.1109/TIT.2004.834793zbMath1288.94019WikidataQ59750826 ScholiaQ59750826MaRDI QIDQ3547716
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation by other special function classes (41A30)
Related Items
Simultaneous image fusion and demosaicing via compressive sensing, Nonnegative adaptive Lasso for ultra-high dimensional regression models and a two-stage method applied in financial modeling, Lebesgue-type inequalities in greedy approximation, Signal recovery under cumulative coherence, Secure estimation based Kalman filter for cyber-physical systems against sensor attacks, High-dimensional variable selection, Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy, Modeling of electric disturbance signals using damped sinusoids via atomic decompositions and its applications, Directional Haar wavelet frames on triangles, Smooth sparse coding via marginal regression for learning sparse representations, Compressed sensing and dynamic mode decomposition, A class of deterministic sensing matrices and their application in harmonic detection, Deterministic convolutional compressed sensing matrices, Matrix sparsification and the sparse null space problem, Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee, Point source super-resolution via non-convex \(L_1\) based methods, Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods, Sparse approximation is provably hard under coherent dictionaries, 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory, Equiangular tight frames that contain regular simplices, Robust classifier using distance-based representation with square weights, A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint, Sparse microwave imaging: principles and applications, Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization, Backtracking-based simultaneous orthogonal matching pursuit for sparse unmixing of hyperspectral data, On greedy algorithms for dictionaries with bounded cumulative coherence, PROMP: a sparse recovery approach to lattice-valued signals, Source localization using a sparse representation framework to achieve superresolution, Statistical significance in high-dimensional linear models, Highly sparse representations from dictionaries are unique and independent of the sparseness measure, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Asymptotic properties of Lasso+mLS and Lasso+Ridge in sparse high-dimensional linear regression, Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization, ``Grouping strategies and thresholding for high dimensional linear models: discussion, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, Restricted isometries for partial random circulant matrices, Optimization over finite frame varieties and structured dictionary design, Sparse conjugate directions pursuit with application to fixed-size kernel models, Error estimates for orthogonal matching pursuit and random dictionaries, On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries, Sparse representations and approximation theory, Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method, Autoregressive process modeling via the Lasso procedure, Two are better than one: fundamental parameters of frame coherence, Compressive sensing of analog signals using discrete prolate spheroidal sequences, A note on the complexity of \(L _{p }\) minimization, Iterative hard thresholding methods for \(l_0\) regularized convex cone programming, Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms, Robustness of orthogonal matching pursuit under restricted isometry property, Analysis of orthogonal multi-matching pursuit under restricted isometry property, Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\), Learning circulant sensing kernels, Sparse dual frames and dual Gabor functions of minimal time and frequency supports, Model decomposition and reduction tools for large-scale networks in systems biology, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\), Lattices from equiangular tight frames, Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging, Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R, A modified greedy analysis pursuit algorithm for the cosparse analysis model, Orthogonal matching pursuit under the restricted isometry property, Sparse signal recovery using a new class of random matrices, Compressed sensing for quaternionic signals, Sparsity in time-frequency representations, Compressed sensing with coherent and redundant dictionaries, Frame permutation quantization, Sparse approximate solution of partial differential equations, On performance of greedy algorithms, When do stepwise algorithms meet subset selection criteria?, On the existence of equiangular tight frames, Enhancing sparsity of Hermite polynomial expansions by iterative rotations, Lasso-type recovery of sparse representations for high-dimensional data, Iterative thresholding for sparse approximations, Analysis of basis pursuit via capacity sets, Optimal non-linear models for sparsity and sampling, On some deterministic dictionaries supporting sparsity, Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms, Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference, New cyclic sparsity measures for deconvolution based on convex relaxation, Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots, Sparse recovery via differential inclusions, On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD, GPU accelerated greedy algorithms for compressed sensing, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\), Variational approximation for heteroscedastic linear models and matching pursuit algorithms, K-hyperline clustering learning for sparse component analysis, Average performance of the approximation in a dictionary using an \(\ell _0\) objective, Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit, Column subset selection via sparse approximation of SVD, KFCE: a dictionary generation algorithm for sparse representation, Nonlinear least squares in \(\mathbb R^{N}\), Sparse solutions to underdetermined Kronecker product systems, Theoretical guarantees for graph sparse coding, Deterministic construction of sparse binary matrices via incremental integer optimization, Inverse point source location with the Helmholtz equation on a bounded domain, Measurement matrix design for CS-MIMO radar using multi-objective optimization, Orthogonal one step greedy procedure for heteroscedastic linear models, Nomonotone spectral gradient method for sparse recovery, Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm, Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method, Fast sparse reconstruction: Greedy inverse scale space flows, Average Performance of the Sparsest Approximation Using a General Dictionary, Book Review: A mathematical introduction to compressive sensing, THE RESTRICTED ISOMETRY PROPERTY FOR SIGNAL RECOVERY WITH COHERENT TIGHT FRAMES, A survey on compressive sensing: classical results and recent advancements, A Survey of Compressed Sensing, A component lasso, Optimization Methods for Synthetic Aperture Radar Imaging, Iterative positive thresholding algorithm for non-negative sparse optimization, A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem, Fixed-Size Confidence Regions in High-Dimensional Sparse Linear Regression Models, Analysis of simultaneous inpainting and geometric separation based on sparse decomposition, Rates of convergence of the adaptive elastic net and the post-selection procedure in ultra-high dimensional sparse models, A Greedy Algorithm for Sparse Precision Matrix Approximation, Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases, $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials, Multicompartment magnetic resonance fingerprinting, The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials, A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems, TWO NEW LOWER BOUNDS FOR THE SPARK OF A MATRIX, A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery, \(\mathrm{L_1RIP}\)-based robust compressed sensing, A smoothing inertial neural network for sparse signal reconstruction with noise measurements via \(L_p-L_1\) minimization, Heuristics for Finding Sparse Solutions of Linear Inequalities, An outlier detection and recovery method based on moving least squares quasi-interpolation scheme and \(\text{ł}_0\)-minimization problem, Smoothing inertial neurodynamic approach for sparse signal reconstruction via \(L_p\)-norm minimization, Sparse approximation over the cube, Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares, The entanglement criteria based on equiangular tight frames, Sampling rates for \(\ell^1\)-synthesis, DCACO: an algorithm for designing incoherent redundant matrices, A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization, On sparsity‐inducing methods in system identification and state estimation, Some results on OMP algorithm for MMV problem, Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising, Gradient-based method with active set strategy for $\ell _1$ optimization, Feature Selection by Canonical Correlation Search in High-Dimensional Multiresponse Models With Complex Group Structures, Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit, On Linguistic Variables and Sparse Representations, Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets, Unnamed Item, A Fast Algorithm for Learning Overcomplete Dictionary for Sparse Representation Based on Proximal Operators, Improving the Incoherence of a Learned Dictionary via Rank Shrinkage, $ \newcommand{\e}{{\rm e}} \ell_{0}$ -minimization methods for image restoration problems based on wavelet frames, A tree-based dictionary learning framework, Inferring Sparse Preference Lists from Partial Information, An Introduction to Compressed Sensing, On Reconstructing Functions from Binary Measurements, Bag of Pursuits and Neural Gas for Improved Sparse Coding, Sparse approximation based on a random overcomplete basis, Compressed Sensing with Nonlinear Fourier Atoms, Regularization Techniques and Suboptimal Solutions to Optimization Problems in Learning from Data, Microlocal Analysis of the Geometric Separation Problem, Greedy approach to sparse multi-path channel estimation using sensing dictionary, The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty, On b-bit min-wise hashing for large-scale regression and classification with sparse data, A Tight Bound of Hard Thresholding, Influences of preconditioning on the mutual coherence and the restricted isometry property of Gaussian/Bernoulli measurement matrices, Unnamed Item, Unnamed Item, A Multiple Measurement Vector Approach to Synthetic Aperture Radar Imaging, Morphological Diversity and Sparsity in Blind Source Separation, Eigengaps for hub-dominant matrices, On Collaborative Compressive Sensing Systems: The Framework, Design, and Algorithm, Structured sparsity through convex optimization, Discussion on “Two-Stage Procedures for High-Dimensional Data” by Makoto Aoshima and Kazuyoshi Yata, Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction, On Optimal Estimate of the Block Orthogonal Greedy Algorithm for g-Frames, Frames for compressed sensing using coherence, Tensor Least Angle Regression for Sparse Representations of Multidimensional Signals, An improved bound of cumulative coherence for signal recovery, Equiangular tight frames and unistochastic matrices, On the Probabilistic Cauchy Theory for Nonlinear Dispersive PDEs, Weak-Type Estimates for the Metaplectic Representation Restricted to the Shearing and Dilation Subgroup of $$SL(2,\mathbb {R})$$, Estimation of Sparse Nonnegative Sources from Noisy Overcomplete Mixtures Using MAP, Detection of spatially sparse damage using impulse response sensitivity and LASSO regularization, A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding, Sparse Bayesian Imaging of Solar Flares, Stability and Robustness of Weak Orthogonal Matching Pursuits, A review on restoration of seismic wavefields based on regularization and compressive sensing, Binary sparse signal recovery with binary matching pursuit *, Unnamed Item, Quasi-linear Compressed Sensing, Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion, Stability Selection, A Weighted Difference of Anisotropic and Isotropic Total Variation for Relaxed Mumford--Shah Color and Multiphase Image Segmentation, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, Unnamed Item, Theory and applications of compressed sensing, Multi-Layer Sparse Coding: The Holistic Way, Solving Basis Pursuit, SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES, One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations, A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks, Splitting matching pursuit method for reconstructing sparse signal in compressed sensing, On Lebesgue-type inequalities for greedy approximation, A sparse recovery method for DOA estimation based on the sample covariance vectors, When does OMP achieve exact recovery with continuous dictionaries?, Multi-view low-rank dictionary learning for image classification, Generalized greedy alternatives, Adaptive multi-penalty regularization based on a generalized Lasso path, Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP, Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields, Globally sparse and locally dense signal recovery for compressed sensing, Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing, The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing, Direct sparse deblurring, An alternating direction and projection algorithm for structure-enforced matrix factorization, Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization, Reprint of: A forward-backward greedy approach for sparse multiscale learning, A smoothing method for sparse optimization over convex sets, Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries, Subspace learning by \(\ell^0\)-induced sparsity, A simple homotopy proximal mapping algorithm for compressive sensing, The geometry of off-the-grid compressed sensing, Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity, Fast overcomplete dictionary construction with probabilistic guarantees, Proximity algorithms for the L1/TV image denoising model, New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem, Compressive Sensing, On sparse recovery algorithms in unions of orthonormal bases, Posterior information-based image measurement matrix optimization, On the sparsity of Lasso minimizers in sparse data recovery, Sparse signal recovery via ECME thresholding pursuits, Sparsity and incoherence in orthogonal matching pursuit, Model selection for high-dimensional linear regression with dependent observations, A note on the hardness of sparse approximation, Efficient LED-SAC sparse estimator using fast sequential adaptive coordinate-wise optimization (LED-2SAC), A note on sparse least-squares regression, Greedy expansions in Hilbert spaces, Median filter based compressed sensing model with application to MR image reconstruction, Some greedy algorithms for sparse polynomial chaos expansions, Optimized projections for compressed sensing via rank-constrained nearest correlation matrix, Consistency of \(\ell_1\) recovery from noisy deterministic measurements, A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al., Signal recovery under mutual incoherence property and oracle inequalities, Greedy subspace pursuit for joint sparse recovery, A remark on joint sparse recovery with OMP algorithm under restricted isometry property, Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms, Beyond coherence: Recovering structured time-frequency representations, Limited-complexity controller tuning: a set membership data-driven approach, Rodeo: Sparse, greedy nonparametric regression, Matrix recipes for hard thresholding methods, An automatic and parameter-free information-based method for sparse representation in wavelet bases, Spectral compressive sensing, Geometric separation by single-pass alternating thresholding, Stable restoration and separation of approximately sparse signals, Fast thresholding algorithms with feedbacks for sparse signal recovery, Data-driven tight frame construction and image denoising, Adaptive frame methods for nonlinear variational problems, Sparse signals recovery from noisy measurements by orthogonal matching pursuit, A performance guarantee for orthogonal matching pursuit using mutual coherence, Running time analysis of the (1+1)-EA for robust linear optimization, Analysis of the self projected matching pursuit algorithm, Ways to sparse representation: An overview, A sharp RIP condition for orthogonal matching pursuit, A hybrid scheme for encoding audio signal using hidden Markov models of waveforms, On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them, Boosting with structural sparsity: a differential inclusion approach, On rank awareness, thresholding, and MUSIC for joint sparse recovery, Stochastic greedy algorithms for multiple measurement vectors, Nonlinear adaptive filtering using kernel-based algorithms with dictionary adaptation, Distributed compressed sensing based joint detection and tracking for multistatic radar system, Resolution Analysis of Imaging with $\ell_1$ Optimization, An efficient algorithm for learning dictionary under coherence constraint, An efficient algorithm for overcomplete sparsifying transform learning with signal denoising, Incoherent dictionary learning method based on unit norm tight frame and manifold optimization for sparse representation, On the differences between \(L_2\) boosting and the Lasso, Nonconvex sorted \(\ell_1\) minimization for sparse approximation, Image deblurring with coupled dictionary learning, A new sparse recovery method for the inverse acoustic scattering problem, Safe feature elimination for non-negativity constrained convex optimization, Evaluating visual properties via robust HodgeRank, An offline/online procedure for dual norm calculations of parameterized functionals: empirical quadrature and empirical test spaces, Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem, Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems, Sparse set membership identification of nonlinear functions and application to fault detection, Efficiency of orthogonal super greedy algorithm under the restricted isometry property, Reconstruction of sparse-view tomography via preconditioned Radon sensing matrix, Sparse reconstruction with multiple Walsh matrices, Super-resolution for doubly-dispersive channel estimation, A forward-backward greedy approach for sparse multiscale learning, Block matching video compression based on sparse representation and dictionary learning, Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems, Preconditioning for orthogonal matching pursuit with noisy and random measurements: the Gaussian case, Correlations of random classifiers on large data sets, Alternating direction method of multipliers for solving dictionary learning models, Search for sparse solutions of super-large systems with a tensor structure, Hierarchical compressed sensing, Angular scattering function estimation using deep neural networks, Robust and resource-efficient identification of two hidden layer neural networks, Variational texture synthesis with sparsity and spectrum constraints
