Gerek, Ömer N.Çetin, A. EnisTevfik, A. H.2016-02-082016-02-081996http://hdl.handle.net/11693/27731Date of Conference: 16-19 September 1996Conference Name: 3rd IEEE International Conference on Image Processing, IEEE 1996Efficient compression of binary textual images is very important for applications such as document archiving and retrieval, digital libraries and facsimile. The basic property of a textual image is the repetitions of small character images and curves inside the document. Exploiting the redundancy of these repetitions is the key step in most of the coding algorithms. In this paper, we use a similar compression method in subband domain. Four different subband decomposition schemes are described and their performances on textual image compression algorithm is examined. Experimentally, it is found that the described methods accomplish high compression ratios and they are suitable for fast database access and keyword search.EnglishAlgorithmsBinary codesDatabase systemsImage codingInformation retrieval systemsOptical character recognitionBinary textual imagesImage compression ratioImage compressionConference Paper10.1109/ICIP.1996.561050