Skip to main content

Performance Evaluation of Document Image Algorithms

  • Conference paper
  • First Online:
Graphics Recognition Recent Advances (GREC 1999)

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

Included in the following conference series:

Abstract

Performance evaluation for document image processing has a different emphasis than performance evaluation in other areas of image processing. Other areas of image processing can tolerate some error. Because it is so easily done nearly perfectly by humans, document image processing must also be done nearly perfectly. So the first aspect of performance evaluation for document image processing is to determine the domain in which the performance is nearly perfect. Outside this domain, the algorithm makes errors. Such instances of errors need to be examined and classified and categorized so that the weaknesses of the algorithm can be characterized.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramovitz, M. and Stegum, I. (Eds.), Handbook of Mathematical Functions, Dover Publications Inc., New York, 1972.

    Google Scholar 

  2. Devijver, P. A. and Kittler, J., Pattern Recognition: A Statistical Approach, Prentice Hall International, London, l982.

    Google Scholar 

  3. Fununaga, K., Introduction to Statistical Pattern Recognition, Academic Press, New York, l972.

    Google Scholar 

  4. Jockel, K. H., “Finite Sample Properties and Asymptotic Efficiency of Monte Carlo Tests,” The Annals of Statistics, Vol. 14, 1986, pp. 336–347.

    Article  MathSciNet  Google Scholar 

  5. Johnson, N. and Kotz, S., Discrete Distributions, Hougton Mifflin Co., Boston, 1969.

    MATH  Google Scholar 

  6. Johnson, N. and Kotz, S., Continuous Univariate Distribution-2, Houghton Miffin Co., Boston, 1970.

    Google Scholar 

  7. Marriott, F. H. C., “Barmarks Monte Carlo Tests: How many simulations?”, Applied Statistics, Vol. 28, 1979, pp. 75–77.

    Article  Google Scholar 

  8. Pearson, E. S. and Hartley, E. O., Biometrical Tables for Statisticians, Vol. 1, (2nd Edition) Cambridge University Press, London, 1958.

    Google Scholar 

  9. Pearson, K., (Ed.), Tables of Incomplete Beta Function, 2nd Edition, Cambridge University Press, London, 1968.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haralick, R.M. (2000). Performance Evaluation of Document Image Algorithms. In: Chhabra, A.K., Dori, D. (eds) Graphics Recognition Recent Advances. GREC 1999. Lecture Notes in Computer Science, vol 1941. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40953-X_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-40953-X_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41222-9

  • Online ISBN: 978-3-540-40953-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics