loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th International Conference on Pattern Recognition (ICPR'04) - Volume 2
Lossless Data Compression for Image Decomposition With Recursive IDP Algorithm
Cambridge UK
August 23-August 26
ISBN: 0-7695-2128-2
Mariofanna Milanova, University of Arkansas at Little Rock, USA
Vladimir Todorov, T&K Engineering Co., Sofia, Bulgaria
Roumiana Kountcheva, T&K Engineering Co., Sofia, Bulgaria
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.
Citation:
Mariofanna Milanova, Vladimir Todorov, Roumiana Kountcheva, "Lossless Data Compression for Image Decomposition With Recursive IDP Algorithm," icpr, vol. 2, pp.823-826, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 2, 2004
Usage of this product signifies your acceptance of the Terms of Use.