Show simple item record

dc.contributor.authorSerradell, Eduard
dc.contributor.authorAmável Pinheiro, Miguel
dc.contributor.authorSznitman, Raphael
dc.contributor.authorKybic, Jan
dc.contributor.authorMoreno-Noguer, Francesc
dc.contributor.authorFua, Pascal
dc.date.accessioned2014-12-05T14:45:15Z
dc.date.available2014-12-05T14:45:15Z
dc.date.issued2014
dc.identifier.citationSERRADELL, E. - AMÁVEL PINHEIRO, M. – SZNITMAN, R. – KYBIC, J. - MORENO-NOGUER, F. – FUA, P.: Non-Rigid Graph Registration using Active Testing Search. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2014, vol., no. (Accepted) ISSN 0162-8828. DOI: 10.1109/TPAMI.2014.2343235eng
dc.identifier.issn0162-8828
dc.identifier.urihttp://hdl.handle.net/10467/60945
dc.description.abstractWe present a new approach for matching sets of branching curvilinear structures that form graphs embedded in R2 or R3 and may be subject to deformations. Unlike earlier methods, ours does not rely on local appearance similarity nor does require a good initial alignment. Furthermore, it can cope with non-linear deformations, topological differences, and partial graphs. To handle arbitrary non-linear deformations, we use Gaussian Process Regressions to represent the geometrical mapping relating the two graphs. In the absence of appearance information, we iteratively establish correspondences between points, update the mapping accordingly, and use it to estimate where to find the most likely correspondences that will be used in the next step. To make the computation tractable for large graphs, the set of new potential matches considered at each iteration is not selected at random as with many RANSAC-based algorithms. Instead, we introduce a so-called Active Testing Search strategy that performs a priority search to favor the most likely matches and speed-up the process. 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.eng
dc.language.isoencze
dc.rights(c) 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.eng
dc.subjectGraph matchingeng
dc.subjectNon-rigid registrationeng
dc.subjectActive Testing Searcheng
dc.titleNon-Rigid Graph Registration using Active Testing Searcheng
dc.typeArticleeng
dc.identifier.doihttp://dx.doi.org/10.1109/TPAMI.2014.2343235
dc.publicationstatuspreprinteng


Files in this item



This item appears in the following Collection(s)

Show simple item record