Theoretical and algorithmic framework for hypergraph matching

  • Authors:
  • Horst Bunke;Peter Dickinson;Miro Kraetzl

  • Affiliations:
  • Institut für Informatik und angewandte Mathematik, Universität Bern, Bern, Switzerland;Intelligence Surveillance Reconnaissance Division, Defence Science and, Technology Organisation, Edinburgh, SA, Australia;Intelligence Surveillance Reconnaissance Division, Defence Science and, Technology Organisation, Edinburgh, SA, Australia

  • Venue:
  • ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Graphs have been successfully used in many disciplines of science and engineering. In the field of pattern recognition and image analysis, graph matching has proven to be a powerful tool. In this paper we generalize various matching tasks from graphs to the case of hypergraphs. We also discuss related algorithms for hypergraph matching.