Share Email Print
cover

Proceedings Paper

Lossless compression of images with permutation codes
Author(s): Z. Arnavut; M. Arnavut
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Images contain large amount of data and are used in many applications. Not only compressed image data save space, but also in certain applications such as the World-Wide-Web (WWW), they save time since the amount of data to be transmitted is smaller than the original image. Codebook approaches have been used in lossy image compression. For example, vector quantization employs codebook. For lossless compression of images, more than a decade ago, a codebook approach based on spanning trees was proposed. In this work we investigate suitability of permutation codes for still images.

Paper Details

Date Published: 3 September 2008
PDF: 8 pages
Proc. SPIE 7075, Mathematics of Data/Image Pattern Recognition, Compression, and Encryption with Applications XI, 707508 (3 September 2008); doi: 10.1117/12.794179
Show Author Affiliations
Z. Arnavut, SUNY Fredonia (United States)
M. Arnavut, SUNY Fredonia (United States)


Published in SPIE Proceedings Vol. 7075:
Mathematics of Data/Image Pattern Recognition, Compression, and Encryption with Applications XI
Mark S. Schmalz; Gerhard X. Ritter; Junior Barrera; Jaakko T. Astola, Editor(s)

© SPIE. Terms of Use
Back to Top