A New Approach To Identify Big Rocks Wit PDF
A New Approach To Identify Big Rocks Wit PDF
A New Approach To Identify Big Rocks Wit PDF
D
etection of big rocks is an important, even critical, problem in the mining industry due to
the risk of machine blockage causing high costs. This paper presents a computer-vision-
based method to detect big rocks in a real mining industry. Our system, based on a
mixture of image processing techniques and neural networks, works as follows: once the image is
taken, a pre-processing step is performed, filtering the image and extracting a set of candidate
rocks. Then a neural network processes the candidate rocks to ensure correct detection. A
tracking algorithm is then applied to avoid false detection due to rock grouping. Using
geometrical information, it is possible to estimate the real dimensions of the rocks. Our computer
vision system satisfies time constraints imposed by the industry to work in real time and is
currently operating. The algorithm presented is independent of the rock’s shape. Results obtained
during nine months of unsupervized work are provided, showing that our system is able to work
under different light conditions and is robust enough to face real work conditions.
# 2002 Elsevier Science Ltd.
techniques and neural networks. Based on this ap- metric distribution of rocks on a conveyor belt is
proach, a real-time application has been developed. We computed with excellent results under the assumption of
have established an efficient algorithm to identify big controlled light.
rocks for a mining company. Excellent results have been
achieved in unsupervised operations (more than 70%
correct identification during a nine month period),
Proposed Rock Detector
working in real time and in a hard environment.
System overview
The structure of the rest of the paper is as follows.
The next section provides a short overview of previous
In the Uranium mine of our study there are two chutes
research. The section following is devoted to the
and two conveyor belts. One PC, two image acquisition
description of our system and the detailed explanation
cards and two black and white CCD cameras make up
of the algorithms implemented. Then, we present the
our vision system. Each camera is plugged into an
numerical results and a discussion. We end with
acquisition card and is focused on one chute. The
conclusions in the last section.
resolution for the image is set at 640 480 pixels with
256 gray levels. The software switches between the
cards, taking and processing alternatively one image
Previous Research
from each camera. A schematic vision of the system is
shown in Figure 1, showing both chutes and both
Mining industries are an open field for the use of
cameras. It is shown that two separated images are
computer vision systems in a large number of activities
analysed, each one obtained by a camera and containing
[1]. In particular, computer vision techniques could be
one chute.
employed to improve the quality of the mineral and to
avoid risky operations. The estimation of a rock’s size
Figure 2 shows a chute during operation. To the right
on a conveyor belt is useful to avoid blocking situations
of the image two metallic chains can be seen whose
or to determine the granulometric distribution of the
purpose is to avoid the rocks getting on top of one
rocks. Different algorithms have been considered in
another. Also, the chains sweep the rocks, forcing the
recent years to detect a rock on a conveyor belt as
biggest dimension of the rock into the plane of vision.
described below.
Dimensions of each chute are 2.5 m width and 6.5 m
long. Speed of the rocks in the chute is difficult to
An image-classification algorithm is presented by
measure and, in fact, no such measures were available at
Wang and Stephansson [2] to estimate the character-
the beginning of the work. Our estimations correspond
istics of rock fragments (size distribution and shape),
from 0.5 to 0.8 m/s, depending on the size and number
but its results depend on the quality of the image. A
of rocks, amount of dust in the chute and other
technique based on the shadows surrounding a rock is
conditions. The system achieves a processing rate of 8
presented by Wu et al. [3] but it is quite sensitive to light
image/s (4 image/s is per chute), enough to control both
conditions and rock texture. A multiresolution system is
chutes.
presented by Crida et al. [4,5] based on 12 features and
on the knowledge of rock characteristics. Experimental
thresholds for each feature have to be chosen.
Algorithm description In our set-up the camera is firmly placed, so the chute is
always shown in the same position. A region of interest
The algorithm has been structured in three phases is defined containing the chute, and only this region of
depending on the treatment applied to the images: interest will be processed. Those parts of the initial
acquisition, preprocessing (to obtain a set of candidate image outside the region of interest are eliminated, so
rocks in the image) and processing (using an artificial processing time is reduced without any loss of informa-
neural network and a tracking algorithm to ensure tion (see Figure 4).
correct detection). Once the preprocessing step is
finished, we have a set of candidate regions in the Processing rate (4 frame/s per chute) is almost
image. The processing step is initiated with the set of independent of the number of rocks in the image but
candidate regions and the initial gray level image, the depends on the number of pixels in the region of
result will be the correct detection of big rocks in the interest.
4 E. CABELLO ETAL.
Step 1
The histogram is equalized [8,9] to obtain a uniform
distribution in the gray levels along the image pixels,
consequently the contrast is increased to achieve better
differentiation of the rocks (see Figure 5). This step tries
to mitigate the changes in the light conditions under
which the system can work. In images of wet rocks an
overall brightening is achieved. In general, spreading out
the brightness values makes small variations more
evident. However, equalization does not work well
when both sunlight and shadows are present, but in our
conditions this is a very singular case. Usually we have
the whole image in sunlight or in shadow, so this step
offers acceptable results. Figure 6. Low-pass filtered image.
A NEW APPROACH TO IDENTIFY BIG ROCKS WITH APPLICATIONS TO THE MINING INDUSTRY 5
but the following were also considered: In our case, the direct thresholding of the image is not
2 3 able to produce a complete representation of rocks:
2 3 2 3 1 2 4 2 1 complex situations like shadows, overlapping and
1 2 1 1 1 1 62 4 6 4 27 touching rocks make this process very unreliable.
1 4 1 6 7
2 4 2 5; 4 1 1 1 5and6 64 6 8 6 477: Therefore a two-level algorithm is proposed. Our
16 9 42 4
1 2 1 1 1 1 6 4 25 algorithm is based on Tsai’s method (see Appendix)
1 2 4 2 1 and acts as follows. Using the histogram of the region of
interest, a first optimum threshold is computed using the
first three moments. Then, all the gray levels over the
Step 3 threshold are eliminated. With the remaining histogram
A two-level threshold process is then performed (see a second threshold is computed using the same algor-
Figure 7) in order to isolate the rocks present in the ithm. The final threshold is the mean between these two
image. Rocks are marked as white regions in a black thresholds. This two-level algorithm is capable of
background. To automatically compute the threshold, dealing with the noise in the image and performing well
the algorithms developed by Tsai [10], Otsu [11] and the with wet or dry rocks. Its computing time is reduced in
mean and median algorithm described by Jain [12] were comparison with that of the others methods considered.
tested. None of them offered good results for our
images. Step 4
A set of transforms is applied to the last image to
Several authors [13–15] have undertaken comparisons achieve a complete separation between white regions.
of the various thresholding methods, although a An algorithm based on erosion [16] is implemented (see
common difficulty has been to find an adequate metric Figure 8). The addition of this morphological-based step
for determining the effectiveness of each. Sahoo et al. offers better results in rock isolation, eliminating small
[13] considered the uniformity and shape of the white regions. The algorithm works as follows: if one of
thresholded objects to determine the success of several the eight neighbors of a pixel is black, this pixel will be
methods and concluded that Otsu’s algorithm was better black. This is applied eight times to give us smaller and
(although Tsai’s method was not considered). In this better-separated white regions. This number is set accor-
paper, Tsai compared their algorithm with Otsu’s ding to the size of the image and considering the
method and concluded that both produced similar minimum size that has to be detected. At the end, small
results but Otsu’s method performs poorly in the junctions between white regions are removed. Then, a
presence of noise and shadows. Another advantage is ‘‘separator’’ algorithm is applied, removing white reg-
that Tsai’s method is significantly faster. ions with few pixels both in vertical and in horizontal.
Image processing
Figure 12. Most significant results obtained in real conditions during nine months (from January to September, 1999) of
unsupervised work.
situation. In the traditional approach, only one worker This paper presents some results obtained using a
has to control both chutes. If one chute is blocked, he mixture of image preprocessing algorithms and neural
has to stop both chutes and crush the rocks (chutes networks. In the preprocessing phase, different algo-
could not work unsupervised, according with Spanish rithms have been tested and the final implementation
security regulations). Our system allows that one chute considered is a sequence of operators. Some of the
works without human supervision. So, from the begin- operators have been tailored to our specific problem.
ning the system helped the worker and achieved some of The output of the preprocessing phase is a set of image
the objectives. Unfortunately it is impossible to offer a windows that may contain a rock. Then, a neural
comparison in the number of stops after and before the network decides if a rock is present or not. Mechanisms
system was placed because there is no data before the avoiding false alarms due to rock grouping have been
system was placed. Initially, chutes were controlled implemented.
visually and no statistics were reported; our system is the
first automatic system placed to inspect the chutes. The Our system has been developed to face a real and
company estimates that the number of stops has been specific situation with constraints due to the system
cut by half. emplacement. But we believed that with small changes
this system could be tailored to other situations by
The results reveal a correct recognition rate of over implenting faster chutes and alternate set-up conditions.
70%, which was required by ENUSA. The system Once the system was in place, the worker felt
achieves a processing rate of 8 image/s (4 image/s per comfortable with it. Only one chute has to be stopped
chute) enough to control both chutes. when a blocking situation presents itself. On the
computer screen both chutes are displayed in real time,
and could be observed at one glance.
Conclusions
Neural network and image processing methods,
Mining industries are a very hostile environment, both working together, improve the efficiency of the system
for humans and computers. Computer systems could and the rate of false alarms is maintained at a low level.
make the work easier and avoid risky situations for Problems derived from real time, light variations and
workers. Both objectives are covered by our system. The dust in suspension have been taken into account to
computer vision system described performs the onerous achieve a robust algorithm. The system is easy to
task of estimating rock size to avoid blockages homo- operate and is working in a real environment. An
geneously and repetitively. Significant results have been extensive in-place test (nine months of unsupervised
achieved: first, risky situations are avioded, second the work) shows that objectives have been achieved.
system helps in a hard job. A computer vision system
developed for mining environments has to be robust,
and special attention has to be given to the selection of Acknowledgments
the algorithms.
The authors are grateful for the work of Julian Nieto
Different techniques have been proposed in the and Jesús M. Berrocal, both of whom were supported by
literature for dealing with rock recognition problems. Junta de Castilla y Leon. The authors would also like to
A NEW APPROACH TO IDENTIFY BIG ROCKS WITH APPLICATIONS TO THE MINING INDUSTRY 9
thank Guido Castro and his support from Agencia 19. Looney, C.G. (1997) Pattern Recognition Using Neural
Española de Cooperación Internacional. The support of Networks. Oxford University Press.
ENUSA and its workers in Saelices (Salamanca) is also 20. Jolliffe, I.T. (1986) Principal Component Analysis. Spring-
er-Verlag.
acknowledged. 21. Fukunaga, K. (1989) Statistical Pattern Recognition. New
York: Academic Press.
22. Daugman, J.D. Complete discrete 2-D Gabor transforms
by Neural networks for image analysis and compression.
References IEEE Trans. On Acoustics, Speech and Signal Processing
36: 1169–1179.
1. Corke, P. Roberts, J. & Winstanley, G. (1998). Vision
based control for mining automation. IEEE Robotics and Appendix: Tsai’s Algorithm
Automation Magazine 5: 44–49.
2. Wang, W.X. & Stephansson, O. (1996). Automatic The number of pixels with a given gray level i is termed
selection of fragment images from a moving conveyor ni and the total number of pixels in the image is given by
belt. Mining Engineering. August: 83–88.
3. Wu, X., Devgan, A., Hagaman, R. & Kemeny, J.M. X
255
(1993). Analysis of rock fragmentation using digital image N¼ ni
processing. Journal of Geotechnical Engineering, 119: i¼0
1144–1160.
4. Crida, R.C. & De Jager, G. (1994) Rock recognition using The probability of a pixel having a given gray level is
feature classification. Proceedings of the IEEE South thus:
African Symposium on Communications and Signal Proces- ni
sing October 1994, pp. 152–157. Pi ¼
5. Crida, R.C. & De Jager, G. (1996) Multiscalar rock N
recognition using active vision. Proceedings of the IEEE The j’th moment of the gray level probability histogram
International Conference on Image Processing, September
1996.
is given by:
6. Crida, R.C. & De Jager, G. (1992). Rock detection using X
255
neural networks. Proceedings of the Third South African mj ¼ Pi ðiÞ j
Workshop on Pattern Recognition, November 1992. i¼0
7. Fernandez, R., Viennet, E., Goles, E., Barrientos, R. &
Telias, M. (1995) On-line coarse ore granulometric Note that obviously, m0=1.
analyzer using neural networks. Proceeding of ICANN
1995. For thresholding, a single threshold T will be used to
8. Russ, J.C. (1995) The Image Processing Handbook. CRC
Press. classify image pixels into two classes with mean gray
9. Baxes, G.A. (1994) Digital Image Processing. Principles level Z0 and Z1. If p0 is the fraction of pixels below T
and Applications. John Wiley. and p1 is the fraction above T, then the moments for the
10. Tsai, W.H. (1985) Moment preserving threshold: A new thresholded image are given by:
approach. Computer Vision Graphics and Image processing
29: 377–393. X
1
11. Otsu, N. (1979) A threshold selection method for gray- m0j ¼ pk ðzk Þ j
level histograms. IEEE Transactions on System, Man And k¼0
Cybernetics 9: 62–66.
12. Jain, A.K. (1989) Fundamentals of Digital Image Proces-
sing. Prentice Hall. The moments of the original image are preserved in
13. Sahoo, P.K., Soltani, S., Wong, A.K.C. & Chen, Y.C. the thresholded image by equating mj and mj (for j=0, 1,
(1988) A survey of thresholding techniques. Computer 2, 3) which produces four equalities which are known as
Vision Graphics Image Process. 41: 233–260.
14. Lee, S.U., Chung, S.Y. & Park, R.H. (1990) A compara-
the moment-preserving equations. These equations have
tive performance study of several global thresholding to be solved to obtain p0 and p1. The threshold T can
techniques for segmentation. Computer Vision Graphics then be calculated by determining the p0-tile from:
Image Process. 52: 171–190.
15. Hannah, I., Patel, D. & Davies, R. (1995) The use of X
T