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”

Smooth Chan-Vese Segmentation via Graph Cuts

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00057198" target="_blank" >RIV/00216224:14330/12:00057198 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.sciencedirect.com/science/article/pii/S0167865512000955" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0167865512000955</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.patrec.2012.03.013" target="_blank" >10.1016/j.patrec.2012.03.013</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Smooth Chan-Vese Segmentation via Graph Cuts

  • Original language description

    The graph cut framework presents an efficient method for approximating the minimum of the popular Chan-Vese functional for image segmentation. However, a fundamental drawback of graph cuts is a need for a dense neighbourhood system in order to avoid geometric artefacts and jagged boundaries. The increasing connectivity leads to excessive memory consumption and burdens the efficiency of the method. In this paper, we address the issue by introducing a two-stage connectivity scaling approach. First, coarsesegmentation is calculated using a sparse neighbourhood over the whole image. In the second stage, the segmentation is refined by employing a dense neighbourhood in a narrow band around the boundary from the first stage. We demonstrate that this methodfits well with the Chan-Vese functional and yields smooth boundaries without increasing the computational demands significantly. Moreover, under specific conditions, the construction has no negative effect on the optimality of the solutio

  • Czech name

  • Czech description

Classification

  • Type

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

  • CEP classification

    IN - Informatics

  • 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)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2012

  • 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

    Pattern Recognition Letters

  • ISSN

    0167-8655

  • e-ISSN

  • Volume of the periodical

    33

  • Issue of the periodical within the volume

    10

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    6

  • Pages from-to

    1405-1410

  • UT code for WoS article

    000305771400018

  • EID of the result in the Scopus database