Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

A. Peter Johnson

dblp:20/4505 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1997
0009-0004-6773-1817ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › document processing › document analysis
document layout analysis
0.011997
A Fast Algorithm for Bottom-Up Document Layout Analysis · IEEE Trans. Pattern Anal. Mach. Intell. 1997

Methods — techniques the papers use, named apart from their topics

path compression · 0.0kruskal's algorithm · 0.0
YearPublicationVenuePosition
1997 A Fast Algorithm for Bottom-Up Document Layout Analysis
abstract
This paper describes a new bottom-up method for document layout analysis. The algorithm was implemented in the CLIDE (Chemical Literature Data Extraction) system, but the method described here is suitable for a broader range of documents. It is based on Kruskal's algorithm and uses a special distance-metric between the components to construct the physical page structure. The method has all the major advantages of bottom-up systems: independence from different text spacing and independence from different block alignments. The algorithms computational complexity is reduced to linear by using heuristics and path-compression.
Anikó Simon, Jean-Christophe Pret, A. Peter Johnson
IEEE Trans. Pattern Anal. Mach. Intell.3
1995 (Chem)DeTE/X automatic generation of a markup language description of (chemical) documents from bitmap images
abstract
This paper presents a novel view of document processing, as being the reverse process to T/sub E/X. This concept simplifies the analysis of the physical structure of documents, and also suggests the use of a style file for layout recognition. An algorithm is given for both phases, layout analysis and layout recognition. The bottom-up layout analysis method employed is based on the Kruskal's algorithm and uses the distances between the components to construct the physical page structure. The algorithm is linear with respect to the number of the connected components. For layout recognition, a document style description language (DSDL) is introduced. This helps a fault-tolerant, recursive parsing algorithm to label the blocks of the document. The presented methods were designed to be used for scientific publications (papers, reports, books), but could be applied to a broader range of documents.
Anikó Simon, Jean-Christophe Pret, A. Peter Johnson
ICDAR3