Skip to main content
Log in

Optimization of code book in vector quantization

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In this paper, we present a novel approach to design a code book for vector quantization using standard deviation. The proposed algorithm optimizes the partitioning space to explore the search space for a set of equally viable and equivalent partitions. Essentially the partition space is partitioned into perceptive clusters, so that the code book is optimized. The proposed algorithm is proved better than the widely used quantization algorithm in applications.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Anderberg, M.R. (1973). Cluster Analysis for Applications, Academic Press.

  • Bose, N.K. and P. Liang. (1998). Neural Network Fundamentals with Graphs, Algorithms and Applications, Tata McGraw-Hill Edition, NJ.

    Google Scholar 

  • Carl G Looney. (1997). Pattern Recognition using Neural Networks, Oxford University Press, Newyork.

    Google Scholar 

  • Duda, R.O. and P.E. Hart. (1973). Pattern classification and scene analysis, Wiley, Newyork.

    Google Scholar 

  • Earl Gose., Richard Johnson, Bangh and Steve Jost. (2000). Pattern Recognition and Image Analysis, Prentice Hall of India, New Delhi.

    Google Scholar 

  • Fu, K.S. (1980). Digital Pattern Recognition, Springer, Berlin.

    Google Scholar 

  • Gersho, A. and R.M. Gray. (1992). Vector quantization and Signal Compression, Kluwer Boston, MA.

    Google Scholar 

  • Kosko. B. (1992). “Neural Networks for Signal Processing.” Prentice Hall, Eaglewood Cliffs, NJ.

    Google Scholar 

  • Kosmatopoulos, E.B. and M.A. Christodoulou. (1996). “Convergence properties of a class of Learning Vector Quantisation Algorithms.” IEEE, Trans. Image Processing 5, 361–368.

    Article  Google Scholar 

  • Lin Yu Tseng and Shiueng Bien Yang. (2001). “A genetic approach to automatic clustering problem.” Pattern Recognition letters 34, 415–424.

    Google Scholar 

  • Musti Narashinha Murthy and V. Sridhar. (1991). “A Knowledge based Clustering Algorithm.” Pattern Recognition letters 12, 511–517.

    Article  Google Scholar 

  • Macqueen, J. (1967). “Some methods for classification and analysis of multivariate data.” Proc. 5th Berkeley Symposium on probability and statistics.” University of California press, Berkeley.

    Google Scholar 

  • Singiresu S Rao. (1996). Engineering Optimization, New Age International (P) Limited, New Delhi.

    Google Scholar 

  • Spath, H. (1989). ClusterAnalysis Algorithms, Ellis Horwod, Chichester, UK.

    Google Scholar 

  • Thangavel. K. and Ashok Kumar. D. (2002). “SD—Means clustering Algorithm.” Proceedings of the National Conference on Recent Trend's in Information Technology, Karpagam Arts College, Coimbatore, India.

    Google Scholar 

  • Ujiwal Maulik and Sanghamitra Bandyopadhyay. (2000). “Genetic Algorithm based Clustering Technique.” Pattern Recognition 33, 1455–1465.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. Thangavel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thangavel, K., Kumar, D.A. Optimization of code book in vector quantization. Ann Oper Res 143, 317–325 (2006). https://doi.org/10.1007/s10479-006-7391-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-7391-0

Keywords

Navigation