{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T04:59:08Z","timestamp":1698037148642},"reference-count":9,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":6829,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[1990,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In order to store digital image data in a pel\u2010by\u2010pel representation a huge amount of storage capacity is necessary. For example a DIN A4 page scanned with a resolution of 300 dpi (dots per inch) needs about 1.1 Mbyte storage capacity in binary representation.<\/jats:p><jats:p>This paper deals with various methods to compress binary image data. The focus is to discuss their suitability for archiving usual business documents made up of text, graphics and halftone segments.<\/jats:p><jats:p>The two\u2010dimensional CCITT group 4 recommendation is compared with an adaptive prediction algorithm and a Classified Pel\u2010Pattern (CLAP) method. For the latter a very efficient systematic code is given. The Classified Pel\u2010Pattern algorithm achieves the best data compression but at the cost of high complexity. Compressing documents scanned with a resolution of 300 dpi the measured compression ratio is between 1.3\u20132.5 (halftone pictures) and 50 (line art). Considering only text and graphic documents the recommendation of the CCITT is 5\u201310% worse but complexity is significantly less. However, it is found that this methods show unsatisfactory results applied to halftone pictures.<\/jats:p>","DOI":"10.1002\/ett.4460010111","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T12:53:22Z","timestamp":1221224002000},"page":"59-65","source":"Crossref","is-referenced-by-count":1,"title":["Comparison of different facsimile data compression methods for text, graphics and halftone documents"],"prefix":"10.1002","volume":"1","author":[{"given":"Wolfgang","family":"B\u00f6hm","sequence":"first","affiliation":[]},{"given":"Ralf","family":"Hartmann","sequence":"additional","affiliation":[]},{"given":"G\u00fcnther","family":"Ruske","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_1","unstructured":"Bay73.B. E.Bayer:An optimum method for two\u2010level rendition of continuous\u2010tone pictures International Conference on Communications 1973 2.26\u20131."},{"key":"e_1_2_1_3_1","unstructured":"WoSt77.K. Y.Wong P.Stucki:Adaptive switching of dispersed and clustered dot paiterns for bi\u2010level halfone rendition. SID Digest of Technical Papers vol. VIII 1977."},{"key":"e_1_2_1_4_1","unstructured":"CCITT84.CCITT VIIIth Plenary Assembly:Recommendation T. 61 facsimile coding schemes and coding control functions for group 4 facsimile apparatus. Malaga\u2010Torremolinos.1984."},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"KoBa74.H.Kobayashi L. R.Bahl:Image data compression by predictive coding. IBM Journal Research and Development 1974 S.164.","DOI":"10.1147\/rd.182.0164"},{"issue":"2","key":"e_1_2_1_6_1","first-page":"30","article-title":"A highly efficient run\u2010length coding scheme for facsimile transmission","volume":"58","author":"Takagi M.","year":"1975","journal-title":"Electronics and Cornmunications in Japan"},{"issue":"11","key":"e_1_2_1_7_1","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1109\/TCOM.1977.1093776","article-title":"Comparison of redundancy reducing codes for facsimile daia iransrnission of documents","volume":"25","author":"Musmann H. G.","year":"1977","journal-title":"IEEE Transactions on Communications."},{"key":"e_1_2_1_8_1","unstructured":"UeOnSeToOh78.Y.Ueno F.Ono T.Semasa S.Tomita R.Oh\u2010nishi:Comparison of facsimile data compression methods. IEEE International Conference on Communications 1978 S.48.4.1."},{"key":"e_1_2_1_9_1","unstructured":"Pr7S.D.Preun:Comparison of two\u2010dimensional facsimile coding schemes. International Conference on Communications 1975 S.7.12."},{"key":"e_1_2_1_10_1","unstructured":"OnUeOhn77.R.Ohnishi Y.Ueno F.Ono:Optimization of facsimile data compression. National Telecommunications Conference 1977 S.49 1\u20131."}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460010111","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460010111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T19:53:14Z","timestamp":1698004394000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460010111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["10.1002\/ett.4460010111"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460010111","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"value":"1124-318X","type":"print"},{"value":"1541-8251","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}