Abstract
An established method for developing unbalanced binary tree-structured vector quantizers is greedy growing followed by optimal pruning. These algorithms can be extended to a hybrid binary/quaternary tree structure or to a pure quaternary tree structure. The trade-off of decreased distortion for increased rate is examined for the split into two or four children at each terminal node. The trees employing quaternary splits have smaller memory requirements for the codebook and provide slightly lower mean-squared-error on the test sequence as compared to a binary tree. >
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.
