Using tree-grammars for training set expansion in page classification

Authors:
Stefano Baldi;Simone Marinai;Giovanni Soda
Affiliations:
-;-;-
Venue:
ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 2
Year:
2003

Citing 5
Cited 2

Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
Training Set Expansion in Handwritten Character Recognition

Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Retrieval by Layout Similarity of Documents Represented with MXY Trees

DAS '02 Proceedings of the 5th International Workshop on Document Analysis Systems V
Structured Document Segmentation and Representation by the Modified X-Y tree

ICDAR '99 Proceedings of the Fifth International Conference on Document Analysis and Recognition
Encoding of Modified X-Y Trees for Document Classification

ICDAR '01 Proceedings of the Sixth International Conference on Document Analysis and Recognition

Layout based document image retrieval by means of XY tree reduction

ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
Recent advances in graph-based pattern recognition with applications in document analysis

Pattern Recognition

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we describe a method for the expansionof training sets made by XY trees representing page layout.This approach is appropriate when dealing with page classificationbased on MXY tree page representations. The basicidea is the use of tree grammars to model the variationsin the tree which are caused by segmentation algorithms.A set of general grammatical rules are defined and used toexpand the training set. Pages are classified with a k - nnapproach where the distance between pages is computed bymeans of tree-edit distance.