Geometric Graph Matching Using Monte Carlo Tree Search

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00307386" target="_blank" >RIV/68407700:21230/17:00307386 - isvavai.cz</a>

Výsledek na webu

<a href="http://cmp.felk.cvut.cz/pub/cmp/articles/kybic/Pinheiro-PAMI2016-compressed.pdf" target="_blank" >http://cmp.felk.cvut.cz/pub/cmp/articles/kybic/Pinheiro-PAMI2016-compressed.pdf</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/TPAMI.2016.2636200" target="_blank" >10.1109/TPAMI.2016.2636200</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Geometric Graph Matching Using Monte Carlo Tree Search

Popis výsledku v původním jazyce

We present an efficient matching method for generalized geometric graphs. Such graphs consist of vertices in space connected by curves and can represent many real world structures such as road networks in remote sensing, or vessel networks in medical imaging. Graph matching can be used for very fast and possibly multimodal registration of images of these structures. We formulate the matching problem as a single player game solved using Monte Carlo Tree Search, which automatically balances exploring new possible matches and extending existing matches. Our method can handle partial matches, topological differences, geometrical distortion, does not use appearance information and does not require an initial alignment. Moreover, our method is very efficient — it can match graphs with thousands of nodes, which is an order of magnitude better than the best competing method, and the matching only takes a few seconds.

Název v anglickém jazyce

Geometric Graph Matching Using Monte Carlo Tree Search

Popis výsledku anglicky

We present an efficient matching method for generalized geometric graphs. Such graphs consist of vertices in space connected by curves and can represent many real world structures such as road networks in remote sensing, or vessel networks in medical imaging. Graph matching can be used for very fast and possibly multimodal registration of images of these structures. We formulate the matching problem as a single player game solved using Monte Carlo Tree Search, which automatically balances exploring new possible matches and extending existing matches. Our method can handle partial matches, topological differences, geometrical distortion, does not use appearance information and does not require an initial alignment. Moreover, our method is very efficient — it can match graphs with thousands of nodes, which is an order of magnitude better than the best competing method, and the matching only takes a few seconds.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA14-21421S" target="_blank" >GA14-21421S: Automatická analýza prostorových vzorů genové exprese</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IEEE Transactions on Pattern Analysis and Machine Intelligence

ISSN

0162-8828

e-ISSN

1939-3539

Svazek periodika

39

Číslo periodika v rámci svazku

11

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

15

Strana od-do

2171-2185

Kód UT WoS článku

000412028600005

EID výsledku v databázi Scopus

2-s2.0-85032271158