Entropic Manifold Alignment
Professor Edwin Hancock (Department of Computer Science, The University of York, UK)
NICTA SEMINARDATE: 2011-04-05
TIME: 11:00:00 - 12:00:00
LOCATION: NICTA - 7 London Circuit
CONTACT: JavaScript must be enabled to display this email address.
ABSTRACT:
This talk describes work aimed at formulating the graph matching problem as one of manifold alignment. The low dimensional manifolds are from the commute time embedding and are matched though coherent point drift. Although there have been a number of attempts to realise graph matching in this way, in this paper we propose a novel information theoretic measure of alignment, the so-called symmetrised normalised-entropy-square variation. We successfully test this dissimilarity measure between manifolds on a challenging database. The measure is estimated by means of the bypass Leonenko entropy functional.
In addition we prove that the proposed measure induces a positive
definite kernel between the probability density functions associated
with the manifolds and hence between graphs after deformation. In our
experiments we find that the optimal embedding is associated to the
commute time distance and we also find that our approach, which is
purely topological, outperforms several state-of-the-art graph-based
algorithms for point matching.
BIO:
Web: http://www-users.cs.york.ac.uk/~erh/
