IMI-BAS
 

BulDML at Institute of Mathematics and Informatics >
IMI >
IMI Periodicals >
Serdica Journal of Computing >
2009 >
Volume 3 Number 1 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/363

Title: Hausdorff Distances for Searching in Binary Text Images
Authors: Andreev, Andrey
Kirov, Nikolay
Keywords: Hausdorff Distance
Binary Text Image
Word Matching
Issue Date: 2009
Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Citation: Serdica Journal of Computing, Vol. 3, No 1, (2009), 23p-46p
Abstract: Hausdorff distance (HD) seems the most efficient instrument for measuring how far two compact non-empty subsets of a metric space are from each other. This paper considers the possibilities provided by HD and some of its modifications used recently by many authors for resemblance between binary text images. Summarizing part of the existing word image matching methods, relied on HD, we investigate a new similar parameterized method which contains almost all of them as particular cases. Numerical experiments for searching words in binary text images are carried out with 333 pages of old Bulgarian typewritten text, 200 printed pages of Bulgarian Chrestomathy from year 1884, and 200 handwritten pages of Slavonic manuscript from year 1574. They outline how the parameters must be set in order to use the advantages of the proposed method for the purposes of word matching in scanned document images.
Description: This work has been partially supported by Grant No. DO 02-275, 16.12.2008, Bulgarian NSF, Ministry of Education and Science.
URI: http://hdl.handle.net/10525/363
ISSN: 1312-6555
Appears in Collections:Volume 3 Number 1

Files in This Item:

File Description SizeFormat
sjc077-vol3-num1-2009.pdf2.46 MBAdobe PDFView/Open

 



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2009  The DSpace Foundation - Feedback