Skip to main content
SpringerLink
Log in
Book cover

International Conference on Pattern Recognition

PAR 1988: Pattern Recognition pp 230–239Cite as

A fast binary template matching algorithm for document image data compression

  • Document Processing
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 301))

Abstract

In the coding of digital facsimile documents, a number of non-information-preserving codes have been proposed which make use of the repetition of binary patterns corresponding to printed or typewritten text characters. The success of such a scheme depends on the accuracy and speed of the template-matching algoritnm which decides whether one pattern may be substituted for another without loss of context or legibility. This paper proposes a template-matching algorithm whose accuracy compares favourably with that of other reported algorithms, and whose execution time is significantly faster in computer simulations. The proposed algorithm is particularly well suited to realisation in parallel hardware.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BODSON, D., DEUTERMANN, A.R., URBAN, S.J. and CLARKE, C.E., ‘Measurement of data compression in advanced Group-4 facsimile systems', Proc. IEEE, 1985, Vol.73, No.4, pp.731–739.

    Google Scholar 

  2. ASCHER, R.N. and NAGY, G.: ‘A means for achieving a high degree of compaction on sign-digitized text', IEEE Trans. Comout., 1974, Vol.C-23, pp.1174–1179.

    Google Scholar 

  3. PRATT W.K., CAPITANT, P.J., CHEN, W., HAMILTON, E.R. and WALLIS, R.H.: ‘Combined symbol matching facsimile data compression system', Proc. IEEE, 1980, Vol.68, pp.786–796.

    Google Scholar 

  4. JOHNSEN, O., SEGEN, J. and CASH, G. L.: ‘Coding of two-level pictures by pattern-matching and substitution', Bell System Tech. J., 1983, Vol.62, pp.2513–2547.

    Google Scholar 

  5. HOLT, M.J.J. and XYDEAS, C.S.: ‘Recent developments in image data compression for digital facsimile', ICL Technical Journal, May 1986, Vol.5, No.1, pp.123–146.

    Google Scholar 

  6. HOLT, M.J.J.: 'symbol pattern matching', UK Patent Application No.8525509, filed 16 Oct. 1985.

    Google Scholar 

  7. NEWMAN, W.M. and SPROULL, R.F.: Principles of Interactive Computer Graphics, 2nd Edn., McGraw-Hill, Tokyo, 1981, Chapter 18.

    Google Scholar 

  8. REDDAWAY, S.F.: ‘DAP and its application to image processing', Image Processing Symposium, RSRE Malvern, 1983, Paper 6.3.

    Google Scholar 

  9. HOLT, M.J.J. and XYDEAS, C.S.: ‘An efficient hybrid code for document image data compression', in preparation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic and Electrical Engineering, Loughborough University of Technology, LE11 3TU, Loughborough, Leics, England

    Murray J. J. Holt

Authors
  1. Murray J. J. Holt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Kittler

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Holt, M.J.J. (1988). A fast binary template matching algorithm for document image data compression. In: Kittler, J. (eds) Pattern Recognition. PAR 1988. Lecture Notes in Computer Science, vol 301. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19036-8_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-19036-8_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19036-3

  • Online ISBN: 978-3-540-38947-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation