By Topic

A lossless image compression algorithm using variable block size segmentation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ranganathan, N. ; Center for Microelectron. Res., Univ. of South Florida, Tampa, FL, USA ; Romaniuk, S.G. ; Namuduri, K.R.

In this paper, we present an analysis of two image characteristics which give rise to local and global redundancy in image representation. Based on this study, we propose a lossless image compression scheme which exploits both types of redundancy. The algorithm segments the image into variable size blocks and encodes them depending on characteristics exhibited by the pixels within the block. The performance of the proposed algorithm is studied by software implementation. The proposed algorithm works better than other lossless compression schemes such as the Huffman, the arithmetic, the Lempel-Ziv and the JPEG

Published in:

Pattern Recognition, 1994. Vol. 3 - Conference C: Signal Processing, Proceedings of the 12th IAPR International Conference on

Date of Conference:

9-13 Oct 1994