Share Email Print
cover

Optical Engineering

Universal lossless compression algorithm for textual images
Author(s): Saif al Zahir
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In recent years, an unparalleled volume of textual information has been transported over the Internet via email, chatting, blogging, tweeting, digital libraries, and information retrieval systems. As the volume of text data has now exceeded 40% of the total volume of traffic on the Internet, compressing textual data becomes imperative. Many sophisticated algorithms were introduced and employed for this purpose including Huffman encoding, arithmetic encoding, the Ziv-Lempel family, Dynamic Markov Compression, and Burrow-Wheeler Transform. My research presents novel universal algorithm for compressing textual images. The algorithm comprises two parts: 1. a universal fixed-to-variable codebook; and 2. our row and column elimination coding scheme. Simulation results on a large number of Arabic, Persian, and Hebrew textual images show that this algorithm has a compression ratio of nearly 87%, which exceeds published results including JBIG2.

Paper Details

Date Published: 9 April 2012
PDF: 11 pages
Opt. Eng. 51(3) 037010 doi: 10.1117/1.OE.51.3.037010
Published in: Optical Engineering Volume 51, Issue 3
Show Author Affiliations
Saif al Zahir, Univ. of Northern British Columbia Prince George Campus (Canada)


© SPIE. Terms of Use
Back to Top