Dictionaries for Sparse Representation Modeling
Dictionaries for Sparse Representation Modeling
复制标题
DOI:
10.1109/jproc.2010.2040551
复制
发表时间:
2010-06-01
影响因子:
20.6
通讯作者:
Elad, Michael
中科院分区:
文献类型:
--
作者:
Rubinstein, Ron;Bruckstein, Alfred M.;Elad, Michael
Sparse and redundant representation modeling of data assumes an ability to describe signals as linear combinations of a few atoms from a pre-specified dictionary. As such, the choice of the dictionary that sparsifies the signals is crucial for the success of this model. In general, the choice of a proper dictionary can be done using one of two ways: i) building a sparsifying dictionary based on a mathematical model of the data, or ii) learning a dictionary to perform best on a training set. In this paper we describe the evolution of these two paradigms. As manifestations of the first approach, we cover topics such as wavelets, wavelet packets, contourlets, and curvelets, all aiming to exploit 1-D and 2-Dmathematical models for constructing effective dictionaries for signals and images. Dictionary learning takes a different route, attaching the dictionary to a set of examples it is supposed to serve. From the seminal work of Field and Olshausen, through the MOD, the K-SVD, the Generalized PCA and others, this paper surveys the various options such training has to offer, up to the most recent contributions and structures.