K-mean程式撰寫問題,請各位先進協助! |
尚未結案
|
auslk
初階會員 發表:35 回覆:77 積分:32 註冊:2003-02-17 發送簡訊給我 |
各位先進及各位高手, 小弟在IEEE上下載一篇有關於影像分割的Journal
" Contrast enhancement based on divided histogram manipulation"
其中有一段k-mean將影像分求得其質量中心,歸類成k個群組
想請教各位先進與高手,能提供小弟方向或程式供參考用!
感激不盡!謝謝!
以下為k-mean 演算法 The recursive version of the K-mean Algorithm:
(1)Start out with k-clusters, which initialized with one sample
data picked at random.
Find the centroid closest to each of the n-2 samples remained.
Place the sample in the cluster with the closest centroid
identified.
After having each sample assigned, re-compute the centroid of
the cluster changed.
(2)Revisit the data again .Find for each sample the centroid closest
to it. Place the sample in the cluster with the closest centroid
identified (In this step, there is no need for re-computing of
any centroid.)
(3)Terminate if no cluster changes its center.
(4) Re-compute the centroids of clusters and repeat step 2.
|
本站聲明 |
1. 本論壇為無營利行為之開放平台,所有文章都是由網友自行張貼,如牽涉到法律糾紛一切與本站無關。 2. 假如網友發表之內容涉及侵權,而損及您的利益,請立即通知版主刪除。 3. 請勿批評中華民國元首及政府或批評各政黨,是藍是綠本站無權干涉,但這裡不是政治性論壇! |