Abstract
Consider a multi-resolution source code for describing a stationary source at L resolutions. The description at the first resolution is given at rate R/sub 1/ and achieves an expected distortion no greater than D/sub 1/. The description at the second resolution includes both the first description and a refining description of rate R/sub 2/ and achieves expected distortion no greater than D/sub 2/, and so on. Previously derived multi-resolution source coding bounds describe the family of achievable rate and distortion vectors ((R/sub 1/, R/sub 2/, ..., R/sub L/), (D/sub 1/, D/sub 2/, D/sub L/)). By examining these multi-resolution rate-distortion bounds, we gain insight into the problem of practical multi-resolution source coding. These insights lead to a new multi-resolution source code based on the tree-structured vector quantizer. This paper covers the algorithm, its optimal design, and preliminary experimental results.
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.
