Show simple item record

dc.contributor.authorGerek, Ö. N.en_US
dc.contributor.authorTewfik, A. H.en_US
dc.contributor.authorÇetin, A. E.en_US
dc.date.accessioned2016-02-08T12:00:27Z
dc.date.available2016-02-08T12:00:27Z
dc.date.issued1996en_US
dc.identifier.isbn0780332598
dc.identifier.urihttp://hdl.handle.net/11693/27731
dc.description.abstractEfficient 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.en_US
dc.language.isoEnglishen_US
dc.source.titleProceedings of 3rd IEEE International Conference on Image Processingen_US
dc.subjectAlgorithmsen_US
dc.subjectBinary codesen_US
dc.subjectDatabase systemsen_US
dc.subjectImage codingen_US
dc.subjectInformation retrieval systemsen_US
dc.subjectOptical character recognitionen_US
dc.subjectBinary textual imagesen_US
dc.subjectImage compression ratioen_US
dc.subjectImage compressionen_US
dc.titleSubband coding of binary textual images for document retrievalen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Electrical and Electronics Engineering
dc.citation.spage899en_US
dc.citation.epage902en_US
dc.identifier.doi10.1109/ICIP.1996.561050
dc.publisherIEEE (Institute of Electrical and Electronics Engineers)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record