Automatic recognition of on-line mathematical expressions is di$cult especially when there exist errors. In this paper, we incorporate an error detection and correction mechanism into a parser developed previously by us based on de"nite clause grammar (DCG). The resulting system can handle lexical,
Optimal matching problem in detection and recognition performance evaluation
β Scribed by Gang Liu; Robert M. Haralick
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 353 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper proposes a principle of one-to-one correspondence in performance evaluation of a general class of detection and recognition algorithms. Such a correspondence between ground-truth entities and algorithm declared entities is essential in accurately computing objective performance measures such as the detection, recognition, and false alarm rates. We mathematically deΓΏne the correspondence by formulating a combinatorial optimal matching problem. In addition to evaluating detection performance, this methodology is also capable of evaluating recognition performance. Our study shows that the proposed principle for detection performance evaluation is simple, general and mathematically sound. The derived performance evaluation technique is widely applicable, precise, consistent and e cient.
π SIMILAR VOLUMES
## Abstract For Abstract see ChemInform Abstract in Full Text.