1-D chaincode pattern matching for compression of Bi-level printed farsi and arabic textual images
Image and Vision Computing
Massive Semantic Web data compression with MapReduce
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Scanned compound document encoding using multiscale recurrent patterns
IEEE Transactions on Image Processing - Special section on distributed camera networks: sensing, processing, communication, and implementation
New public-key authentication watermarking for JBIG2 resistant to parity attacks
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
Scalable RDF data compression with MapReduce
Concurrency and Computation: Practice & Experience
| Hi-index | 0.01 |
The JBIG2 standard for lossy and lossless bilevel image coding is a very flexible encoding strategy based on pattern matching techniques. This paper addresses the problem of compressing text images with JBIG2. For text image compression, JBIG2 allows two encoding strategies: SPM and PM&S. We compare in detail the lossless and lossy coding performance using the SPM-based and PM&S-based JBIG2, including their coding efficiency, reconstructed image quality and system complexity. For the SPM-based JBIG2, we discuss the bit rate tradeoff associated with symbol dictionary design. We propose two symbol dictionary design techniques: the class-based and tree-based techniques. Experiments show that the SPM-based JBIG2 is a more efficient lossless system, leading to 8% higher compression ratios on average. It also provides better control over the reconstructed image quality in lossy compression. However, SPM's advantages come at the price of higher encoder complexity. The proposed class-based and tree-based symbol dictionary designs outperform simpler dictionary formation techniques by 8% for lossless and 16-18% for lossy compression