Geometric Graph Matching Using Monte Carlo Tree Search
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Geometric Graph Matching Using Monte Carlo Tree Search
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA14-21421S" target="_blank" >GA14-21421S: Automatic analysis of spatial gene expression patterns</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Transactions on Pattern Analysis and Machine Intelligence
ISSN
0162-8828
e-ISSN
1939-3539
Volume of the periodical
39
Issue of the periodical within the volume
11
Country of publishing house
US - UNITED STATES
Number of pages
15
Pages from-to
2171-2185
UT code for WoS article
000412028600005
EID of the result in the Scopus database
2-s2.0-85032271158