2009
DOI: 10.55630/sjc.2009.3.23-46
|View full text |Cite
|
Sign up to set email alerts
|

Hausdorff Distances for Searching in Binary Text Images

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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…Hausdorff Distance (HD) measures as the distance between two compact nonempty subsets of a metric space [30]. In order to find similarity between predicted (Pred) and ground truth (GT) HD measure between two closed and bounded subsets A and B of a given metric space M is defined as.…”
Section: Performance Analysismentioning
confidence: 99%
“…Hausdorff Distance (HD) measures as the distance between two compact nonempty subsets of a metric space [30]. In order to find similarity between predicted (Pred) and ground truth (GT) HD measure between two closed and bounded subsets A and B of a given metric space M is defined as.…”
Section: Performance Analysismentioning
confidence: 99%