Share Email Print

Proceedings Paper

Benchmarking system for document analysis algorithms
Author(s): Sami Nieminen; Jaakko J. Sauvola; Tapio Seppanen; Matti Pietikainen
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

With the increasing interest in document analysis research the number of available OCR, segmentation, noise removal and various other document analysis algorithms has grown considerably. However, algorithms are still purpose- specific, and to obtain optimal results, different algorithms for different situations are usually needed. The problem is to reliably evaluate the performance of an algorithm in a given situation. A framework for a benchmarking system for document analysis algorithms is presented. The system consists of a set of test cases for measuring the performance of different document analysis algorithms. The system is expandable, new algorithm types to be tested can be added by creating new test cases and benchmarking methods. The whole benchmarking process can be automated to allow mass performance testing with numerous algorithms. A set of weights is used to adjust the relative significance of the different aspects of a test case. The results of the benchmarking are expressed as a single value, which presents the performance of the algorithm in a given test case. The result can be easily compared with the results of other algorithms, which enables the ranking of the tested algorithms. Experiments with benchmarking system show promising results. The performance ranking also complies well with subjective human evaluation.

Paper Details

Date Published: 1 April 1998
PDF: 12 pages
Proc. SPIE 3305, Document Recognition V, (1 April 1998); doi: 10.1117/12.304623
Show Author Affiliations
Sami Nieminen, Univ. of Oulu (Finland)
Jaakko J. Sauvola, Univ. of Oulu (Finland)
Tapio Seppanen, Univ. of Oulu (Finland)
Matti Pietikainen, Univ. of Oulu (Finland)

Published in SPIE Proceedings Vol. 3305:
Document Recognition V
Daniel P. Lopresti; Jiangying Zhou, Editor(s)

© SPIE. Terms of Use
Back to Top