A Lagrangian optimization approach to complexity-constrained TSVQ
Jean Cardinal · IEEE Signal Processing Letters · 2000
We present a new variable rate tree-structured vector quantizer (TSVQ) design algorithm, in which the complexity-distortion tradeoff is explicitly managed using a Lagrangian optimization approach. The algorithm is greedy and uses subvector distortion measures to lower the encoding complexity. We show that we can obtain low complexity encoders for the Gauss-Markov source with similar distortion to that observed on standard variable rate TSVQ.