Number of the records: 1  

Images registration by discontinuous correspondence calculated iteratively using graph cuts

  1. 1.
    SYSNO ASEP0337036
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleImages registration by discontinuous correspondence calculated iteratively using graph cuts
    TitleRegistrace obrazů pomocí nespojité korespondence vypočtené iterační metodou založenou na minimálním řezu v grafu
    Author(s) Janáček, Jiří (FGU-C) RID, ORCID
    Source TitleMC 2009 : Microscopy Conference, Life Sciences, Vol.2. - Graz : Verlag der Technischen Universität, 2009 / Pabst M. A. ; Zellnig G. - ISBN 978-3-85125-062-6
    Pagess. 417-418
    Number of pages2 s.
    ActionMC 2009 - Joint Meeting of Dreiländertagung and Multinational Congress on Microscopy /9./
    Event date30.08.2009-04.09.2009
    VEvent locationGraz
    CountryAT - Austria
    Event typeWRD
    Languageeng - English
    CountryAT - Austria
    Keywordsdiscontinuous registration ; graph cut
    Subject RIVJC - Computer Hardware ; Software
    R&D ProjectsIAA100110502 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    GA102/08/0691 GA ČR - Czech Science Foundation (CSF)
    LC06063 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    CEZAV0Z50110509 - FGU-C (2005-2011)
    AnnotationA general nonrigid registration procedure using possibly discontinuous correspondence between images was applied to images of subsequent physical sections. The correspondence was found by minimization of a functional penalizing the dissimilarity of corresponding image elements (measured by L1 distance) together with roughness of the correspondence function (measured by total variation). The minimum was found by iterative procedure using graph cut minimization in each step
    WorkplaceInstitute of Physiology
    ContactLucie Trajhanová, lucie.trajhanova@fgu.cas.cz, Tel.: 241 062 400
    Year of Publishing2010
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.