Rusu, Cristian and Dumitrescu, Bogdan Stagewise K-SVD to Design Efficient Dictionaries for Sparse Representations. In: ICASSP 2013, May 26-31, 2013, Vancouver, Canada pp. 1-3. (Unpublished) (2013)Full text not available from this repository.
The problem of training a dictionary for sparse representations from a given dataset is receiving a lot of attention mainly due to its applications in the fields of coding, classification and pattern recognition. One of the open questions is how to choose the number of atoms in the dictionary: if the dictionary is too small then the representation errors are big and if the dictionary is too big then using it becomes computationally expensive. In this letter, we solve the problem of computing efficient dictionaries of reduced size by a new design method, called Stagewise K-SVD, which is an adaptation of the popular K-SVD algorithm. Since K-SVD performs very well in practice, we use K-SVD steps to gradually build dictionaries that fulfill an imposed error constraint. The conceptual simplicity of the method makes it easy to apply, while the numerical experiments highlight its efficiency for different overcomplete dictionaries.
|Item Type:||Conference or Workshop Item (Paper)|
|Uncontrolled Keywords:||classification, coding, dataset, dictionaries, error constraint, pattern recognition, sparse representations, stagewise K-SVD|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Ms T. Iannizzi|
|Date Deposited:||10 Jun 2013 08:42|
|Last Modified:||10 Jun 2013 08:42|
Actions (login required)