Some issues related to fixed-rate pruned tree-structured vector quantizers
Nader Moayeri · IEEE Transactions on Information Theory · 1995
It is shown that the generalized BFOS algorithm is not optimal when it is used to design fixed-rate pruned tree-structured vector quantizers (PTSVQ). A simple modification is made in the algorithm which makes it optimal. However, experimental results show little difference between the rate-distortion curves generated with the original algorithm and the one proposed in the present paper. An asymptotic analysis is presented which shows how the two algorithms prune the TSVQ and explains why their results are so similar. The analysis also shows that in designing fixed-rate variable-depth TSVQs one can get as good a rate-distortion performance with a greedy TSVQ growing algorithm as with the optimal pruning of a large tree.>