Geometrical Graph Matching using Monte Carlo Tree Search

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00235467" target="_blank" >RIV/68407700:21230/15:00235467 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/ICIP.2015.7351383" target="_blank" >http://dx.doi.org/10.1109/ICIP.2015.7351383</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/ICIP.2015.7351383" target="_blank" >10.1109/ICIP.2015.7351383</a>

Result language
angličtina
Original language name
Geometrical Graph Matching using Monte Carlo Tree Search
Original language description
Many medical images contain graph-like geometrical structures such as blood vessels and neuronal networks. We present an algorithm for matching geometrical graphs, in order to quickly and robustly align such images. We use a sampling-based curve descriptor to prune dissimilar edges. The matching is modeled as a single-player game, growing the matching from a random initial correspondence. The coarse global solution is found using a Monte Carlo Tree Search and then refined locally. We show experimentallythat our approach finds the correct matching in all tested datasets and is the fastest of all global methods.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA14-21421S" target="_blank" >GA14-21421S: Automatic analysis of spatial gene expression patterns</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach

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

Article name in the collection
Proceedings of the IEEE International Conference in Image Processing (ICIP)
ISBN
978-1-4799-8339-1
ISSN
1522-4880
e-ISSN
—
Number of pages
5
Pages from-to
3145-3149
Publisher name
IEEE Computer Society Press
Place of publication
Los Alamitos
Event location
Quebec
Event date
Sep 27, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)