J 2012

Smooth Chan-Vese Segmentation via Graph Cuts

DANĚK, Ondřej, Pavel MATULA, Martin MAŠKA and Michal KOZUBEK

Basic information

Original name

Smooth Chan-Vese Segmentation via Graph Cuts

Name in Czech

Hladká Chan-Vese segmentace pomocí grafových řezů

Authors

DANĚK, Ondřej (203 Czech Republic, guarantor, belonging to the institution), Pavel MATULA (203 Czech Republic, belonging to the institution), Martin MAŠKA (203 Czech Republic) and Michal KOZUBEK (203 Czech Republic, belonging to the institution)

Edition

Pattern recognition letters : an official publication of the International Association for Pattern Recognition. Amsterdam, Elsevier, 2012, 0167-8655

Other information

Language

English

Type of outcome

Článek v odborném periodiku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Netherlands

Confidentiality degree

není předmětem státního či obchodního tajemství

References:

Impact factor

Impact factor: 1.266

RIV identification code

RIV/00216224:14330/12:00057198

Organization unit

Faculty of Informatics

DOI

UT WoS

000305771400018

Keywords in English

image segmentation; graph cut framework; Chan-Vese model; boundary smoothness; memory consumption

Tags

Tags

International impact, Reviewed
Změněno: 22/4/2013 05:21, RNDr. Pavel Šmerk, Ph.D.

Abstract

ORIG CZ

V originále

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, coarse segmentation 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 method fits 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 solution.

In Czech

Článek se zabývá hladkou Chan-Vese segmentací pomocí grafových řezů.

Links

GBP302/12/G157, research and development project
Name: Dynamika a organizace chromosomů během buněčného cyklu a při diferenciaci v normě a patologii
Investor: Czech Science Foundation
LC535, research and development project
Name: Dynamika a organizace chromosomů během buněčného cyklu v normě a patologii
Investor: Ministry of Education, Youth and Sports of the CR, Dynamika a organizace chromosomů během buněčného cyklu v normě a patologii
MSM0021622419, plan (intention)
Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
MUNI/A/0914/2009, interní kód MU
Name: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace (Acronym: SV-FI MAV)
Investor: Masaryk University, Category A
2B06052, research and development project
Name: Vytipování markerů, screening a časná diagnostika nádorových onemocnění pomocí vysoce automatizovaného zpracování multidimenzionálních biomedicínských obrazů (Acronym: Biomarker)
Investor: Ministry of Education, Youth and Sports of the CR, Determination of markers, screening and early diagnostics of cancer diseases using highly automated processing of multidimensional biomedical images