Multi-subspace tree-structured vector quantizer design algorithms

  • Authors:

  • Lai-man Po

  • Affiliations:

  • Dept. of Electronic Engineering, City Polytechnic of Hong Kong, Kowloon, Hong Kong

  • Venue:
  • ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: image and multidimensional signal processing - Volume V
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

To further reduce the searching complexity and memory requirement of the tree-structured vector quantization (TSVQ), new multi-subspace TSVQ design algorithms and encoding techniques are proposed in this paper. The proposed multisubspace TSVQ design algorithms perform the vector quantization in spatial domain while using specially designed subspacedistortions in transform domain as cost functions for the optimization process. The dimensionality and basis of subspace distortions are selected based on the local statistics of the partition associated with each non-terminal node of the tree. Experimental results show that extremely low subspace dimension can be used in multi-subspace TSVQ based on a fixed transform domain to obtain a similar performance as the conventional TSVQ or single subspace TSVQ. In addition, the proposed generalized multi-subspace TSVQ design algorithm is a general TSVQ design algorithm and which can also be utilized as a fast codebook design algorithm.