Publication Type:

Conference Proceedings

Source:

2014 International Conference on Signal Processing and Communications (SPCOM), Volume 1, No: 5,, p.22-25 (2014)

Keywords:

Dictionaries, dictionary learning algorithm, K-SVD algorithm, learning (artificial intelligence), learnt dictionary, Matching pursuit algorithms, Overcomplete dictionary, signal examples, Signal processing algorithms, signal representation, Signal to noise ratio, Singular value decomposition, Sparse matrices, sparse representations, sparsity model, subspaces union, supervised dictionary learning, Training, Vectors

Abstract:

<p>Dictionary learning algorithms are used to train an overcomplete dictionary from a set of signal examples such that the learnt dictionary provides sparse representations for a class of signals from which the training examples are sampled. In this work, we consider a specific class of signals, i.e., signals which belong to a union of subspaces, and we propose a dictionary learning algorithm for such type of signals by extending the popular K-SVD algorithm. Apart from the traditional sparsity model, we also incorporate the union of subspaces model into the dictionary learning algorithm. Various experiments using synthetic and real data demonstrate that the proposed algorithm recovers a dictionary which is closer to the underlying unknown dictionary than the one obtained from a simple K-SVD algorithm which do not make use of the additional structure contained in the signal examples.</p>

Cite this Research Publication

Sandeep P. and Jacob, T., “Supervised dictionary learning for signals from union of subspaces”, 2014 International Conference on Signal Processing and Communications (SPCOM), vol. 1, No: 5. pp. 22-25, 2014.