Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
