A Novel Image Segmentation Algorithm Based on Graph Cut Optimization Problem
Image segmentation, a fundamental task in computer vision, has been widely used in recent years in many fields. Dealing with the graph cut optimization problem obtains the image segmentation results. In this study, a novel algorithm with weighted graphs was constructed to solve the image segmentation problem through minimization of an energy function. A binary vector of the segmentation label was defined to describe both the foreground and the background of an image. To demonstrate the effectiveness of our proposed method, four various types of images were used to construct a series of experiments. Experimental results indicate that compared with other methods, the proposed algorithm can effectively promote the quality of image segmentation under three performance evaluation metrics, namely, misclassification error rate, rate of the number of background pixels, and the ratio of the number of wrongly classified foreground pixels.
Article MetricsAbstract view : 125 times
PDF - 137 times
- There are currently no refbacks.
Copyright (c) 2015 Universitas Ahmad Dahlan
TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus, 9th Floor, LPPI Room
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120 ext. 4902, Fax: +62 274 564604
View TELKOMNIKA Stats
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.