Abstract
The paper presents an attempt to apply the Rough Sets Theory to Optical Character Recognition. In this approach specific characters’ features are referred to as an information system, from which the most important information is being extracted by the Rough Sets Theory. This process is fully automatic and does not require any human decision in the area of usefulness of certain characters’ features. A discernibility matrix which is built in this way constitutes a reduced database for classification algorithms. A brief description of Classical Optical Character Recognition Theory and Rough Sets Theory as well as some selected research and experimental results are also presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pawlak, Z.: Rough Sets — Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, 1991
Meng-Chieh, L.: Software System For Intelligent Data Processing And Discovering Based On The Fuzzy-Rough Sets Theory. Thesis, San Diego State University, 1995
Lichon, J.: Classical Hand-written Latin Character Recognition Algorithms. Master’s thesis, Warsaw University of Technology, Warszawa (Poland), 1995 (in Polish)
Czajewski, W., Zuraw, J.: Application of the Rough Sets Theory to Optical Character Recognition. Master’s thesis, Warsaw University of Technology, Warszawa (Poland), 1997 (in Polish)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czajewski, W. (1998). Rough Sets in Optical Character Recognition. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_84
Download citation
DOI: https://doi.org/10.1007/3-540-69115-4_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64655-6
Online ISBN: 978-3-540-69115-0
eBook Packages: Springer Book Archive