English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/96678
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Robust non-rigid registration of 2D and 3D graphs

AuthorsSerradell, Eduard ; Glowacki, Przemyslaw; Kybic, Jan; Moreno-Noguer, Francesc ; Fua, Pascal
Issue Date2012
PublisherInstitute of Electrical and Electronics Engineers
CitationIEEE Conference on Computer Vision and Pattern Recognition: 996-1003 (2012)
AbstractWe present a new approach to matching graphs embedded in R2 or R3. Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not require an initial alignment, can handle partial matches, and can cope with non-linear deformations and topological differences. To handle arbitrary non-linear deformations, we represent them as Gaussian Processes. In the absence of appearance information, we iteratively establish correspondences between graph nodes, update the structure accordingly, and use the current mapping estimate to find the most likely correspondences that will be used in the next iteration. This makes the computation tractable. We demonstrate the effectiveness of our approach first on synthetic cases and then on angiography data, retinal fundus images, and microscopy image stacks acquired at very different resolutions.
DescriptionTrabajo presentado al CVPR celebrado en Providence (USA) del 16 al 21 de junio de 2012.
Publisher version (URL)http://dx.doi.org/10.1109/CVPR.2012.6247776
Identifiersdoi: 10.1109/CVPR.2012.6247776
isbn: 978-1-4673-1226-4
Appears in Collections:(IRII) Libros y partes de libros
Files in This Item:
File Description SizeFormat 
Robust non-rigid registration .pdf9,05 MBUnknownView/Open
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.