Compressed Sensing (CS) is an established way to perform efficient dimensionality reduction during a signal’s acquisition process. However, the common transform bases used in CS to represent a signal often lead to a compressible representation that is not optimal in terms of compactness. In this paper we present a novel dictionary learning algorithm designed to work with CS data. Following our approach, dictionaries learned directly from the signal’s random projections are specifically suited to the signal class of interest, resulting in very sparse representations. Moreover, since the proposed method lays its foundation in a Bayesian dictionary learning algorithm, no prior information such as the signals’ sparsity is needed because it is inferred directly from the data. We show the superiority of our approach by comparing it with a state-of-the-art CS dictionary learning algorithm.
Compressive Bayesian K-SVD / Testa, Matteo; Magli, Enrico. - In: SIGNAL PROCESSING-IMAGE COMMUNICATION. - ISSN 0923-5965. - ELETTRONICO. - 60(2018), pp. 1-5. [10.1016/j.image.2017.08.009]
|Titolo:||Compressive Bayesian K-SVD|
|Data di pubblicazione:||2018|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1016/j.image.2017.08.009|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto: