Skip to main content

Document Table Recognition by Graph Rewriting

  • Conference paper
  • First Online:
Applications of Graph Transformations with Industrial Relevance (AGTIVE 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1779))

  • 599 Accesses

Abstract

This paper proposes a bottom-up approach for identifying and recognizing tables within a document. This approach is based on the paradigm of graph rewriting. First, the document image is transformed into a layout graph whose nodes and edges respectively represent document entities and their interrelations. This graph is subsequently rewritten using a set of rules designed for and based on apriori document knowledge and general formatting conventions. The resulting graph provides both logical and layout views of the document content.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

5 References

  1. H. Fahmy and D. Blostein, “A Graph Grammar Programming Style for Recognition of Music Notation,” Machine Vision and Applications, Vol. 6, 1993.

    Google Scholar 

  2. K. S. Fu (ed.), “Syntactic Pattern Recognition Application,” Springer-Verlag, Berlin, 1977.

    Google Scholar 

  3. H. Bunke, “Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation,” IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. 4, No. 6, Nov. 1982.

    Google Scholar 

  4. E. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld (eds.), “Graph Grammars and Their Application to Computer Science,” Springer-Verlag, Berlin, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rahgozar, M.A. (2000). Document Table Recognition by Graph Rewriting. In: Nagl, M., Schürr, A., Münch, M. (eds) Applications of Graph Transformations with Industrial Relevance. AGTIVE 1999. Lecture Notes in Computer Science, vol 1779. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45104-8_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45104-8_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67658-4

  • Online ISBN: 978-3-540-45104-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics