Lossless data compression for image decomposition with recursive IDP algorithm

Author

Milanova, Mariofanna ; Todorov, Vladimir ; Kountcheva, Roumiana

Author_Institution

Dept. of Comput. Sci., Arkansas Univ., Little Rock, AR, USA

Volume

2

fYear

2004

fDate

23-26 Aug. 2004

Firstpage

823

Abstract

Specific algorithms for lossless compression of the data, obtained after processing of halftone and color images with the inverse difference pyramid decomposition (IDP), are described in this paper. The basic steps of the IDP algorithm (coding and decoding) are defined, and the corresponding diagram for modified Huffman code generation is shown. The presented lossless run-length and modified Huffman algorithms are used together with a lossy image coding method, and are aimed at preserving the image quality after the IDP decomposition unchanged. Some practical results and comparison with the standard JPEG2000 are given also.

Keywords

Huffman codes; data compression; image coding; image colour analysis; Huffman code generation; JPEG2000; color images; image decomposition; inverse difference pyramid decomposition; lossless data compression; recursive IDP algorithm; Color; Computer science; Data compression; Data engineering; Image coding; Image decomposition; Image quality; Image restoration; Pixel; Transform coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on

ISSN

1051-4651

Print_ISBN

0-7695-2128-2

Type

conf

DOI

10.1109/ICPR.2004.1334385

Filename

1334385