Logo

Hausdorff distances for searching in binary text images

Andreev, Andrey and Kirov, Nikolay (2009) Hausdorff distances for searching in binary text images. Serdica : Journal of Computing, 3 (1). pp. 23-46. ISSN 1312-6555

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
2MB

Official URL: http://www.math.bas.bg/serdicajcomputing/

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.

Item Type:Article
Subjects:Mathematics
Computer science and information technologies > Applied informatics
ID Code:310
Deposited By: Доц. Николай Киров
Deposited On:06 Oct 2009 07:16
Last Modified:14 Oct 2010 06:55

Repository Staff Only: item control page