Skip the Organizational structure panel
Organizational structure
On selecting a constituent part of MU the "Overview of publishing activities" page will be displayed with information relevant to the selected constituent part. The "Overview of publishing activities" page is not available for non-activated items.

Masaryk University
- Faculties
- Law
- Medicine
- Science
- Arts
- Education
- Economics
- Informatics
- Social Studies
- Sports Studies
- Institutes
- Computer Science
- CEITEC MU
- Politica
- Specialized Units
- Hostels & Canteens
- University Press
- Telč Centre
- UCB Management
- Rector`s Office
- Rectorate
- Other Units
- Archive
- Language Centre
- International Studies
- Disabled Students
- Technology Transfer
- Biostatistics
- Mendel Museum
- CERIT
- Civic Education
- Project Team CEITEC

Publication details

Smooth Chan-Vese Segmentation via Graph Cuts

Basic information
Original title:	Smooth Chan-Vese Segmentation via Graph Cuts
Authors:	Ondřej Daněk, Pavel Matula, Martin Maška, Michal Kozubek

Further information
Citation:	DANĚK, Ondřej - MATULA, Pavel - MAŠKA, Martin - KOZUBEK, Michal. Smooth Chan-Vese Segmentation via Graph Cuts. Pattern Recognition Letters, Amsterdam, Elsevier, The Nederlands. ISSN 0167-8655, 2012, vol. 33, no. 10, pp. 1405-1410. in press.
Original language:	English
Field:	Informatika
WWW:	http://www.sciencedirect.com/science/article/pii/S0167865512000955
Type:	Article in Periodical
Keywords:	image segmentation; graph cut framework; Chan-Vese model; boundary smoothness; memory consumption

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.

Related projects:

top