Next Article in Journal
An Efficient and Energy-Aware Cloud Consolidation Algorithm for Multimedia Big Data Applications
Next Article in Special Issue
Forecasting Model Based on Neutrosophic Logical Relationship and Jaccard Similarity
Previous Article in Journal
Effects of Handedness and Viewpoint on the Imitation of Origami-Making
Previous Article in Special Issue
NS-k-NN: Neutrosophic Set-Based k-Nearest Neighbors Classifier
Open AccessFeature PaperArticle

An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut

Department of Computer Science, University of Illinois at Springfield, Springfield, IL 62703, USA
Department of Electrical and Electronics Engineering, Firat University, 23119 Elazig, Turkey
Oracle Corporation, Westminster, CO 80021, USA
Mathematics & Science Department, University of New Mexico, Gallup, NM 87301, USA
Author to whom correspondence should be addressed.
Symmetry 2017, 9(9), 185;
Received: 28 June 2017 / Revised: 30 August 2017 / Accepted: 3 September 2017 / Published: 6 September 2017
(This article belongs to the Special Issue Neutrosophic Theories Applied in Engineering)
Segmentation is considered as an important step in image processing and computer vision applications, which divides an input image into various non-overlapping homogenous regions and helps to interpret the image more conveniently. This paper presents an efficient image segmentation algorithm using neutrosophic graph cut (NGC). An image is presented in neutrosophic set, and an indeterminacy filter is constructed using the indeterminacy value of the input image, which is defined by combining the spatial information and intensity information. The indeterminacy filter reduces the indeterminacy of the spatial and intensity information. A graph is defined on the image and the weight for each pixel is represented using the value after indeterminacy filtering. The segmentation results are obtained using a maximum-flow algorithm on the graph. Numerous experiments have been taken to test its performance, and it is compared with a neutrosophic similarity clustering (NSC) segmentation algorithm and a graph-cut-based algorithm. The results indicate that the proposed NGC approach obtains better performances, both quantitatively and qualitatively. View Full-Text
Keywords: image segmentation; neutrosophic set; graph cut; indeterminate filtering image segmentation; neutrosophic set; graph cut; indeterminate filtering
Show Figures

Figure 1

MDPI and ACS Style

Guo, Y.; Akbulut, Y.; Şengür, A.; Xia, R.; Smarandache, F. An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut. Symmetry 2017, 9, 185.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Search more from Scilit
Back to TopTop