Lossless and lossy compression of text images by soft pattern matching
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We present a method for both lossless and lossy compression of bilevel images that consist mostly of printed or typed text. The key feature of the method is soft pattern matching, a way of making use of the information in previously encountered characters without risking the introduction of character substitution errors. We can obtain lossless compression about 20 percent better than that of the JBIG standard by direct application of this method. By allowing some loss in a controlled manner based partly on the pattern matching, we can obtain compression ratios about two to four times the compression ratios of JBIG and three to eight times those of G3 facsimile with no visible loss of quality.Keywords
This publication has 3 references indexed in Scilit:
- Arithmetic coding for data compressionCommunications of the ACM, 1987
- Combined symbol matching facsimile data compression systemProceedings of the IEEE, 1980
- A Means for Achieving a High Degree of Compaction on Scan-Digitized Printed TextIEEE Transactions on Computers, 1974