Professional Documents
Culture Documents
Abstract
Activated sludge process is commonly used in wastewater treatment plants to process domestic or industrial effluent. The main
objects of interest in the activated sludge systems are flocs and the filamentous organisms. The proper settling of the sludge
flocs in the activated sludge wastewater treatment process is crucial to the normal functioning of the system. Sludge bulking
presents a common and persistent problem in wastewater treatment plants as it prevents the ability for flocs to settle down in
secondary clarifier of the plant. The conventional methods that detect this problem are time consuming and they give results
when very little time for precautionary measures is left. Hence image processing and analysis methods present potential
solutions to the long standing problem. In this paper image processing techniques are used to segment and detect activated
sludge flocs in microscopic images. This can help in the study of the morphology of individual flocs and their quantification.
Segmentation is one of the most important part of digital image processing. Good image segmentation is necessary for
identifying the objects of interest. In this paper, Otsu thresholding, K-means and C-means segmentation techniques are used to
segment and detect flocs in microscopic images of activated sludge. The performance of the segmentation techniques is
evaluated for activated sludge images at different microscopic magnifications using global consistency error (GCE) and
detection of number of flocs. Ground truth images are used to benchmark the accuracy of segmentation algorithms.
Introduction
Activated sludge process is widely employed process
included in the secondary stage of wastewater treatment
plants to treat wastewater from domestic sewage or food
industry. The disturbances and abnormal state of Activated
sludge wastewater treatment process can be detected and
identified by morphology of flocs and filaments found in
mixed liquor samples from aeration basin of the plant
(Heine, et al. 2001) (Bizukojc 2005)(Mesquita, et al. 2013).
Image analysis has been extensively reported in the last
decade in context of morphology of flocs which has been
correlated with sludge volume index (SVI), mixed liquor
suspended solids (MLSS) and abnormal conditions like
filamentous bulking and pin flocs (Mesquita, et al. 2011).
Image segmentation is partitioning of the image into
significant regions which represent the objects of interest in
the image. A number of image segmentation techniques
have been reported in context of activated sludge process.
Histogram based thresholding using intermeans algorithm
was used by Jenne et al. for segmentation of flocs and
filaments (Jenne`, et al. 2003). Heine et al. employed image
enhancement and edge detection using gradient, followed
by thresholding (Heine, et al. 2001). Sikora and Smolka
reported that segmentation using analysis of low spatial
frequency components and thresholding perform poorly
because of irregular illumination (Sikora and Smolka 2001).
They also suggested floc segmentation using variance
operator and filament segmentation using Laplacian. As
another alternative, Sikora and Smolka used Cannys
variance
and
between-class
b (Otsu 1979).
2T = 2w + 2b
(1)
The total variance is a constant number for any image, and
a within-class variance that has a lowest value will cause
the between-class variance to be maximal. It can be
2
imagined that a threshold which maximizes b has
achieved an optimum clustering state, and hence this forms
the principle for the Otsu thresholding technique. The
following discriminant criterion (of the three criteria
suggested by Otsu) was used (Otsu 1979)
2
= b2
T
(2)
The optimum threshold will be the intensity at the index
2
where b is maximum.
K-means Segmentation
In k-means clustering, the objective is to partition the data
(intensity values) into k clusters that minimizes the withincluster sum of squares of Euclidean point-to-centroid
distance for all the clusters (Tatiraju and Mehta 2008). The
algorithm follows an iterative refinement technique as
follows:
1. Determine/initialize k number of values for k
number of clusters. They are known as cluster
centres.
2. Attribute each data point with the cluster centre
closest to it.
3. Calculate the mean of the data points within each
cluster. The means become the new cluster centres.
4. Repeat the above steps until convergence is
reached.
After convergence, the binary threshold value is to be taken
from the border intensity value of the clusters.
Fuzzy C-means Segmentation
The fuzzy c-means clustering assumes that every pixel
belong to each cluster to some extent specified by
membership function. The clustering is done iteratively to
minimize sum of square of point-to-centroid distance scaled
by membership function, summed over all clusters (Bezdec
1981). The algorithm flow is as follows:
1. Initial guess for cluster centres.
2. Assignment of membership functions to every
point.
3. Update of centroids and membership function.
4. Repeat from step 2 above until the centroids have a
value change not larger than the termination
tolerance.
1
GCE= min
n
(1) and
where
{ E ( S , S , p ) , E(S , S , p )}
1
|R ( S a , pi ) / R ( Sb , pi )|
|R ( S a , pi )|
E ( S a , S b , pi ) =
|x|
(2)
is cardinality of set x and \ is the difference.
Experimental Results
The results in this paper are based on initial version of our
database which comprised of total 60 images: 26 at 4x, 15
at 10x, 14 at 20x and 5 at 40x magnification. The three
segmentation techniques which have been briefed in the
previous section were implemented. A database of images
of sample collected from wastewater treatment plants was
constructed at different objective magnifications of 4x, 10x,
20x and 40x. Ground truth images were prepared for the
images in order to assess the accuracy of segmentation. The
segmentation is evaluated against the respective ground
truth of each image. Global consistency error was used as
performance matric for the evaluation of the segmentation
accuracy. The results are depicted in the bar graph shown in
the figure.
The two results were observed in two perspectives:
performance of segmentation at each magnification and
effect of magnification on each segmentation algorithm. In
the first perspective, at each magnification, as obvious by
the figure 1(a), Otsu thresholding segmentation gave
minimum GCE at each magnification. Then k-mean global
thresholding performed better than fuzzy c-means at 4x and
10x magnification, but performed comparable with small
difference. It was observed that fuzzy c-means and k-means
segmentations are more sensitive to irregular illumination
than Otsu thresholding algorithm. Illumination can also
adversely affect the value of GCE as obvious from the
table. In the second perspective, fuzzy c-means appreciably
Original Image
Ground Truth
Fuzzy c-means
segmentation
K-means
segmentation
Otsu Thresholding
GCE=0.0544
GCE=0.0542
GCE=0.0394
GCE=0.0712
GCE=0.0592
GCE=0.0825
GCE=0.0455
GCE=0.0455
GCE=0.0356
GCE=0.0771
GCE=0.0772
GCE=0.0764
GCE=0.1615
GCE=0.1524
GCE=0.1256
GCE=0.1763
GCE=0.1715
GCE=0.1727
GCE=0.3176
GCE=0.3173
GCE=0.1382
4x
10x
20x
40x
GCE=0.1248
GCE=0.1228
GCE=0.0847
Figure 1: Mean GCE for fuzzy c-means, k-means and Otsu thresholding segmentations at different magnifications
Table 2: Total number of flocs detected by fuzzy c-means, k-means and Otsu thresholding segmentations at different
magnifications
Mag.
4
10
20
40
Ground Truth
101
136
140
21
Conclusions
The performance of segmentation algorithms is different for
different microscopic magnifications. Otsu thresholding
segmentation performed better as compared to fuzzy cmean and k-means segmentation. At low magnification, the
three algorithms work fine, but performance of fuzzy cmeans and k-means segmentation was deteriorated. Preprocessing has not been included in this study to compare
the capability of the segmentation algorithms only. The
results obviate the extent of pre-processing required for
segmentation. The database of images has been constructed
to include diverse illumination and field of depth conditions
to make the results consistent. As future work, database is
being expanded to abnormal conditions of wastewater
treatment plant, new segmentation techniques are being
investigated and additional assessment metric is needed to
cater for irregular illumination.
89
78
100
13
Otsu
Thresholding
89
116
167
33
Acknowledgement
References