Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation

DOI10.1109/TSP.2009.2036477zbMath1392.94427WikidataQ57567583 ScholiaQ57567583MaRDI QIDQ4570798

Ron Rubinstein, Michael Elad, Michael Zibulevsky

Publication date: 9 July 2018

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

Mathematics Subject Classification ID

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

Related Items (16)

Efficient Identification of Butterfly Sparse Matrix Factorizations ⋮ Unnamed Item ⋮ Multiscale hybrid nonlocal means filtering using modified similarity measure ⋮ Signal approximations based on nonlinear and optimal piecewise affine functions ⋮ Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support ⋮ Optimal nonlinear signal approximations based on piecewise constant functions ⋮ A region-based easy-path wavelet transform for sparse image representation ⋮ Spectral dynamics and regularization of incompletely and irregularly measured data ⋮ Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation ⋮ 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 ⋮ Noise learning based discriminative dictionary learning algorithm for image classification ⋮ A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding ⋮ Unnamed Item

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