Data Compressor for VQ Index Tables

  • Authors:
  • Tzu-Chuen Lu;Chin-Chen Chang

  • Affiliations:
  • Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan, 621. ltc@cs.ccu.edu.tw/ ccc@cs.ccu.edu.tw;(Correspd.) Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan, 621. ltc@cs.ccu.edu.tw/ ccc@cs.ccu.edu.tw

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The vector quantization (VQ) compression scheme has been well accepted as an efficient image compression technique. However, the compression bit rate of the VQ scheme is limited. In order to improve its efficiency, in this paper, we shall propose a new lossless data compression scheme to further condense the VQ index table. The proposed scheme exploits the inter-block correlations in the index table to re-encode the indices. Unlike the well known existing re-encoding schemes such as SOC and STC, the proposed scheme uses a smaller number of compression codes to encode every index that coincides with another on the predefined path. Compared with VQ, SOC and STC, the proposed scheme performs better in terms of compression bit rate.