Stagewise K-SVD to Design Efficient Dictionaries for Sparse Representations

Rusu, Cristian and Dumitrescu, Bogdan (2012) Stagewise K-SVD to Design Efficient Dictionaries for Sparse Representations. IEEE Signal Processing Letters, 19 (10). pp. 631-634. ISSN 1558-2361

Full text not available from this repository.

Abstract

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:	Article
Subjects:	Q Science > QA Mathematics > Electronic computers. Computer science T Technology > T Technology (General) > Information Technology > Electronic computers. Computer science
Divisions:	School of Computing > Staff Research and Publications
Depositing User:	Caoimhe Ní Mhaicín
Date Deposited:	31 Oct 2017 10:27
Last Modified:	31 Oct 2017 10:27
URI:	https://norma.ncirl.ie/id/eprint/2680

Actions (login required)

View Item