Skip to main content
SpringerLink
Log in

Applied Graph Theory in Computer Vision and Pattern Recognition

  • Book
  • © 2007

Overview

Editors:
  1. Abraham Kandel

    1. Computer Science & Engineering Department, University of South Florida, Tampa, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Horst Bunke

    1. Institute of Computer Science and Applied Mathematics (IAM), Bern, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Mark Last

    1. Department of Information Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Will serve as a foundation for a variety of useful applications of the graph theory to computer vision, pattern recognition, and related areas
  • Covers a representative set of novel graph-theoretic methods for complex computer vision and pattern recognition tasks
  • Includes supplementary material: sn.pub/extras

Part of the book series: Studies in Computational Intelligence (SCI, volume 52)

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

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Applied Graph Theory for Low Level Image Processing and Segmentation

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Multiresolution Image Segmentations in Graph Pyramids

      • Walter G. Kropatsch, Yll Haxhimusa, Adrian Ion
      Pages 3-41

    3. A Graphical Model Framework for Image Segmentation

      • Rui Huang, Vladimir Pavlovic, Dimitris N. Metaxas
      Pages 43-63

    4. Digital Topologies on Graphs

      • Alain Bretto
      Pages 65-82

  3. Graph Similarity, Matching, and Learning for High Level Computer Vision and Pattern Recognition

    1. Front Matter

      Pages 84-84
      Download chapter PDF

    2. How and Why Pattern Recognition and Computer Vision Applications Use Graphs

      • Donatello Conte, Pasquale Foggia, Carlo Sansone, Mario Vento
      Pages 85-135

    3. Efficient Algorithms on Trees and Graphs with Unique Node Labels

      • Gabriel Valiente
      Pages 137-149

    4. A Generic Graph Distance Measure Based on Multivalent Matchings

      • Sébastien Sorlin, Christine Solnon, Jean-Michel Jolion
      Pages 151-181

    5. Learning from Supervised Graphs

      • Joseph Potts, Diane J. Cook, Lawrence B. Holder
      Pages 183-201

  4. Special Applications

    1. Front Matter

      Pages 204-204
      Download chapter PDF

    2. Graph-Based and Structural Methods for Fingerprint Classification

      • Gian Luca Marcialis, Fabio Roli, Alessandra Serrau
      Pages 205-226

    3. Graph Sequence Visualisation and its Application to Computer Network Monitoring and Abnormal Event Detection

      • Horst Bunke, P. Dickinson, A. Humm, Ch. Irniger, M. Kraetzl
      Pages 227-245

    4. Clustering of Web Documents Using Graph Representations

      • Adam Schenker, Horst Bunke, Mark Last, Abraham Kandel
      Pages 247-265
Back to top

Keywords

About this book

Graph theory has strong historical roots in mathematics, especially in topology. Its birth is usually associated with the “four-color problem” posed by Francis Guthrie 1 in 1852, but its real origin probably goes back to the Seven Bridges of Konigsber ¨ g 2 problem proved by Leonhard Euler in 1736. A computational solution to these two completely different problems could be found after each problem was abstracted to the level of a graph model while ignoring such irrelevant details as country shapes or cross-river distances. In general, a graph is a nonempty set of points (vertices) and the most basic information preserved by any graph structure refers to adjacency relationships (edges) between some pairs of points. In the simplest graphs, edges do not have to hold any attributes, except their endpoints, but in more sophisticated graph structures, edges can be associated with a direction or assigned a label. Graph vertices can be labeled as well. A graph can be represented graphically as a drawing (vertex=dot,edge=arc),but,aslongaseverypairofadjacentpointsstaysconnected by the same edge, the graph vertices can be moved around on a drawing without changing the underlying graph structure. The expressive power of the graph models placing a special emphasis on c- nectivity between objects has made them the models of choice in chemistry, physics, biology, and other ?elds.

Editors and Affiliations

  • Computer Science & Engineering Department, University of South Florida, Tampa, USA

    Abraham Kandel

  • Institute of Computer Science and Applied Mathematics (IAM), Bern, Switzerland

    Horst Bunke

  • Department of Information Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva, Israel

    Mark Last

Bibliographic Information

  • Book Title: Applied Graph Theory in Computer Vision and Pattern Recognition

  • Editors: Abraham Kandel, Horst Bunke, Mark Last

  • Series Title: Studies in Computational Intelligence

  • DOI: https://doi.org/10.1007/978-3-540-68020-8

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Engineering, Engineering (R0)

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2007

  • Hardcover ISBN: 978-3-540-68019-2Published: 12 March 2007

  • Softcover ISBN: 978-3-642-08764-6Published: 13 November 2010

  • eBook ISBN: 978-3-540-68020-8Published: 11 April 2007

  • Series ISSN: 1860-949X

  • Series E-ISSN: 1860-9503

  • Edition Number: 1

  • Number of Pages: X, 266

  • Topics: Mathematical and Computational Engineering, Artificial Intelligence

Publish with us

Policies and ethics

Back to top

Search

Navigation