A graph lattice approach to maintaining dense collections of subgraphs as image features
Document classification and indexing methods depend on having informative image features. This paper shows how large families of complex features can be built out of simpler ones through construction of a graph lattice - a hierarchy of related subgraphs linked in a lattice. A graph lattice enables efficiency gains that make it possible to effectively employ bag-of-words methods for document classification using high-dimensional feature vectors. Each feature is itself a subgraph, and a feature vector is a count of occurrences of subgraphs in the image. The graph lattice enables methods for adaptively growing a feature space of subgraphs tailored to observed document genres. We demonstrate the approach through classification of forms containing rectilinear line art.
- download PDF (225K)
Saund, E. A graph lattice approach to maintaining dense collections of subgraphs as image features. 11th International Conference on Document Analysis and Recognition (ICDAR); 2011 September 18-21; Beijing, China.
Copyright © IEEE, 2011. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.