Title :
Recursive optimal pruning of tree-structured vector quantizers
Author :
Kiang, Shei-Zein ; Sullivan, Gary J. ; Chiu, Chung-Yen ; Baker, Richard L.
Author_Institution :
Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA
Abstract :
The generalized BFOS (G-BFOS), a sequential pruning algorithm for designing optimal tree structures, was presented by Chou, Lookabaugh, and Gray (see IEEE Trans. Inf. Theory, vol.35, no.2, p.299, 1989), and it was applied to tree-structured vector quantizers (TSVQ). G-BFOS yields VQ codebooks that often outperform conventional generalized Lloyd full search codebooks having the same rate and block size. The authors have developed a modified version of G-BFOS, called the recursive optimal pruning algorithm (ROPA), which recursively searches for the nodes to be pruned next. The sequence of these pruned codebooks includes the original optimal G-BFOS codebooks and many additional ones. The optimality of these codebooks is described, and simulations evaluate their performance
Keywords :
data compression; encoding; picture processing; trees (mathematics); generalised BFOS algorithm; optimal G-BFOS codebooks; optimal tree structures; performance evaluation; pruned codebooks; recursive optimal pruning algorithm; sequential pruning algorithm; simulations; tree-structured vector quantizers; Algorithm design and analysis; Classification tree analysis; Costs; Design methodology; Performance loss; Propulsion; Rate distortion theory; Regression tree analysis; Thumb; Tree data structures;
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference on
Conference_Location :
Toronto, Ont.
Print_ISBN :
0-7803-0003-3
DOI :
10.1109/ICASSP.1991.150749