login

Image Document Categorization using Hidden Tree Markov Models and Structured Representations

Lecture notes in computer sciencePublished 1 January 2001
Michelangelo Diligenti, Paolo Frasconi, Marco Gori
Citations12
SJR quartileQ2
SJR score0.35
SNIP0.55

TL;DR

This paper transforms the image document into a structured representation based on X-Y trees and introduces a novel probabilistic architecture that extends hidden Markov models for learning probability distributions defined on spaces of labeled trees.

Abstract

Categorization is an important problem in image document processing and is often a preliminary step for solving subsequent tasks such as recognition, understanding, and information extraction. In this paper the problem is formulated in the framework of concept learning and each category corresponds to the set of image documents with similar physical structure. We propose a solution based on two algorithmic ideas. First, we transform the image document into a structured representation based on X-Y trees. Compared to "flat" or vector-based feature extraction techniques, structured representations allow us to preserve important relationships between image sub-constituents. Second, we introduce a novel probabilistic architecture that extends hidden Markov models for learning probability distributions defined on spaces of labeled trees.

Keywords

Computer Science