All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00207099" target="_blank" >RIV/68407700:21230/13:00207099 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s11263-012-0571-2" target="_blank" >http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s11263-012-0571-2</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s11263-012-0571-2" target="_blank" >10.1007/s11263-012-0571-2</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel

  • Original language description

    We propose a novel MRF-based model for image matching. Given two images, the task is to estimate a mapping from one image to another, in order to maximize the matching quality. We consider mappings defined by discrete deformation field constrained to preserve 2-dimensional continuity. We approach the corresponding optimization problem by the TRW-S (sequential Tree-reweighted message passing) algorithm [Wainwright-03, Kolmogorov-05]. Our model design allows for a considerably wider class of natural transformation and yields a compact representation of the optimization task. For this model TRW-S algorithm demonstrated nice practical performance on our experiments. We also propose a concise derivation of the TRW-S algorithm as a sequential maximization ofthe lower bound on the energy function.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    JD - Use of computers, robotics and its application

  • OECD FORD branch

Result continuities

  • 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)

Others

  • Publication year

    2013

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    International Journal of Computer Vision

  • ISSN

    0920-5691

  • e-ISSN

  • Volume of the periodical

    104

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    28

  • Pages from-to

    315-342

  • UT code for WoS article

    000322371100006

  • EID of the result in the Scopus database