Images registration by discontinuous correspondence calculated iteratively using graph cuts

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985823%3A_____%2F09%3A00337036" target="_blank" >RIV/67985823:_____/09:00337036 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Images registration by discontinuous correspondence calculated iteratively using graph cuts

Original language description

A 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

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

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

Article name in the collection

MC 2009 : Microscopy Conference

ISBN

978-3-85125-062-6

ISSN

—

e-ISSN

—

Number of pages

2

Pages from-to

—

Publisher name

Verlag der Technischen Universität

Place of publication

Graz

Event location

Graz

Event date

Aug 30, 2009

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—