Identification of Plastic Wastes by Using Fuzzy Radial Basis Function Neural Networks Classifier With Conditional Fuzzy C-Means Clustering
Identification of Plastic Wastes by Using Fuzzy Radial Basis Function Neural Networks Classifier With Conditional Fuzzy C-Means Clustering
Abstract – The techniques to recycle and reuse plastics attract public attention. These public
attraction and needs result in improving the recycling technique. However, the identification technique
for black plastic wastes still have big problem that the spectrum extracted from near infrared radiation
spectroscopy is not clear and is contaminated by noise. To overcome this problem, we apply Raman
spectroscopy to extract a clear spectrum of plastic material. In addition, to improve the classification
ability of fuzzy Radial Basis Function Neural Networks, we apply supervised learning based clustering
method instead of unsupervised clustering method. The conditional fuzzy C-Means clustering method,
which is a kind of supervised learning based clustering algorithms, is used to determine the location of
radial basis functions. The conditional fuzzy C-Means clustering analyzes the data distribution over
input space under the supervision of auxiliary information. The auxiliary information is defined by
using k Nearest Neighbor approach.
Keywords: Identification of plastic wastes, Conditional fuzzy C-means clustering, k nearest neighbor
approach, Fuzzy radial basis function neural networks
1872
Copyright ⓒ The Korean Institute of Electrical Engineers
This is an Open-Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/
licenses/by-nc/3.0/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
Seok-Beom Roh and Sung-Kwun Oh
http://www.jeet.or.kr │ 1873
Identification of Plastic Wastes by Using Fuzzy Radial Basis Function Neural Networks Classifier with Conditional Fuzzy C-Means Clustering
min J subject to
c
3. Radial Basis Function Neural Networks based
W, v åwi =1
ik = fk (7)
on Auxiliary Information
The optimal solution that minimizes the objective On the contrary to the general definition methods for
function (1) subject to (6) can be obtained by iterative the locations of RBFs which are based on the unsupervised
update formulas such as (8) and (9). clustering algorithm, we use cFCM to determine the
locations of RBFs under the supervision of the auxiliary
fk information. The auxiliary information includes the
wik = 2 / (p -1 ) information of the class label of the given data point.
C æ || x k - v i || ö (8)
å çç ÷÷ This statement means that we can use the information,
j =1 è || x k - v j || ø which the given data patterns represent over input space an
output space, as much as we can use.
N
p In some literatures [10, 11], it is said that the RBFNNs
å (u )
k =1
ik × xk
have some advantages including global optimal approxi-
vi = N (9)
p mation and classification capabilities as well as rapid
å (u )
k =1
ik
convergence of the underlying learning procedures.
The generic topology of RBF NNs is depicted in Fig. 1.
In Fig. 1, Gi , i=1, 2,…, c denote receptive fields (radial
2.3 k-Nearest neighbor approach for auxiliary basis functions), while the parameter “m” denotes the
information number of input variables. The output of the generic RBF
NN is expressed as a linear combination of the outputs
To apply the above explained cFCM, the already defined ( G(x) ) of the corresponding hidden nodes with the
auxiliary information should be needed. We use k Nearest connection weights w1 , w2 , L , wc as (12).
Neighbor approach to extract the auxiliary information
which is defined on the output space. We can say that the c
data point, whose nearest neighbors are involved in the same yˆ(x) = å wi × Gi (x) (12)
i =1
class, has homogeneous characteristic. The heterogeneous
data point is defined as the data point whose nearest
Here, G(x) means the activation level of i-th hidden
neighbors are involved in different classes.
node.
In order to build homogeneous clusters over the input
We expand the generic RBFNNs by adopting cFCM to
space, the homogeneous data points should be considered
locate RBFs with the aids of auxiliary information and
more importantly in comparison with the heterogeneous
applying polynomials to connection weights. In the
data points. Therefore, we define the auxiliary information
expanded version of RBFNNs, the auxiliary information
of a given data point as how much homogeneous the data
extracted by kNN help cFCM determine the location of
point is. In pattern recognition fields, kNN approach is
RBFs in the viewpoint of the homogeneity of the data
considered as a kind of non-parametric method to directly
points involved in the RBFs. We assume that in order to
classify the given data point. On the contrary, we use kNN
improve the identification performance, the data points
approach to extract the auxiliary information.
which are involved in a cluster defined by a RBF should be
We define the auxiliary information as (10).
homogeneous. To obtain the homogeneous clusters, we
nij
f ij = (10)
K
L L nij
åf
j =1
ij =å
j =1 K
=1 (11)
Here, L means the number of classes. Fig. 1. General architecture of the generic RBF neural
networks
http://www.jeet.or.kr │ 1875
Identification of Plastic Wastes by Using Fuzzy Radial Basis Function Neural Networks Classifier with Conditional Fuzzy C-Means Clustering
Here, Ä means the element-wise product. The result of “ Ä ” operation of two spectra is calculated as
T
For example, let the spectrum A and B be A Ä B = éë a1 × b1 a2 × b2 L aq × bq ùû .
T T
A = éë a1 a2 L aq ùû and B = éëb1 b2 L bq ùû respectively. The results of XOR operation between two different
plastic materials are shown in Fig. 5.
The element-wise operation version of (15) is
xor (a, b) = (1 - a ) × b + a × (1 - b) .
In the case of a = 0 & b = 1 or a = 1 & b = 0 , the
output of the operation is maximized. In other words,
when the difference between two spectra is big, the
output of the XOR operation becomes big. We can
consider the 15 maximum points of the result of the
“XOR” operation between three different plastic materials
as the characteristic peaks which are shown in only one
plastic material.
In the plastic material identification experiment, we
(a) XOR operation between PET and PP obtain 100 raw spectra for each plastic material and total
300 row spectra (100 PET, 100 PP, and 100 PS). From this
“XOR” operation, we can estimate 15 characteristic peaks
as shown in Table 1.
5. Experimental Studies
http://www.jeet.or.kr │ 1877
Identification of Plastic Wastes by Using Fuzzy Radial Basis Function Neural Networks Classifier with Conditional Fuzzy C-Means Clustering
http://www.jeet.or.kr │ 1879