HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Hyvärinen, A. Search for Related Content PubMed PubMed Citation Articles by Hyvärinen, A.

Sparse Code Shrinkage: Denoising of Nongaussian Data by Maximum Likelihood Estimation

Helsinki University of Technology, Laboratory of Computer and Information Science, FIN-02015 HUT, Finland

Sparse coding is a method for finding a representation of data in which each of the components of the representation is only rarely significantly active. Such a representation is closely related to redundancy reduction and independent component analysis, and has some neurophysiological plausibility. In this article, we show how sparse coding can be used for denoising. Using maximum likelihood estimation of nongaussian variables corrupted by gaussian noise, we show how to apply a soft-thresholding (shrinkage) operator on the components of sparse coding so as to reduce noise. Our method is closely related to the method of wavelet shrinkage, but it has the important benefit over wavelet methods that there presentation is determined solely by the statistical properties of the data. The wavelet representation, on the other hand, relies heavily on certain mathematical properties (like self-similarity) that may be only weakly related to the properties of natural data.

This article has been cited by other articles:

				A. Hyvarinen, P. O. Hoyer, and M. Inki Topographic Independent Component Analysis Neural Comput., July 1, 2001; 13(7): 1527 - 1558. [Abstract] [Full Text]

				A. Hyvärinen Complexity Pursuit: Separating Interesting Components from Time Series Neural Comput., April 1, 2001; 13(4): 883 - 898. [Abstract] [Full Text]