814 search results - page 2 / 163 » Graphical Models for Graph Matching |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
JMLR
2010
13 years 3 days ago
2010
This paper studies the feasibility and interpretation of learning the causal structure from observational data with the principles behind the Kolmogorov Minimal Sufficient Statist...
GD
2008
Springer
13 years 6 months ago
2008
Springer
ICPR
2006
IEEE
14 years 6 months ago
2006
IEEE
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
BMVC
2001
13 years 7 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...