This paper deals with experimental comparison of classical method of Graph cut segmentation with segmentation using Active contours. From methods of Active contours are chosen to comparison two methods. First method is based on classic Active contour method and second method is based on Active contours independent on gradient of the edges. Application of Graph cut segmentation allows finding the optimal global segmentation with the best balance between regional and boundary conditions among all possible segmentations at met condition limitations. Active contour segments the image by iterative deformation contour till this contour divided the image on the regions. Active contours are often implemented with level set methods for their universality and performance, but disadvantage is their computational complexity. The second method of the active contour allows to detect objects whose boundaries are not necessarily defined by gradient. The end rule in this case does not depend on gradient of the image, as in classical model of active contour, but instead refer to a particular segmentation of the image.
[1]
Tony F. Chan,et al.
Active contours without edges
,
2001,
IEEE Trans. Image Process..
[2]
Demetri Terzopoulos,et al.
Snakes: Active contour models
,
2004,
International Journal of Computer Vision.
[3]
Milan Sonka,et al.
Image pre-processing
,
1993
.
[4]
Vladimir Kolmogorov,et al.
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
,
2001,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5]
Olga Veksler,et al.
Fast Approximate Energy Minimization via Graph Cuts
,
2001,
IEEE Trans. Pattern Anal. Mach. Intell..
[6]
Gareth Funka-Lea,et al.
Graph Cuts and Efficient N-D Image Segmentation
,
2006,
International Journal of Computer Vision.
[7]
Milan Sonka,et al.
Image Processing, Analysis and Machine Vision
,
1993,
Springer US.