Text-Line Extraction as Selection of Paths in the Neighbor Graph

  • Authors:
  • Koichi Kise;Motoi Iwata;Andreas Dengel;Keinosuke Matsumoto

  • Affiliations:
  • -;-;-;-

  • Venue:
  • DAS '98 Selected Papers from the Third IAPR Workshop on Document Analysis Systems: Theory and Practice
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new method of text-line extraction which can be applied to tilted non-rectangular pages. The method is characterized as follows. As the representation of physical structure of a page, we propose the neighbor graph which represents neighbors of connected components. The use of the area Voronoi diagram enables us to extract neighbors without predetermined parameters. Based on the neighbor graph, the task of text-line extraction is considered to be the selection of its paths appropriate as text-lines. We apply simple iterative selection of edges with local examination so as to reduce the computational cost. From experimental results for 50 pages with rectangular and non-rectangular layout, we discuss advantages and limitations of our method.