Regularized dictionary learning for sparse approximation
Yaghoobi, M., Blumensath, T. and Davies, M. (2008) Regularized dictionary learning for sparse approximation. In, 16th Annual European Signal Processing Conference (EUSIPCO), Lausanne, CH, 25 - 29 Aug 2008.
Full text not available from this repository.
Sparse signal models approximate signals using a small number of
elements from a large set of vectors, called a dictionary. The success
of such methods relies on the dictionary fitting the signal structure.
Therefore, the dictionary has to be designed to fit the signal
class of interest. This paper uses a general formulation that allows
the dictionary to be learned form the data with some a priori information
about the dictionary. In this formulation a universal cost
function is proposed and practical algorithms are presented to minimize
this cost under different constraints on the dictionary. The
proposed methods are compared with previous approaches using
synthetic and real data. Simulations highlight the advantages of the
proposed methods over other currently available dictionary learning
|Item Type:||Conference or Workshop Item (Paper)|
|Subjects:||Q Science > QA Mathematics|
|Divisions:||University Structure - Pre August 2011 > School of Mathematics
Faculty of Engineering and the Environment > Institute of Sound and Vibration Research > Signal Processing & Control Research Group
|Date Deposited:||13 May 2010 09:00|
|Last Modified:||31 Mar 2016 13:24|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)