loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
23rd EUROMICRO Conference '97 New Frontiers of Information Technology
A new algorithm for monochromatic image compression
Budapest, HUNGARY
September 01-September 04
ISBN: 0-8186-8129-2
C.A.B. Mello, Dept. de Inf., Univ. Federal de Pernambuco, Recife, Brazil
L.R.F. Neto, Dept. de Inf., Univ. Federal de Pernambuco, Recife, Brazil
R.D. Lins, Dept. de Inf., Univ. Federal de Pernambuco, Recife, Brazil
This paper presents a new algorithm for image compression which makes use of a variation of the run-length encoding and Huffman codes. This algorithm was tested on monochromatic images of letters and documents. A comparative study with other compression methods is presented. In the best case, our algorithm is almost 53% more efficient than the version of the Lempel-Ziv-Welch algorithm used in GIF files.
Index Terms:
data compression; monochromatic image compression algorithm; run-length encoding; Huffman codes; letters; documents; efficiency; Lempel-Ziv-Welch algorithm; GIF files
Citation:
C.A.B. Mello, L.R.F. Neto, R.D. Lins, "A new algorithm for monochromatic image compression," euromicro, pp.308, 23rd EUROMICRO Conference '97 New Frontiers of Information Technology, 1997
Usage of this product signifies your acceptance of the Terms of Use.