{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:33:53Z","timestamp":1760708033147,"version":"3.41.2"},"reference-count":35,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2009,3,27]],"date-time":"2009-03-27T00:00:00Z","timestamp":1238112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,3,27]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The purpose of this paper is to propose a lossy\/lossless binary textual image compression method based on an improved pattern matching (PM) technique.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>In the Farsi\/Arabic script, contrary to the printed Latin script, letters usually attach together and produce various patterns. Hence, some patterns are fully or partially subsets of some others. Two new ideas are proposed here. First, the number of library prototypes is reduced by detecting and then removing the fully or partially similar prototypes. Second, a new effective pattern encoding scheme is proposed for all types of patterns including text and graphics. The new encoding scheme has two operation modes of chain coding and soft PM, depending on the ratio of the pattern area to its chain code effective length. In order to encode the number sequences, the authors have modified the multi\u2010symbol QM\u2010coder. The proposed method has three levels for the lossy compression. Each level, in its turn, further increases the compression ratio. The first level includes applying some processing in the chain code domain such as omission of small patterns and holes, omission of inner holes of characters, and smoothing the boundaries of the patterns. The second level includes the selective pixel reversal technique, and the third level includes using the proposed method of prioritizing the residual patterns for encoding, with respect to their degree of compactness.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>Experimental results show that the compression performance of the proposed method is considerably better than that of the best existing binary textual image compression methods as high as 1.6\u20103 times in the lossy case and 1.3\u20102.4 times in the lossless case at 300\u2009dpi. The maximum compression ratios are achieved for Farsi and Arabic textual images.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Research limitations\/implications<\/jats:title><jats:p>Only the binary printed typeset textual images are considered.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Practical implications<\/jats:title><jats:p>The proposed method has a high\u2010compression ratio for archiving and storage applications.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>To the authors' best knowledge, the existing textual image compression methods or standards have not so far exploited the property of full or partial similarity of prototypes for increasing the compression ratio for any scripts. Also, the idea of combining the boundary description methods with the run\u2010length and arithmetic coding techniques has not so far been used.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17563780910939273","type":"journal-article","created":{"date-parts":[[2009,3,21]],"date-time":"2009-03-21T08:02:12Z","timestamp":1237622532000},"page":"120-147","source":"Crossref","is-referenced-by-count":15,"title":["An improved pattern matching technique for lossy\/lossless compression of binary printed Farsi and Arabic textual images"],"prefix":"10.1108","volume":"2","author":[{"given":"Hadi","family":"Grailu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mojtaba","family":"Lotfizad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadi","family":"Sadoghi\u2010Yazdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2022031520230716700_b6","doi-asserted-by":"crossref","unstructured":"Ascher, R.N. and Nagy, G. (1974), \u201cA means for achieving a high degree of compaction on scan\u2010digitized printed text\u201d, IEEE Trans. Comput., Vol. 23, pp. 1174\u20109.","DOI":"10.1109\/T-C.1974.223826"},{"key":"key2022031520230716700_b5","unstructured":"Barnsley, M.F. and Hurd, L.P. (1993), Fractal Image Compression, Peters, Wellesley, MA."},{"key":"key2022031520230716700_b34","unstructured":"Bell, T.C., Cleary, J.G. and Witten, I.H. (1990), Text Compression, Prentice\u2010Hall, Englewood Cliffs, NJ."},{"key":"key2022031520230716700_b32","doi-asserted-by":"crossref","unstructured":"Bottou, L., Haffner, P., Howard, P.G., Simard, P., Bengio, Y. and LeCun, Y. (1998), \u201cHigh quality document image compression with \u2018DjVu\u2019\u201d, Journal of Electronic Imaging, Vol. 7, pp. 410\u201025.","DOI":"10.1117\/1.482609"},{"key":"key2022031520230716700_b13","doi-asserted-by":"crossref","unstructured":"Brickman, N.F. and Rosenbaum, W.S. (1982), \u201cWord autocorrelation redundancy match (WARM) technology\u201d, IBM J. Res. Devel., Vol. 26, pp. 681\u20106.","DOI":"10.1147\/rd.266.0681"},{"key":"key2022031520230716700_b20","doi-asserted-by":"crossref","unstructured":"Cirrincione, G. and Cirrincione, M. (2007), \u201cNeural networks for matching in computer vision\u201d, KES 2007, pp. 688\u201095.","DOI":"10.1007\/978-3-540-74819-9_85"},{"key":"key2022031520230716700_b23","doi-asserted-by":"crossref","unstructured":"Eggert, J., Zhang, C. and Corner, E. (2007), \u201cTemplate matching for large transformations\u201d, ICANN 2007, pp. 169\u201079.","DOI":"10.1007\/978-3-540-74695-9_18"},{"key":"key2022031520230716700_b3","doi-asserted-by":"crossref","unstructured":"Gersho, A. and Gray, R. (1992), Vector Quantization and Signal Compression, Kluwer, Norwell, MA.","DOI":"10.1007\/978-1-4615-3626-0"},{"key":"key2022031520230716700_b8","doi-asserted-by":"crossref","unstructured":"Holt, M.J. (1988), \u201cA fast binary template matching algorithm for document image data compression\u201d, in Kittler, J. (Ed.), Pattern Recognition, Springer, Berlin, pp. 230\u20109.","DOI":"10.1007\/3-540-19036-8_22"},{"key":"key2022031520230716700_b15","unstructured":"Holt, M.J.J. and Xydeas, C.S. (1986), \u201cRecent developments in image data compression for digital facsimile\u201d, ICL Tech. J., pp. 123\u201046, May."},{"key":"key2022031520230716700_b16","doi-asserted-by":"crossref","unstructured":"Howard, P.G. (1997), \u201cText image compression using soft pattern matching\u201d, The Computer Journal, Vol. 40, pp. 146\u201056.","DOI":"10.1093\/comjnl\/40.2_and_3.146"},{"key":"key2022031520230716700_b17","doi-asserted-by":"crossref","unstructured":"Howard, P.G., Kossentini, F., Forchhammer, S. and Ruchlidge, W.J. (1998), \u201cThe emerging JBIG2 standard\u201d, IEEE Trans. on Circuits and Sys. for Video Tech., Vol. 8, pp. 838\u201048.","DOI":"10.1109\/76.735380"},{"key":"key2022031520230716700_b33","unstructured":"ISO\/IEC International Standard 11544 (1993), \u201cProgressive binary image compression\u201d, JBIG, ITU\u2010Recommendation T.82."},{"key":"key2022031520230716700_b4","unstructured":"Jain, A. (1989), Fundamentals of Digital Image Processing, Prentice\u2010Hall, Englewood Cliffs, NJ."},{"key":"key2022031520230716700_b14","doi-asserted-by":"crossref","unstructured":"Johnsen, O., Segen, J. and Cash, G.L. (1983), \u201cCoding of two\u2010level pictures by pattern matching and substitution\u201d, Bell Syst. Tech. J., Vol. 62, pp. 2513\u201045.","DOI":"10.1002\/j.1538-7305.1983.tb03192.x"},{"key":"key2022031520230716700_b12","doi-asserted-by":"crossref","unstructured":"Kanungo, T., Haralick, R.M. and Phillips, I.T. (1993), \u201cGlobal and local document degradation models\u201d, Proc. ICDAR, pp. 730\u20104.","DOI":"10.1109\/ICDAR.1993.395633"},{"key":"key2022031520230716700_b10","doi-asserted-by":"crossref","unstructured":"Kia, O.E. and Doermann, D.S. (2000), \u201cResidual coding in document image compression\u201d, IEEE Trans. on Image Proc., Vol. 9, pp. 961\u20109.","DOI":"10.1109\/83.846239"},{"key":"key2022031520230716700_b9","doi-asserted-by":"crossref","unstructured":"Kia, O.E., Doermann, D.S., Rosenfeld, A. and Chellappa, R. (1998), \u201cSymbolic compression and processing of document images\u201d, Computer Vision and Image Understanding, Vol. 70, pp. 335\u201049.","DOI":"10.1006\/cviu.1998.0682"},{"key":"key2022031520230716700_b31","unstructured":"Kok, C.W. and Nguyen, T.Q. (1996), \u201cDocument image compression by sub\u2010band system\u201d, IEEE ISCAS '96, Atlanta, GA, USA, Vol. 2, pp. 688\u201091."},{"key":"key2022031520230716700_b22","doi-asserted-by":"crossref","unstructured":"Marimon, D. and Ebrahimi, T. (2007), \u201cEfficient rotation\u2010discriminative template matching\u201d, CIARP 2007, Chile, pp. 221\u201030.","DOI":"10.1007\/978-3-540-76725-1_24"},{"key":"key2022031520230716700_b21","doi-asserted-by":"crossref","unstructured":"Michael, A.P., Sharath, K. and Chee\u2010Hung, H.C. (2008), \u201cTexture\u2010based image steganalysis by artificial neural networks\u201d, International Journal of Intelligent Computing and Cybernetics, Vol. 1, pp. 549\u201062.","DOI":"10.1108\/17563780810919122"},{"key":"key2022031520230716700_b11","unstructured":"Moffat, A. (1991), \u201cTwo level context based compression of binary images\u201d, in Storer, J.A. and Reif, J.H. (Eds), Proc. IEEE Data Comp. Conf., IEEE Computer Society Press, Los Alamitos, CA, pp. 382\u201091."},{"key":"key2022031520230716700_b7","doi-asserted-by":"crossref","unstructured":"Pratt, W.K., Capitant, P.J., Chen, W.H., Hamilton, E.R. and Wallis, R.H. (1980), \u201cCombined symbol matching facsimile data compression system\u201d, Proc. IEEE, Vol. 68, pp. 786\u201096.","DOI":"10.1109\/PROC.1980.11744"},{"key":"key2022031520230716700_b30","doi-asserted-by":"crossref","unstructured":"Pu, I.M. (2006), Fundamental Data Compression, Butterworth\u2010Heinemann, Oxford.","DOI":"10.1016\/B978-075066310-6\/50013-1"},{"key":"key2022031520230716700_b27","unstructured":"Salomon, D. (2007), Data Compression, the Complete Reference, 4th ed., Springer, London."},{"key":"key2022031520230716700_b28","doi-asserted-by":"crossref","unstructured":"Salomon, D. (2008), A Concise Introduction to Data Compression, Springer, London.","DOI":"10.1007\/978-1-84800-072-8"},{"key":"key2022031520230716700_b29","doi-asserted-by":"crossref","unstructured":"Sayood, K. (Ed.) (2003), Lossless Compression Handbook, Academic Press, New York, NY.","DOI":"10.1201\/9781420041163-101"},{"key":"key2022031520230716700_b24","doi-asserted-by":"crossref","unstructured":"Song, J., Chen, B., Chi, Z., Qiu, X. and Wang, W. (2007), \u201cFace recognition based on binary template matching\u201d, ICIC 2007, Qingdao, pp. 1131\u20109.","DOI":"10.1007\/978-3-540-74171-8_115"},{"key":"key2022031520230716700_b19","doi-asserted-by":"crossref","unstructured":"Stefano, L.D., Mattoccia, S. and Tombari, F. (2004), \u201cAn algorithm for efficient and exhaustive template matching\u201d, ICIAR 2004, Porto, pp. 408\u201015.","DOI":"10.1007\/978-3-540-30125-7_51"},{"key":"key2022031520230716700_b18","doi-asserted-by":"crossref","unstructured":"Wei, S.D. and Lai, S.H. (2007), \u201cEfficient normalized cross correlation based on adaptive multilevel successive elimination\u201d, ACCV 2007, Vol. 4843, pp. 638\u201046.","DOI":"10.1007\/978-3-540-76386-4_60"},{"key":"key2022031520230716700_b2","unstructured":"Witten, I.H., Moffat, A. and Bell, T.C. (1999), Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd ed., Academic Press, New York, NY."},{"key":"key2022031520230716700_b1","doi-asserted-by":"crossref","unstructured":"Witten, I.H., Bell, T.C., Emberson, H., Inglis, S. and Moffat, A. (1994), \u201cTextual image compression: two\u2010stage lossy\/lossless encoding of textual images\u201d, Proc. of the IEEE, Vol. 82 No. 6.","DOI":"10.1109\/5.286192"},{"key":"key2022031520230716700_b35","doi-asserted-by":"crossref","unstructured":"Yang, Y., Yan, H. and Yu, D. (2000), \u201cContent\u2010lossless document image compression based on structural analysis and pattern matching\u201d, Pattern Recognition, Vol. 33, pp. 1277\u201093.","DOI":"10.1016\/S0031-3203(99)00112-0"},{"key":"key2022031520230716700_b25","doi-asserted-by":"crossref","unstructured":"Ye, Y. and Cosman, P. (2001), \u201cDictionary design for text image compression with JBIG2\u201d, IEEE Trans. on Image Proces., Vol. 10, pp. 818\u201028.","DOI":"10.1109\/83.923278"},{"key":"key2022031520230716700_b26","doi-asserted-by":"crossref","unstructured":"Ye, Y. and Cosman, P. (2003), \u201cFast and memory efficient text image compression with JBIG2\u201d, IEEE Trans. on Image Proc., Vol. 12, pp. 944\u201056.","DOI":"10.1109\/TIP.2003.815253"}],"container-title":["International Journal of Intelligent Computing and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17563780910939273","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17563780910939273\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17563780910939273\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:44:14Z","timestamp":1753400654000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijicc\/article\/2\/1\/120-147\/273837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,27]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3,27]]}},"alternative-id":["10.1108\/17563780910939273"],"URL":"https:\/\/doi.org\/10.1108\/17563780910939273","relation":{},"ISSN":["1756-378X"],"issn-type":[{"type":"print","value":"1756-378X"}],"subject":[],"published":{"date-parts":[[2009,3,27]]}}}