Lossless compression of images with permutation codes

Z. Arnavut; M. Arnavut

doi:10.1117/12.794179

3 September 2008 Lossless compression of images with permutation codes

Z. Arnavut, M. Arnavut

Proceedings Volume 7075, Mathematics of Data/Image Pattern Recognition, Compression, and Encryption with Applications XI; 707508 (2008) https://doi.org/10.1117/12.794179
Event: Optical Engineering + Applications, 2008, San Diego, California, United States

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.

Citation Download Citation

Z. Arnavut and M. Arnavut "Lossless compression of images with permutation codes", Proc. SPIE 7075, Mathematics of Data/Image Pattern Recognition, Compression, and Encryption with Applications XI, 707508 (3 September 2008); https://doi.org/10.1117/12.794179

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available