Abstract

An extension of entropy-constrained residual vector quantization is presented where inter-vector dependencies are exploited. The method, which the authors call conditional entropy-constrained residual vector quantization, employs a high-order entropy conditioning strategy that captures local information in the neighboring vectors. The complexity of the proposed design algorithm is relatively low, due mainly to the efficiency of the multistage structure of the residual vector quantizer, but also to the effectiveness of the searching techniques used to locate the best conditioning spatial-stage region of support. Experimental results show that the new method outperforms standard entropy-constrained residual vector quantization while also requiring lower encoding complexity and memory requirements. >

Full Text
Paper version not known

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 call

Disclaimer: 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.