Sparse edge coding using overcomplete Gabor wavelets

We present here a sparse coding algorithm dedicated exclusively to overcomplete Gabor wavelets and based on perceptual contour extraction methods. The algorithm has reduced computational cost and achieves compression rates similar to the standard image compression algorithms (JPEG and JPEG-2000) with the additional advantage of limiting the appearance of artifacts.

[1]  VisionBert W. RustMathematical.  A New Representation of the Contrast SensitivityFunction for Human , 2007 .

[2]  D J Field,et al.  Relations between the statistics of natural images and the response properties of cortical cells. , 1987, Journal of the Optical Society of America. A, Optics and image science.

[3]  Gabriel Cristóbal,et al.  Sparse overcomplete Gabor wavelet representation based on local competitions , 2006, IEEE Transactions on Image Processing.

[4]  Arthur E. C. Pece,et al.  The Problem of Sparse Image Coding , 2002, Journal of Mathematical Imaging and Vision.

[5]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[6]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[7]  L. Finkel,et al.  Extraction of perceptually salient contours by striate cortical networks , 1998, Vision Research.

[8]  Stephen Grossberg,et al.  A neural network for enhancing boundaries and surfaces in synthetic aperture radar images , 1999, Neural Networks.

[9]  Gabriel Cristóbal,et al.  Lossless chain coder for gray edge images , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).