✦ LIBER ✦

A RKHS interpolator-based graph matching algorithm

✍ Scribed by van Wyk, M.A.; Durrani, T.S.; van Wyk, B.J.

Book ID: 117930948
Publisher: IEEE
Year: 2002
Tongue: English
Weight: 696 KB
Volume: 24
Category: Article
ISSN: 0162-8828
DOI: 10.1109/tpami.2002.1017624

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A POCS-based graph matching algorithm

✍ van Wyk, B.J.; van Wyk, M.A. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 285 KB

A graph matching method and a graph matc

A graph matching method and a graph matching distance based on subgraph assignments

✍ Romain Raveaux; Jean-Christophe Burie; Jean-Marc Ogier 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 1003 KB

A (sub)graph isomorphism algorithm for m

A (sub)graph isomorphism algorithm for matching large graphs

✍ Cordella, L.P.; Foggia, P.; Sansone, C.; Vento, M. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 549 KB

A matching algorithm for regular biparti

A matching algorithm for regular bipartite graphs

✍ J. Csima; L. Lovász 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 693 KB

Multi-target track-correlation algorithm

Multi-target track-correlation algorithm of the graph-matching-based sensor network

✍ Yingchun Shen; Hanbao Wu; Hai Jin 📂 Article 📅 2010 🏛 Wuhan University 🌐 English ⚖ 393 KB

Convergence of a hill-climbing genetic a

Convergence of a hill-climbing genetic algorithm for graph matching

✍ Andrew D.J. Cross; Richard Myers; Edwin R. Hancock 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 793 KB

This paper presents a convergence analysis for the problem of consistent labelling using genetic search. The work builds on a recent empirical study of graph matching where we showed that a Bayesian consistency measure could be e$ciently optimised using a hybrid genetic search procedure which incorp