In the short time since publication of Boykov and Jolly's seminal paper [2001], graph cuts have become well established as a leading method in 2D and 3D semi-automated image segmentation. Although this approach is computationally feasible for many tasks, the memory overhead and supralinear time complexity of leading algorithms results in an excessive computational burden for high-resolution data. In this paper, we introduce a multilevel banded heuristic for computation of graph cuts that is motivated by the well-known narrow band algorithm in level set computation. We perform a number of numerical experiments to show that this heuristic drastically reduces both the running time and the memory consumption of graph cuts while producing nearly the same segmentation result as the conventional graph cuts. Additionally, we are able to characterize the type of segmentation target for which our multilevel banded heuristic yields different results from the conventional graph cuts. The proposed method has been applied to both 2D and 3D images with promising results.
A multilevel banded graph cuts method for fast image segmentation
Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 ; 1 ; 259-265 Vol. 1
01.01.2005
915248 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
A Multilevel Banded Graph Cuts Method for Fast Image Segmentation
British Library Conference Proceedings | 2005
|Efficient Graph Cuts for Multiclass Interactive Image Segmentation
Springer Verlag | 2007
|Graph Cuts and Efficient N-D Image Segmentation
British Library Online Contents | 2006
|Fast image blending using watersheds and graph cuts
British Library Online Contents | 2009
|Image Segmentation Using Iterated Graph Cuts Based on Multi-scale Smoothing
Springer Verlag | 2007
|