Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation

DOI10.1109/TSP.2009.2036477MaRDI QIDQ4570798zbMATH OpenDBLPWikidataFDO

Authors Ron Rubinstein, Michael Zibulevsky, Michael Elad

Publication date 9 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2009.2036477

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(18)

• Multiscale hybrid nonlocal means filtering using modified similarity measure
• Underdetermined separation of speech mixture based on sparse Bayesian learning
• Learning sparse FRAME models for natural image patterns
• Toward fast transform learning
• Image deblurring with coupled dictionary learning
• Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
• Optimal nonlinear signal approximations based on piecewise constant functions
• Noise learning based discriminative dictionary learning algorithm for image classification
• Sparse and Spurious: Dictionary Learning With Noise and Outliers
• On the Doubly Sparse Compressed Sensing Problem
• Convolutional neural networks analyzed via convolutional sparse coding
• Provably accurate double-sparse coding
• A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding
• A region-based easy-path wavelet transform for sparse image representation
• Efficient Identification of Butterfly Sparse Matrix Factorizations
• Signal approximations based on nonlinear and optimal piecewise affine functions
• Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support
• Spectral dynamics and regularization of incompletely and irregularly measured data

This page was built for publication: Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570798)