2014
DOI: 10.4028/www.scientific.net/amm.548-549.1179
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Normalized Cut Image Segmentation Algorithm with k-Means Cluster

Abstract: Image segmentation with low computational burden has been highly regarded as important goal for researchers. One of the popular image segmentation methods is normalized cut algorithm. But it is unfavorable for high resolution image segmentation because the amount of segmentation computation is very huge [1]. To solve this problem, we propose a novel approach for high resolution image segmentation based on the Normalized Cuts. The proposed method preprocesses an image by using the normalized cut algorithm to fo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2016
2016

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…At the end of an iteration, each pixel is assigned to the cluster with the closest center, and every cluster center location is recalculated as the average location of the pixels assigned to that cluster. The final result is a classification of the image into C number of classes [25,[27][28][29].…”
Section: K-means Algorithmmentioning
confidence: 99%
“…At the end of an iteration, each pixel is assigned to the cluster with the closest center, and every cluster center location is recalculated as the average location of the pixels assigned to that cluster. The final result is a classification of the image into C number of classes [25,[27][28][29].…”
Section: K-means Algorithmmentioning
confidence: 99%