کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
536486 870534 2012 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Smooth Chan–Vese segmentation via graph cuts
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
Smooth Chan–Vese segmentation via graph cuts
چکیده انگلیسی

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.


► We study the graph cut based minimization of the Chan–Vese segmentation model.
► Sparse neighbourhoods cause geometric artefacts and jagged boundaries, dense neighbourhoods are inefficient.
► Two-stage algorithm for smooth and memory efficient segmentation is proposed.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition Letters - Volume 33, Issue 10, 15 July 2012, Pages 1405–1410
نویسندگان
, , , ,