Double sparsity: Learning sparse dictionaries for sparse signal approximation

  • Rubinstein R
  • Zibulevsky M
  • Elad M
  • 299


    Mendeley users who have this article in their library.
  • 358


    Citations of this article.


An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The proposed sparse dictionary is based on a sparsity model of the dictionary atoms over a base dictionary, and takes the form D = ?? A, where ?? is a fixed base dictionary and A is sparse. The sparse dictionary provides efficient forward and adjoint operators, has a compact representation, and can be effectively trained from given example data. In this, the sparse structure bridges the gap between implicit dictionaries, which have efficient implementations yet lack adaptability, and explicit dictionaries, which are fully adaptable but non-efficient and costly to deploy. In this paper, we discuss the advantages of sparse dictionaries, and present an efficient algorithm for training them. We demonstrate the advantages of the proposed structure for 3-D image denoising.

Author-supplied keywords

  • Computed tomography
  • Dictionary learning
  • K-SVD
  • Signal denoising
  • Sparse coding
  • Sparse representation

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Ron Rubinstein

  • Michael Zibulevsky

  • Michael Elad

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free