Graph Matching Algorithms
published: Feb. 25, 2007, recorded: February 2005, views: 4558
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Graph matching plays a key role in many areas of computing from computer vision to networks where there is a need to determine correspondences between the components (vertices and edges) of two attributed structures. In recent years three new approaches to graph matching have emerged as replacements to more traditional heuristic methods. These new methods are: * Least squares - where the optimal correspondence in determined in terms of deriving the best fitting permutation matrix between sets. * Spectral methods - where optimal correspondences are derived via subspace projections in the graph eigenspaces. * Graphical models - where algorithms such as the junction tree algorithm are used to infer the optimal labeling of the nodes of one graph in terms of the other and that satisfy similarity constraints between vertices and edges. In this lecture we review and compare these methods and demonstrate examples where this applies to point set and line matching.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !