Open Access
Poorly Structured Handwritten Documents Segmentation using Continuous Probabilistic Feature Grammars
Thierry Artières
- 01 Jan 2003
11
TL;DR: This work proposes to use a formalism, based on Probabilistic Feature Grammars that exhibit some interesting features that allows handling ambiguities and to taking into account contextual information such as spatial relations between objects in the page.
read more
Abstract: This work deals with poorly structured handwritten documents segmentation such as pages of handwritten notes produced with pen-based interfaces. We propose to use a formalism, based on Probabilistic Feature Grammars, that exhibit some interesting features. It allows handling ambiguities and to taking into account contextual information such as spatial relations between objects in the page.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Document Structure and Layout Analysis
Anoop M. Namboodiri,Anil K. Jain +1 more
- 01 Jan 2007
TL;DR: Automatic analysis of an arbitrary document with complex layout is an extremely difficult task and is beyond the capabilities of the state-of-the-art document structure and layout analysis systems.
Patent
Parsing hierarchical lists and outlines
Ming Ye,Paul A. Viola +1 more
- 18 Oct 2005
TL;DR: This paper used the Collins model for parsing non-textual information into hierarchical content, and assigned labels to lines that indicate how the lines relate to one another in a hierarchical content representation.
24
Recognition of Malayalam Documents
N.V. Neeba,Anoop M. Namboodiri,C. V. Jawahar,P. J. Narayanan +3 more
- 01 Jan 2009
TL;DR: This chapter presents the approach for recognition of Malayalam documents, both printed and handwritten, and classification results as well as ongoing activities are presented.
19
On-line handwritten documents segmentation
Julien Blanchard,Thierry Artières +1 more
- 26 Oct 2004
TL;DR: Improvements concern the handling of this complexity using genetic algorithms, the definition of performance measurements that are adapted to the segmentation of on-line documents, and the evaluation of this segmentation approach on a collection of documents of various qualities.
•Proceedings Article
Robust Segmentation of Unconstrained Online Handwritten Documents.
Anoop M. Namboodiri,Anil K. Jain +1 more
- 01 Jan 2004
TL;DR: A robust segmentation method to detect the regions in an unstructured on-line handwritten document and compute the most likely segmentation of the handwritten page using a Stochastic Context Free Grammar based parser.
References
The document spectrum for page layout analysis
TL;DR: The document spectrum (or docstrum) as discussed by the authors is a method for structural page layout analysis based on bottom-up, nearest-neighbor clustering of page components, which yields an accurate measure of skew, within-line, and between-line spacings and locates text lines and text blocks.
756
•Book
The document spectrum for page layout analysis
Lawrence O'Gorman
- 01 Jan 1995
TL;DR: The document spectrum (or docstrum), which is a method for structural page layout analysis based on bottom-up, nearest-neighbor clustering of page components, yields an accurate measure of skew, within-line, and between-line spacings and locates text lines and text blocks.
628
•Posted Content
An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities
TL;DR: In this paper, an extension of Earley's parser for stochastic context-free grammars is presented, which computes probabilities of successive prefixes being generated by the grammar, probabilities of substrings being produced by the nonterminals, including the entire string, most likely (Viterbi) parse of the string, posterior expected number of applications of each grammar production, as required for reestimating rule probabilities.
376
Hierarchical representation of optically scanned documents
George Nagy,Sharad C. Seth +1 more
- 01 Jan 1984
Stochastic attribute-value grammars
TL;DR: In this article, the authors define stochastic attribute-value grammars and give an algorithm for computing the maximum-likelihood estimate of their parameters, which is adapted from Della Pietra and Lafferty (1995).