Applied Graph Theory in Computer Vision and Pattern Recognition

Abraham Kandel (Curatore)

Horst Bunke (Curatore)

Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 2010

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.

• Curatore: Abraham Kandel, Horst Bunke
• Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
• Collana: Studies in Computational Intelligence
• Anno: 2010
• Rilegatura: Paperback / softback
• Pagine: 266 p.
• Dimensioni: 235 x 155 mm
• EAN: 9783642087646

Testo in English