Abstract—This paper deals with a design of new vector quantization algorithm for coding of color images in the Transform domain. In order to speed up the design issue, the feature of transform coding is combined with vector quantization. The transformed training set is obtained with the proposed integer Orthogonal Polynomials transform with reduced computational complexity. The proposed method then generates a single codebook for all the three color components, utilizing the inter-correlation property of the individual color plane as well as interactions among the color planes with the proposed transformation. In the codebook generation phase of the proposed vector quantization encoding, binary tree method is used to achieve considerable saving in codebook construction time. The vector encoding phase uses binary search and partial distortion elimination to further reduce the encoding time for finding closest codeword of an input vector. The experimental result shows that the proposed algorithm greatly reduces the encoding time. The proposed algorithm is also compared with existing standard LBG algorithm.
Index Terms—Vector quantization, orthogonal polynomials transform, binary tree method.
The authors are with Computer vision lab, Department of CSE, Anna University of Technology, Tiruchirappalli - 620 024, Tamil Nadu, India (e-mail: firstname.lastname@example.org, email@example.com).
Cite: Krishnamoorthy R. and Punidha R., "FVQEOPT: Fast Vector Quantization Encoding with Orthogonal Polynomials Transform," International Journal of Computer Theory and Engineering vol. 5, no. 1, pp. 31-35, 2013.