Robust elastic 2D/3D geometric graph matching

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00200720" target="_blank" >RIV/68407700:21230/12:00200720 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1117/12.910573" target="_blank" >http://dx.doi.org/10.1117/12.910573</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1117/12.910573" target="_blank" >10.1117/12.910573</a>

Result language
angličtina
Original language name
Robust elastic 2D/3D geometric graph matching
Original language description
We present an algorithm for geometric matching of graphs embedded in 2D or 3D space. It is applicable for registering any graph-like structures appearing in biomedical images, such as blood vessels, pulmonary bronchi, nerve fibers, or dendritic arbors. Our approach does not rely on the similarity of local appearance features, so it is suitable for multimodal registration with a large difference in appearance. Unlike earlier methods, the algorithm uses edge shape, does not require an initial pose estimate, can handle partial matches, and can cope with nonlinear deformations and topological differences
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP202%2F11%2F0111" target="_blank" >GAP202/11/0111: Automatic analysis of light and electron microscopy neuronal data</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)