Name
Abstract | ||
|---|---|---|
Finding the size of the dictionary is an open issue in dictionary learning (DL). We propose an algorithm that adapts the size during the learning process by using Information Theoretic Criteria (ITC) specialized to the DL problem. The algorithm is built on top of Approximate K-SVD (AK-SVD) and periodically removes the less used atoms or adds new random atoms, based on ITC evaluations for a small number of candidate sub-dictionaries. Numerical experiments on synthetic data show that our algorithm not only finds the true size with very good accuracy, but is also able to improve the representation error in comparison with AK-SVD knowing the true size. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.3390/a12090178 | ALGORITHMS |
Keywords | Field | DocType |
dictionary learning,sparse representation,information theoretic criteria,dictionary size | Small number,Dictionary learning,Sparse approximation,Algorithm,Synthetic data,Artificial intelligence,Machine learning,Mathematics | Journal |
Volume | Issue | Citations |
12 | 9 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bogdan Dumitrescu | 1 | 107 | 22.76 |
| Ciprian Doru Giurcaneanu | 2 | 43 | 12.44 |