Iterative hard thresholding and L0 regularisation
Blumensath, Thomas, Yaghoobi, M. and Davies, Michael E. (2007) Iterative hard thresholding and L0 regularisation. In, Proceedings of the 32nd IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP). IEEE International Conference on Acoustics, Speech and Signal Processing , Institute of Electrical and Electronics Engineers.
Full text not available from this repository.
Description/Abstract
Sparse signal approximations are approximations that use only a
small number of elementary waveforms to describe a signal. In this
paper we proof the convergence of an iterative hard thresholding algorithm
and show, that the fixed points of that algorithm are local
minima of the sparse approximation cost function, which measures
both, the reconstruction error and the number of elements in the representation.
Simulation results suggest that the algorithm is comparable
in performance to a commonly used alternative method
| Item Type: | Book Section |
|---|---|
| Uncontrolled Keywords: | sparse approximations, iterative thresholding, L0 regularisation |
| Related URLs: | http://ecos.maths.ed.ac.uk/pap...ASSP07.pdf http://www.icassp2007.org/ |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | University Structure - Pre August 2011 > School of Mathematics |
| ePrint ID: | 151925 |
| Deposited On: | 15 Jun 2010 09:27 |
| Last Modified: | 02 Mar 2012 13:14 |
Associated Staff Only: edit my ePrint
