Date:    February 16, 2009

Name:   Yosi Keller, Bar-Ilan University

Title:     New results on Spectral graph matching

Abstract:          

In this talk we extend our previous results on spectral graph matching. First, we present a general framework for high-order matching and show its effectiveness. Second, we show how to introduce sparsity into the computation. Last we present a probabilistic interpretation of spectral matching and derive two alternative graph matching schemes.

We motivate our work by practical examples from image analysis, discrete optimization and channel coding.