en-de
en-es
en-fr
en-pt
en-sl
en
en-zh
0.25
0.5
0.75
1.25
1.5
1.75
2
Bipartite Graph Matching for Computing the Edit Distance of Graphs
Published on Jul 03, 200715495 Views
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to describe relational
Related categories
Chapter list
Bipartite Graph Matching for Compting the Edit Distance of Graphs00:00
Outline pt 100:23
Outline pt 201:03
Graph Based Representation01:21
Graph Edit Distance pt 102:13
Graph Edit Distance pt 202:53
Graph Edit Distance pt 302:55
Graph Edit Distance pt 402:57
Graph Edit Distance pt 502:58
Graph Edit Distance pt 602:59
Graph Edit Distance pt 703:29
Graph Edit Distance pt 804:20
Edit Distance Based Classification04:31
Complexity of Graph Edit Distance05:56
Suboptimal Methods pt 107:13
Suboptimal Methods pt 207:40
The Assignment Problem pt 107:50
The Assignment Problem pt 208:18
Munkres’ Algorithm09:13
Example10:03
Bipartite Matching for GED10:47
Plain Algorithm11:19
Adjacency Algorithm12:40
Fast but Suboptimal pt 114:30
Fast but Suboptimal pt 214:40
Experimental Setup14:58
Letter Dataset16:13
Suboptimality17:45
Image Dataset19:36
Fingerprint Dataset20:25
Outlook21:49
Conclusions23:28