Correcting broken characters in the recognition of historical printed documents

Authors:
Michael Droettboom
Affiliations:
Johns Hopkins University, Baltimore, MD
Venue:
Proceedings of the 3rd ACM/IEEE-CS joint conference on Digital libraries
Year:
2003

Citing 3
Cited 5

Using the Gamera framework for the recognition of cultural heritage materials

Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries
Goal-Directed Evaluation of Binarization Methods

IEEE Transactions on Pattern Analysis and Machine Intelligence
Probabilistic Retrieval of OCR Degraded Text Using N-Grams

ECDL '97 Proceedings of the First European Conference on Research and Advanced Technology for Digital Libraries

Recognition of degraded characters using dynamic Bayesian networks

Pattern Recognition
Adaptive shape prior for recognition and variational segmentation of degraded historical characters

Pattern Recognition
Enhancement of historical printed document images by combining Total Variation regularization and Non-local Means filtering

Image and Vision Computing
Modeling broken characters recognition as a set-partitioning problem

Pattern Recognition Letters
Query representation for cross-temporal information retrieval

Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new technique for dealing with broken characters, one of the major challenges in the optical character recognition (OCR) of degraded historical printed documents. A technique based on graph combinatorics is used to rejoin the appropriate connected components. It has been applied to real data with successful results.