資源簡(jiǎn)介
通過(guò)k均值算法對(duì)圖像進(jìn)行聚類運(yùn)算,獲得聚類圖像
代碼片段和文件信息
function?[mumask]=kmeans1(imak)
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%???kmeans?image?segmentation
%
%???Input:
%??????????ima:?grey?color?image
%??????????k:?Number?of?classes
%???Output:
%??????????mu:?vector?of?class?means?
%??????????mask:?clasification?image?mask
%
%???Author:?Jose?Vicente?Manjon?Herrera
%????Email:?jmanjon@fis.upv.es
%?????Date:?27-08-2005
%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%?check?image
gpp=size(ima1);
for?i=1:gpp
????for?j=1:gpp
????????ima(ij)=uint16(ima(ij));
????end
end
mask=ima;
ima=double(ima);
copy=ima;?????????%?make?a?copy
ima=ima(:);???????%?vectorize?ima?圖像轉(zhuǎn)成一個(gè)向量
mi=min(ima);??????%?deal?with?negative?求圖像中的最小灰度值
ima=ima-mi+1;?????%?and?zero?values?圖像所有值向下浮動(dòng)至最小值為1
s=length(ima);????%?計(jì)算向量總元素?cái)?shù)
%?create?image?histogram
m=max(ima)+1;????%取最大像素值
h=zeros(1m);????%聚類前圖像向量中各灰度出現(xiàn)的次數(shù)統(tǒng)計(jì)
hc=zeros(1m);???%聚類后圖像向量所屬類編號(hào)
for?i=1:s
??if(ima(i)>0)?
??????%bpp=
評(píng)論
共有 條評(píng)論