The cellular neural network paradigm has found many applications in image processing. However, algorithms for image compression using CNN have scarcely been explored. CNN programmability is based on a new algorithmic style based on the spatio-temporal properties of the array. By exploiting the massive parallelism provided by CNN and the convolutional key basic instruction, a fast and efficient compression process can be achieved. This paper presents new templates and low-complexity algorithms to perform both the linear and non-linear operations needed for image compression. In this work, we have addressed all the transformation steps needed in image compression, i.e. decorrelation, bit allocation, quantization and bit extraction. From all possible compression techniques the wavelet subband coding was chosen because it is considered one of the most successful techniques for lossy compression. It allows a high compression ratio while preserving the image quality. All these advantages are implemented in the algorithms hereby presented.
|Number of pages||17|
|Journal||International Journal of Circuit Theory and Applications|
|Publication status||Published - 1999|