KmsGC: An Unsupervised Color Image Segmentation Algorithm Based on -Means Clustering and Graph Cut

Binmei Liang and Jianzhou Zhang

Mathematical Problems in Engineering, 2014, vol. 2014, 1-13

Abstract:

For unsupervised color image segmentation, we propose a two-stage algorithm, KmsGC, that combines -means clustering with graph cut. In the first stage, -means clustering algorithm is applied to make an initial clustering, and the optimal number of clusters is automatically determined by a compactness criterion that is established to find clustering with maximum intercluster distance and minimum intracluster variance. In the second stage, a multiple terminal vertices weighted graph is constructed based on an energy function, and the image is segmented according to a minimum cost multiway cut. A large number of performance evaluations are carried out, and the experimental results indicate the proposed approach is effective compared to other existing image segmentation algorithms on the Berkeley image database.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/464875.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/464875.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:464875

DOI: 10.1155/2014/464875

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().