Algorithm 1 Fuzzy C-means algorithm.

1:Initialize U, a NxCmatrix with the membership grades 2:for each iteration k do 3:    Compute the centers set $C\left(k\right)=\left[c_j\right]$ using $c_j=\frac{{\displaystyle \sum _{i=1}^N}{u}_{i,j}^m{x}_i}{{\displaystyle \sum _{i=1}^N}{u}_{i,j}^m}$ 4:    Update $U^{\left(k\right)}$ with $u_{ij}=\frac{1}{{\displaystyle \sum _{k=1}^C}{\left(\frac{∥x_i-c_j∥}{∥x_i-c_k∥}\right)}^{\frac{2}{m-1}}}$ 5:    if $∥U^{k+1}-U^k∥<ϵ$ then 6:         Finish the process 7:    end if 8:end for