Geometric Graph Matching Using Monte Carlo Tree Search

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.

Published in:
Transactions on Pattern Analysis and Machine Intelligence (PAMI), 39, 11, 2171-2185
Los Alamitos, Ieee Computer Soc

 Record created 2017-11-08, last modified 2018-12-03

Rate this document:

Rate this document:
(Not yet reviewed)