Rusu, Cristian (2012) Fast design of efficient dictionaries for sparse representations. In: 2012 IEEE International Workshop on Machine Learning for Signal Processing. IEEE, Santander, pp. 1-5. ISBN 9781467310260
Full text not available from this repository.Abstract
One of the central issues in the field of sparse representations is the design of overcomplete dictionaries with a fixed sparsity level from a given dataset. This article describes a fast and efficient procedure for the design of such dictionaries. The method implements the following ideas: a reduction technique is applied to the initial dataset to speed up the upcoming procedure; the actual training procedure runs a more sophisticated iterative expanding procedure based on K-SVD steps. Numerical experiments on image data show the effectiveness of the proposed design strategy.
| Item Type: | Book Section | 
|---|---|
| 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: | 03 Jul 2018 11:36 | 
| Last Modified: | 03 Jul 2018 11:36 | 
| URI: | https://norma.ncirl.ie/id/eprint/3058 | 
Actions (login required)
![]()  | 
        View Item | 
   
 Tools
 Tools