1-D chaincode pattern matching for compression of Bi-level printed farsi and arabic textual images

Authors:
Hadi Grailu;Mojtaba Lotfizad;Hadi Sadoghi-Yazdi
Affiliations:
Department of Electrical Engineering, Tarbiat Modares University, Tehran, Iran;Department of Electrical Engineering, Tarbiat Modares University, Tehran, Iran;Department of Computer Engineering, Ferdowsi University of Mashhad, Mashhad, Iran
Venue:
Image and Vision Computing
Year:
2009

Citing 14
Cited 0

Text compression

Text compression
Vector quantization and signal compression

Vector quantization and signal compression
Symbolic compression and processing of document images

Computer Vision and Image Understanding - Special issue on document image understanding and retrieval
Managing gigabytes (2nd ed.): compressing and indexing documents and images

Managing gigabytes (2nd ed.): compressing and indexing documents and images
Algorithms for Graphics and Imag

Algorithms for Graphics and Imag
A Fast Binary Template Matching Algorithm for Document Image Data Cmpression

Proceedings of the 4th International Conference on Pattern Recognition
Data Compression: The Complete Reference

Data Compression: The Complete Reference
Fundamental Data Compression

Fundamental Data Compression
A Means for Achieving a High Degree of Compaction on Scan-Digitized Printed Text

IEEE Transactions on Computers
A Concise Introduction to Data Compression (Undergraduate Topics in Computer Science)

A Concise Introduction to Data Compression (Undergraduate Topics in Computer Science)
Word autocorrelation redundancy match (WARM) technology

IBM Journal of Research and Development
Dictionary design for text image compression with JBIG2

IEEE Transactions on Image Processing
Fast and memory efficient text image compression with JBIG2

IEEE Transactions on Image Processing
The emerging JBIG2 standard

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In some scripts, especially the Farsi/Arabic script, letters normally attach together and produce many different patterns, some of which are fully or partially similar. Detecting such patterns and exploiting them to reduce the library size, has a rather great effect on the compression ratio. In this paper, a lossy/lossless compression method is proposed for bi-level printed text images in archiving applications. For this, we propose a new 1-D pattern matching technique in the chain coding domain that uses the proposed technique of detecting the repetitive sub-signals in order to detect the fully or partially similar patterns. Experimental results show that the compression performance of the proposed method is considerably better than those of the existing bi-level printed text image compression methods as high as 1.8-4.2 times in the lossy case and 1.6-3.8 times in the lossless case at 300dpi.