Learning sparse wavelet codes for natural images
暂无分享,去创建一个
We show how a wavelet basis may be adapted to best represent natural images in terms of sparse coefficients. The wavelet basis, which may be either complete or overcomplete, is specified by a small number of spatial functions which are repeated across space and combined in a recursive fashion so as to be self-similar across scale. These functions are adapted to minimize the estimated code length under a model that assumes images are composed as a linear superposition of sparse, independent components. When adapted to natural images, the wavelet bases become selective to different spatial orientations, and they achieve a superior degree of sparsity on natural images as compared with traditional wavelet bases.
[1] K. Jarrod Millman,et al. Learning Sparse Codes with a Mixture-of-Gaussians Prior , 1999, NIPS.
[2] S. Mallat. A wavelet tour of signal processing , 1998 .
[3] Bruno A. Olshausen,et al. PROBABILISTIC FRAMEWORK FOR THE ADAPTATION AND COMPARISON OF IMAGE CODES , 1999 .
[4] David J. Field,et al. Sparse coding with an overcomplete basis set: A strategy employed by V1? , 1997, Vision Research.