Quad tree structures for image compression applications


Journal Article

Traditionally, lossy compression schemes have focused on compressing data at fixed bit rates to either communicate information over limited bandwidth communication channels, or to store information in a fixed-size storage media. In this paper we describe a class of lossy algorithms that is capable of compressing image data over a wide range of rates so that quick browsing of large amounts of information as well as detailed examination of high resolution areas can be achieved by the same compression system. To accomplish this we use a quad tree structure to decompose an image into variable size blocks which are subsequently quantized using a Tree-Structured Vector Quantizer (TSVQ). The developed algorithms utilize variable-size image blocks encoded within quad tree data structures to efficiently encode image areas with different information content. These algorithms are also capable of compressing images so that the loss of information complies with user defined distortion requirements. In this paper we describe the use of quad tree structures in image compression type applications and we analyze their advantages over the classic vector quantization schemes. Finally, we describe their progressive compression capabilities and we demonstrate that they achieve higher compression/ distortion performance compared to the classic TSVQ algorithm. © 1992.

Full Text

Duke Authors

Cited Authors

  • Markas, T; Reif, J

Published Date

  • January 1, 1992

Published In

Volume / Issue

  • 28 / 6

Start / End Page

  • 707 - 721

International Standard Serial Number (ISSN)

  • 0306-4573

Digital Object Identifier (DOI)

  • 10.1016/0306-4573(92)90063-6

Citation Source

  • Scopus