05.04.2013 Views

DEFORESTATION AROUND THE WORLD - India Environment Portal

DEFORESTATION AROUND THE WORLD - India Environment Portal

DEFORESTATION AROUND THE WORLD - India Environment Portal

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Unsupervised Classification of Aerial Images Based on the Otsu’s Method 177<br />

The unknowns in FCM clustering are:<br />

1. A fuzzy c-partition of the data, which is a c x n membership matrix U ik Vcnwith<br />

c rows and n columns. The values in row i give the membership of all n input data in<br />

cluster i for k=1 to n ; the k-th column of U gives the membership p of vector k (which<br />

represents some object k) in all c clusters for i=1 to c. Each of the entries in U lies in [0,1];<br />

each row sum is greater than zero; and each column sum equals 1.<br />

2. The other set of unknowns in the FCM model is a set of c cluster centers or prototypes,<br />

arrayed as the c columns of a p x c matrix V. These prototypes are vectors (points) in the<br />

input space of p-tuples. Pairs (U,V) of coupled estimates are found by alternating<br />

optimization through the first order necessary conditions for U and V. The objective<br />

function minimized in the original version measured distances between data points and<br />

prototypes in any inner product norm, and memberships were weighted with an<br />

exponent m>1<br />

That is:<br />

As X x1, x2,..., xnand<br />

the set all Vcn real matrices of dimension c x n, with 2 c n.<br />

Can<br />

be obtained a matrix representing the partition follow U ik Vcn.<br />

The basic definition<br />

FCM for m > 1 is to minimize the following objective function:<br />

n c<br />

m 2<br />

m ik<br />

k i G<br />

k1i1 G is a matrix of dimension pxp symmetric positive definite<br />

Where<br />

min z ( U; v) x v<br />

(15)<br />

<br />

2 t<br />

k i G k i k i<br />

x v x v G x v<br />

(16)<br />

i<br />

n<br />

1<br />

m<br />

n ik m k1<br />

ik <br />

k1<br />

k<br />

v x i 1,...,<br />

c<br />

<br />

1<br />

<br />

<br />

2 m1<br />

<br />

<br />

2<br />

xk v <br />

i G <br />

ik<br />

c <br />

2 m1<br />

<br />

i 1,..., c; k 1,...,<br />

n<br />

1 <br />

<br />

2 <br />

j1<br />

xk vj<br />

<br />

G<br />

<br />

The exponent m is known as exponential weight and reduces the influence of noise when<br />

getting the centers of the clusters. The higher the m > 1, the greater this influence. More<br />

details on fuzzy c-means clustering [11, 12].<br />

2.4 Methods for cluster validation<br />

Evaluation of clustering results (or cluster validation) is an important and necessary step in<br />

cluster analysis, but it is often time-consuming and complicated work [16].<br />

(17)<br />

(18)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!