Skip to main content
SpringerLink
Log in
Book cover

Graph Based Representations in Pattern Recognition pp 53–62Cite as

Efficient Graph Matching for Video Indexing

  • Conference paper

Part of the book series: Computing Supplement ((COMPUTING,volume 12))

Abstract

Traditionally graph algorithms have been of restricted use due to their exponential computational complexity in the general case. Recently a new class of graph algorithms for subgraph isomorphism detection has been proposed, one of these algorithms having quadratic time complexity. These new algorithms use a preprocessing step to allow rapid matching of an input graph against a database of model graphs. We present a new algorithm for largest common subgraph detection that provides a significant performance improvement over previous algorithms. This new algorithm is based on the work on preprocessed subgraph isomorphism detection by Messmer and Bunke [3].

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen, J. F.: Maintaining knowledge about temporal intervals. Comm. ACM 26, 832–843 (1983).

    Article  MATH  Google Scholar 

  2. Bunke, H., Allerman, G.: Inexact graph matching for structural pattern recognition. Pattern Rec. Lett. 1, 245–253 (1983).

    Article  MATH  Google Scholar 

  3. Bunke, H., Messmer, B.: Recent advances in graph matching. International J. Pattern Rec. Art. Intell. 11, 169–203 (1997)

    Article  Google Scholar 

  4. Chang, S., Shi, Q., Yan C.: Iconic indexing by 2D strings. In: Proceedings of the IEEE Workshop on visual languages, Dallas, Texas, USA, June 1986. Also in: IEEE Trans. Pattern Anal. Mach. Intell. 9, 413–428 (1987).

    Google Scholar 

  5. Chang, S. K., Yan, C. W., Dimitroff, D. C., Arndt, T.: An intelligent image database system. IEEE Trans. Software Eng. 14, 681–688 (1988).

    Article  Google Scholar 

  6. Horaud, R., Skordas, T.: Stereo correspondance through feature grouping and maximal cliques. IEEE Trans. Pattern Anal. Mach. Intell. 11, 1168–1180 (1989).

    Article  Google Scholar 

  7. Lee, S., Yang, M., Chen, J.: Signature file as a spatial filter for iconic image database. J. Visual Lang. Comput. 3, 373–397 (1992).

    Article  Google Scholar 

  8. Lee, S. W., Ren, Y., Suen, C. Y.: Hierarchical attributed graph representation and recognition of Chinese characters. Pattern Rec. 24, 617–632 (1991).

    Article  Google Scholar 

  9. Lee, S.-Y., Hsu, F.-J.: Spatial reasoning and similarity retrieval of images using 2D C-string knowledge representation. Pattern Rec. 25, 305–318 (1992).

    Article  Google Scholar 

  10. Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 9, 341–354 (1972).

    Article  MathSciNet  Google Scholar 

  11. Shearer, K. R., Venkatesh, S., Kieronska, D.: Spatial indexing for video databases. J. Visual Comm. Image Repr. 8, 325–335 (1997).

    Article  Google Scholar 

  12. Tamura, H., Yokoya, N.: Image database systems: A survey. Pattern Rec. 17, 29–43 (1984).

    Article  Google Scholar 

  13. Turán, P.: Eine extremalaufgabe aus der graphentheorie. Mat. Fiz. Lapok 48, 436–452 (1941).

    MathSciNet  Google Scholar 

  14. Ullman, J. R.: An algorithm for subgraph isomorphism. J Assoc. Comput. Mach. 23, 31–42 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  15. Wong, E. K.: Model matching in robot vision by subgraph isomorphism. Pattern Rec. 25, 287–304 (1992).

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Curtin University of Technology, Perth, Australia

    K. Shearer, S. Venkatesh & D. Kieronska

  2. Institut für Informatik und Angewandte Mathematik, Universität Bern, Deutschland

    H. Bunke

Authors
  1. K. Shearer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Bunke
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Venkatesh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. D. Kieronska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratoire Reconnaisance de Formes et Vision, INSA, Lyon, France

    Jean-Michel Jolion

  2. Pattern Recognition and Image Processing Group, Institute of Automation, University of Vienna, Austria

    Walter G. Kropatsch

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Wien

About this paper

Cite this paper

Shearer, K., Bunke, H., Venkatesh, S., Kieronska, D. (1998). Efficient Graph Matching for Video Indexing. In: Jolion, JM., Kropatsch, W.G. (eds) Graph Based Representations in Pattern Recognition. Computing Supplement, vol 12. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6487-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6487-7_6

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83121-2

  • Online ISBN: 978-3-7091-6487-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation