The Iteration-Tuned Dictionary for Sparse Representations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

The Iteration-Tuned Dictionary for Sparse Representations

Abstract

We introduce a new dictionary structure for sparse representations better adapted to pursuit algorithms used in practical scenarios. The new structure, which we call an Iteration-Tuned Dictionary (ITD), consists of a set of dictionaries each associated to a single iteration index of a pursuit algorithm. In this work we first adapt pursuit decompositions to the case of ITD structures and then introduce a training algorithm used to construct ITDs. The training algorithm consists of applying a K-means to the (i-1)-th residuals of the training set to thus produce the i-th dictionary of the ITD structure. In the results section we compare our algorithm against the state-of-the-art dictionary training scheme and show that our method produces sparse representations yielding better signal approximations for the same sparsity level.
No file

Dates and versions

inria-00539076 , version 1 (23-11-2010)

Identifiers

  • HAL Id : inria-00539076 , version 1

Cite

Joaquin Zepeda, Christine Guillemot, Ewa Kijak. The Iteration-Tuned Dictionary for Sparse Representations. IEEE International Workshop on Multimedia Signal Processing, Oct 2010, St. Malo, France. ⟨inria-00539076⟩
120 View
0 Download

Share

Gmail Facebook X LinkedIn More