๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Performance Evaluation of Document Structure Extraction Algorithms

โœ Scribed by Jisheng Liang; Ihsin T Phillips; Robert M Haralick


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
114 KB
Volume
84
Category
Article
ISSN
1077-3142

No coin nor oath required. For personal study only.

โœฆ Synopsis


This paper presents a performance metric for the document structure extraction algorithms by finding the correspondences between detected entities and ground truth. We describe a method for determining an algorithm's optimal tuning parameters. We evaluate a group of document layout analysis algorithms on 1600 images from the UW-III Document Image Database, and the quantitative performance measures in terms of the rates of correct, miss, false, merging, splitting, and spurious detections are reported.


๐Ÿ“œ SIMILAR VOLUMES


Automated performance evaluation of docu
โœ Junichi Kanai ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 726 KB

The performance of document image analysis systems is affected by a variety of variables that alter the quality of documents. Objective evaluation and characterization of systems usually require large quantities of test data, and it is important to automate evaluation processes. In this article, iss

Automatic extraction of document keyphra
โœ Steve Jones; Gordon W. Paynter ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 602 KB

## Abstract This article describes an evaluation of the Kea automatic keyphrase extraction algorithm. Document keyphrases are conventionally used as concise descriptors of document content, and are increasingly used in novel ways, including document clustering, searching and browsing interfaces, an

Performance evaluation of routing algori
โœ Shin-Jer Yang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 370 KB ๐Ÿ‘ 2 views

## Performance evaluation of routing algorithms under various network configuration parameters Routing is a relevant issue for maintaining good performance and successfully operating in a network. Many types of routing algorithms have been proposed, such as shortest-path, centralized, distributed

Performance evaluation of Two-level Sche
โœ Yukio Ohishi; Keizo Saisho; Akira Fukuda ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 210 KB

In this article, we simulate and evaluate various Twolevel Scheduling algorithms for cluster-based NUMA (Non-Uniform Memory Access) multiprocessors. Twolevel Scheduling is a kind of space partitioning scheduling. We evaluate the following variations: (1) Cluster-free Algorithm and (2) Cluster-limite