A Gradient Network for Vector Quantization and Its Image Compression Applications
The ultimate goal of vector quantization (VQ) is to encode the signal into representative code vectors such that it can be represented digitally in a compact way. This task can be formulated as an optimization problem, namely the minimization of the total distance between the signal and the code vectors. In this paper, we formulate VQ as a constrained binary integer programming problem by eliminating the code vectors, where the constraints that partition the signal space are linear. We propose a two dimensional Gradient Network to solve this problem. The performance of this solution method is tested on image compression applications and the results are compared with the ones obtained by the well-known k-means algorithm.
Unable to display preview. Download preview PDF.
- 1.Ahalt S.C., Fowler J.E.: Vector Quantization using Artificial Neural Network Models. Proceedings of The Int. Workshop on Adaptive Methods and Emergent Techniques for Signal Processing and Communications. (1993) 42–61Google Scholar
- 3.Smith K.A.: Neural Networks for Combinatorial Optimization A Review of More Than A Decade Research. Informs Journal on Computing, Vol.11, No. 1. (1999)Google Scholar
- 6.Doğan H., Güzeliş C.: VQ As an Integer Optimization Problem and Gradient Artificial Neural Network Solution (In Turkish). Proceeding of SIU2002, (2002) 266–271Google Scholar