A lossless image compression algorithm using variable block size segmentation

Author

Ranganathan, N. ; Romaniuk, Steve G. ; Namuduri, Kameswara Rao

Author_Institution

Center for Microelectron. Res., Univ. of South Florida, Tampa, FL, USA

Volume

4

Issue

10

fYear

1995

fDate

10/1/1995 12:00:00 AM

Firstpage

1396

Lastpage

1406

Abstract

The redundancy in digital image representation can be classified into two categories: local and global. In this paper, we present an analysis of two image characteristics that give rise to local and global redundancy in image representation. Based on this study, we propose a lossless image compression scheme that exploits redundancy both at local and global levels in order to obtain maximum compression efficiency. The proposed algorithm segments the image into variable size blocks and encodes them depending on the characteristics exhibited by the pixels within the block. The proposed algorithm is implemented in software and its performance is better than other lossless compression schemes such as the Huffman, the arithmetic, the Lempel-Ziv and the JPEG

Keywords

data compression; image coding; image representation; image segmentation; redundancy; digital image representation; global redundancy; image coding; local redundancy; lossless image compression algorithm; maximum compression efficiency; variable block size segmentation; Arithmetic; Digital images; Image analysis; Image coding; Image representation; Image segmentation; Performance loss; Pixel; Software algorithms; Software performance;

fLanguage

English

Journal_Title

Image Processing, IEEE Transactions on

Publisher

ieee

ISSN

1057-7149

Type

jour

DOI

10.1109/83.465104

Filename

465104