Ways to sparse representation: An overview

DOI10.1007/s11432-009-0045-5zbMath1191.94055OpenAlexW2404621579MaRDI QIDQ2267103

Qionghai Dai, Yigang Peng, Jing-Yu Yang, Xu, Wenli

Publication date: 26 February 2010

Published in: Science in China. Series F (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11432-009-0045-5

zbMATH Keywords

redundant dictionarynonlinear approximationsparse representationiterative shrinkagematching pursuitbasis pursuitredundant transform

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for wavelets (65T60) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Related Items (5)

Improved FOCUSS method for reconstruction of cluster structured sparse signals in radar imaging ⋮ Robust latent nonnegative matrix factorization with automatic sparse reconstruction for unsupervised feature extraction ⋮ Discrete chirp-Fourier transform and its application to chirp rate estimation ⋮ Large-scale hyperspectral image compression via sparse representations based on online learning ⋮ Tensor Least Angle Regression for Sparse Representations of Multidimensional Signals

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• Iterative thresholding for sparse approximations
• Wavelets and curvelets for image deconvolution: a combined approach
• Iteratively solving linear inverse problems under general convex constraints
• The problem of sparse image coding
• Least angle regression. (With discussion)
• An affine scaling methodology for best basis selection
• An EM algorithm for wavelet-based image restoration
• Stable recovery of sparse overcomplete representations in the presence of noise
• Sparse representations in unions of bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• Why Simple Shrinkage Is Still Relevant for Redundant Representations?
• Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
• Atomic Decomposition by Basis Pursuit
• A new approach to variable selection in least squares problems
• Uncertainty principles and ideal atomic decomposition
• Greedy Basis Pursuit
• Tree-Based Pursuit: Algorithm and Properties
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• A generalized uncertainty principle and sparse representation in pairs of bases
• De-noising by soft-thresholding
• Matching pursuits with time-frequency dictionaries
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Fast matching pursuit with a multiscale dictionary of Gaussian chirps
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution

This page was built for publication: Ways to sparse representation: An overview