KmsGC: An Unsupervised Color Image Segmentation Algorithm Based on <svg xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg" style="vertical-align:-0.0pt;width:17.525px;" id="M1" height="14.7" version="1.1" viewBox="0 0 17.525 14.7" width="17.525">
	
		
			<g transform="matrix(.022,-0,0,-.022,.062,14.638)"><path id="x1D43E" d="M764 650l-7 -26q-61 -10 -91.5 -22.5t-76.5 -48.5l-235 -184q104 -152 208 -276q31 -37 54.5 -48.5t68.5 -16.5l-7 -28h-156q-138 170 -213 284q-19 29 -33.5 35t-33.5 -7l-29 -173q-15 -75 -5.5 -90.5t74.5 -20.5l-5 -28h-260l7 28q58 5 74 21.5t30 89.5l70 378
q12 68 2 83t-72 22l6 28h257l-7 -28q-62 -7 -76 -21.5t-27 -83.5l-32 -172q29 11 78 46q112 84 217 179q18 16 23.5 25.5t-1 14.5t-26.5 8l-30 4l5 28h249z"></path></g>

		
	
</svg>-Means Clustering and Graph Cut

<table>Examples of the segmentation results. 1st and 3rd columns are the original images; 2nd and 4th columns are the segmented images.</table>

Mathematical Problems in Engineering

fig8

Figure 8

Figure 8: KmsGC: An Unsupervised Color Image Segmentation Algorithm Based on <svg xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg" style="vertical-align:-0.0pt;width:17.525px;" id="M1" height="14.7" version="1.1" viewBox="0 0 17.525 14.7" width="17.525">
	
		
			<g transform="matrix(.022,-0,0,-.022,.062,14.638)"><path id="x1D43E" d="M764 650l-7 -26q-61 -10 -91.5 -22.5t-76.5 -48.5l-235 -184q104 -152 208 -276q31 -37 54.5 -48.5t68.5 -16.5l-7 -28h-156q-138 170 -213 284q-19 29 -33.5 35t-33.5 -7l-29 -173q-15 -75 -5.5 -90.5t74.5 -20.5l-5 -28h-260l7 28q58 5 74 21.5t30 89.5l70 378
q12 68 2 83t-72 22l6 28h257l-7 -28q-62 -7 -76 -21.5t-27 -83.5l-32 -172q29 11 78 46q112 84 217 179q18 16 23.5 25.5t-1 14.5t-26.5 8l-30 4l5 28h249z"></path></g>

		
	
</svg>-Means Clustering and Graph Cut 

Mathematical Problems in Engineering

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

Figure 8