Graph Matching Algorithms

author: Terry Caelli, NICTA, Australia's ICT Research Centre of Excellence
published: Feb. 25, 2007,   recorded: February 2005,   views: 4558
Categories

See Also:

Download slides icon Download slides: mlss05au_caelli_gma_01.pdf (780.4 KB)


Help icon Streaming Video Help

Related content

Report a problem or upload files

If 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.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

 Watch videos:   (click on thumbnail to launch)

Watch Part 1
Part 1 55:04
!NOW PLAYING
Watch Part 2
Part 2 27:27
!NOW PLAYING
Watch Part 3
Part 3 1:01:12
!NOW PLAYING
Watch Part 4
Part 4 08:43
!NOW PLAYING

Description

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 page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 visitar, October 5, 2007 at 4:10 p.m.:

How can I watch these videos under linux OS?Seems there isn't a WM plugin for it:-)


Comment2 Ahsh, December 9, 2007 at 5:46 a.m.:

How can I download the lectures and see after?
I have a problem with internet speed, so it is horrible to watch it on line.
Thanks,
Ahsh


Comment3 macias, February 16, 2008 at 11:15 p.m.:

Use mplayer to dump mms stream.

#!/bin/sh

if [ "$2" == "" ]
then
echo Error: missing filename.
exit 1
fi

if [ -e "$2" ]
then
kdialog --title "File already exists" --warningyesno "Overwrite?"
if [ $? -eq 1 ]
then
exit 1
fi
fi


Comment4 acc, June 28, 2008 at 9:35 a.m.:

how i can download this videos, the internet is not quickly ?¿? please


Comment5 huyen, November 1, 2008 at 2:29 a.m.:

How can I download these video lectures?


Comment6 eltonzhang, June 17, 2010 at 5:53 a.m.:

If I open a video in a new page, I can see and hear. But if I click and change to another video in the page, I can't see, but can hear. It is strange.

Write your own review or comment:

make sure you have javascript enabled or clear this field: