Efficient Crack Detection and Quantification in Concrete Structures Using IoT
Efficient Crack Detection and Quantification in Concrete Structures Using IoT
Engineering
To cite this article: Ajay Nair, Hemalatha R, P Sangeetha, Harish Kumar K, Dinesh Kumar P,
Inakota Sai Sahith & S. Radha (2021) Efficient crack detection and quantification in concrete
structures using IoT, Australian Journal of Electrical and Electronics Engineering, 18:1, 43-57,
DOI: 10.1080/1448837X.2021.1914905
To link to this article: https://doi.org/10.1080/1448837X.2021.1914905
CONTACT Hemalatha R [email protected] Dept of Electronics and Communication, Sri Sivasubramaniya Nadar College of Engineering,
Chennai, Tamilnadu, India
© Engineers Australia
44 A. NAIR ET
AL.
method of filling the gaps between cracks but it can The paper is organised as follows. Information on
turn up with relatively more number of false posi- the different types of crack is given in section 2.
tives. Methods for more specific applications such Section 3 briefs about the proposed model. Section 4
as cracks in tunnels and underground pipes are provides the performance evaluation and section 5
also proposed which extract characteristic shapes explains the IoT (Internet of Things)-based monitoring.
of such cracks for detection (Sinha and Fieguth Finally, section 6 concludes the paper with future
2006) (Seung-Nam, Jang, and Han 2007). work.
An effective segmentation method to identify crack
was proposed by Long et al. (Long, Shen, and Chen
2012). It was enabled through grey level correction 2. Overview of cracks
and adaptive minimum error threshold but could not
Cracking can occur due to various reasons such as
classify cracks. Han et al. (Han et al. 2016) used an
thermal stresses, chemical reaction, corrosion of rein-
interactive genetic algorithm and determined the
forcement or simply poor construction practices such
edges of the cracks and calculated its geometric para-
as poor concrete mix or rapid curing. Cracks can be of
meters through intensive calculations. The combina-
different types such as alligator, transversal or long-
tion of Canny edge detector and support vector
itudinal (Ajagbe and Ojedele 2018) (Md. et al. 2018).
machine was used to detect cracks. This enhanced
The other types are shrinkage and hairline cracks as
the ability to extract contours but struggled with
shown in Figure 1, which may result in leakage.
cracks [Li et al. (Shi et al. 2016)]. Similarly, Canny
Horizontal, vertical and diagonal cracks are charac-
edge detection has been used along with fast Haar
terised by how they are oriented in the structure.
transform algorithm for crack detection but, suffered
Alligator cracks occur as a V shape. Settlement cracks
with false crack detection. In addition, the method
may occur if there are problems with respect to the
could not extract crack pixels. The width of the cracks
underlying ground.
was also measured using labelling based on Red-Green
Manual introduction of cracks is performed in the
-Blue (RGB) colour information (Hutchinson and
laboratory to generate a data base. This involves mak-
Chen 2006).
ing of the test specimen in the desired shape as shown
It is also to be noted that a single algorithm for in Figure 2.
crack detection is not always expected to give Curing is done for about a month. After a couple of
efficient results for all practical situations. Some hours of dryness it is kept in an oven for an hour for
structures might have a large number of cracks with hardening. Then, cracks are introduced by the univer-
lesser major ones for repair purposes. Other sal testing machine by applying the desired load as
structures may have few minute cracks but each crack shown in Figure 3.
might have to be detected to ensure the safety of that
structure. Hence, the two proposed crack detection
algorithms will cater correspondingly to the needs of 3. Proposed system model
the afore- mentioned problems. The combination of
The proposed system can be visualised based on a
algorithms proposed in this paper is more efficient in
flow diagram as shown in Figure 4.
detecting even the finest cracks compared to the
The proposed system can be segmented into
complex algo- rithms (Zhang et al. 2014a). Moreover,
three major sections: the image processing, IoT-
real-time mon- itoring methodologies are also
based monitoring and the crack measurements
illustrated to ensure seamless implementation.
and analysis section. The system has two algo-
rithms for crack detection either of which can
AUSTRALIAN JOURNAL OF ELECTRICAL AND ELECTRONICS ENGINEERING 45
include the removal of noisy regions or improving pixel is replaced with the background pixel. This pro-
the lighting. Further denoising can be performed cess helps to remove foreground regions of the image.
using a median filter which essentially smoothens Dilation: The opposite process from erosion
the image. Median filtering preserves the image wherein if even one pixel of the structuring element
edges while removing the noise. A 3 × 3 kernel is overlaps with the foreground image, then the centre
used which takes the median of values in the pixel is replaced with the foreground pixel. This pro-
neighbourhood and replaces the centre pixel with cess helps to increase the number of foreground pixels.
it. A large kernel size is good for high noise den- Closing: Closing is dilation followed by erosion.
sities but will excessively blur the image. Next, This morphological algorithm is represented in
binarization is used to convert pixel values to bin- Figure 6.
ary as expressed in Equation (1). (1) Preprocessing: The image is filtered out by using
Gaussian blur to remove unwanted noise components.
fb(x) = �0ifx T It is convolved with a Gaussian filter rather than a box
(1)
1ifx ≤
>T filter which replaces each pixel with a weighted aver-
where T is the selected threshold and fb x is the age of the neighbouring pixels. It is used to remove
binarized image. ( ) the high-frequency components. Here, a 3 × 3
The selection of threshold is a critical step in order Gaussian filter governed by Equation (2) is traversed
to optimally detect and separate cracks from the over the image.
image. Here a statistical analysis is used to determine � �
1 —(x2 + y2)
G( x) = exp (2)
the appropriate threshold. The greyscale peak value 2σ2
2πσ2
(N) is obtained using the histogram and is taken as the
initial threshold. If the output is not satisfactory, the where G(x) is the expression for the Gaussian filter in
threshold is manually reduced by 1 pixel increments. two dimensions.
Generally, a threshold of around N-8 to N-10 was Larger the standard deviation (σ), greater is the
found to be suitable by experimentation. For a set of image blurring. It is important to preserve image qual-
images under a certain lighting, threshold will most ity along with reducing noise and so it is not advisable
likely not change. This is followed by image to go for larger values of σ. Here σ = 1 is found to suit
segmenta- tion and labelling. Segmentation involves our requirements.
partitioning the image into its constituent parts. (1) Bottom hat transform: This is the subtraction of
Labelling is done on the image to identify possible image closing by original image. This helps to obtain
regions of cracks. This requires extraction of features darkest regions of the image and remove most of the
pertaining to cracks. The features used for crack background components (Zhang et al. 2014b). The
detection are ratio of major to minor axis and number appropriate choice of the structuring element will
of pixels. The ratio of major to minor axis for a enhance the results. Generally, the shape of the struc-
typical crack is a large value. The input image is turing element is chosen as close as possible to the
given to the two-layer feed- forward network to shape that is to be highlighted. Hence, a rectangular
perform crack classification in MATLAB (Matrix structural element is used. If the size of this element is
Laboratory Simulation Tool). It is trained using scaled too small, it takes a longer time to completely traverse
conjugate gradient back propaga- tion. Data for the image thereby reducing its efficiency and can
classification is organised into the input matrix X and bring up more noise elements. When larger, the
the target matrix T. Here, a selection of 15 neurons desired regions are found to be thicker but can miss
was able to provide good results. Half of the samples out on some small-sized cracks. Here, a size of 15 ×
are used for training and remaining part for testing 15 is found suitable to meet the desired requirements
and validation. Its performance is moni- tored using of highlighting the crack region as a clear output
cross entropy and confusion matrices. The final image. The operation can be depicted by the
output is obtained after the phases of training, testing Equations (3) &
and prediction. (4) as follows.
A_ = A ● B = (A + B) — B (3)
3.2.Morphological processing algorithm
The advantage of morphological image processing for Anew= A_ — —A (4)
crack detection is that even the thinnest of cracks can Here A, A_ , Anew are the original, closed and output
be detected and magnified so that it can be easily images, respectively, and B is the structuring element.
treated. + and– represent dilation and erosion operations
Erosion: The structuring element is moved over the respectively.{\displaystyle\ominus} =
entire image. If even one pixel of the structuring ele- (2) Thresholding: The image thresholding is per-
ment overlaps with the background, then the centre formed using Otsu’s method (Yang et al. 2012). This
48 A. NAIR ET
AL.
Image Acquisition
Gray Scaling
Gaussian Blur
Otsu Thresholding
Noise Removal
Figure 6. Morphological algorithm flow diagram.
method involves selecting a particular threshold and connected and seem isolated, they can easily be
checking the number of pixels on either side. The aim removed as they behave as noise components.
is to find the threshold value where the sum of fore-
ground and background spreads is at its minimum. It
is suitable for images with a bimodal histogram dis- 4. Performance evaluation
tribution. This helps to clearly visualise the crack
regions but along with it, a number of salt noises can Dice: Dice is the ratio of twice the intersection
also occur. between the segmentation image and the ground truth
to its summation. Equation (5) shows the formula for
(3) Noise Removal: The final image can be
the Dice metric (Umeha, Hemalatha, and Radha
obtained by removing all the noise components.
2018).
Removal of isolated or sparsely distributed pixels will
effectively remove the noise, which requires the 2(A ∩B)
Dice (5)
knowledge of pixel connectivity. The image is =
A+B
segmented into its constituent components. When
where A is the segmented image and B is the ground
pixels are hardly
truth.
AUSTRALIAN JOURNAL OF ELECTRICAL AND ELECTRONICS ENGINEERING 49
1 y 1
where h and w are the height and the width of the A complete crack detection and estimation model can
binary map, respectively, and ϕFM is the enhanced be implemented using a Raspberry pi (RPi) setup. The
alignment matrix (Fan et al. 2018). monitoring system consists of an RPi and the Pi
These provide a measure of closeness of output camera (PiCam). The web server is hosted by the RPi
image from the neural network with the ground and can be accessed by the user on any device by
truth image, which can otherwise be termed as accu- connecting to its IP address. A python program is
racy of classification. used to implement morphological image processing
algorithm to process the images. The image of cracks
can be uploaded from the device or it can be taken
4.1.Pattern classification algorithm remotely using the RPi and uploaded to the server.
Crack detection has been performed using pattern The PiCam is also used to perform live streaming to
classification method and various experimental get a real-time view of the inspected structure. The
results are obtained. Figure 7 shows a portion of inputs as well as processed images are displayed on
images used in evaluating the system the web server which is acces- sible from any device
performance. connected to the internet.
From Figure.7 it is clear that superior results The Web server setup comprises of the following:
are obtained using the classification algorithm. (1) Web Server: Web Server is an integral part of
Large numbers of false positives are observed in the system being designed. A web server on RPi can be
the LDP (Local Directional Pattern) based imple- used to host a full website, or just used to display some.
mentation output and heavier noise corruption is A Web server can be accessed through the RPi
evident. Based on comparison with the ground remotely through a laptop by using SSH (Secure Shell).
truth image, the Dice, Jaccard and E-measure It is a cryptographic network protocol that ensures
metrics and the accuracy of the classification are secure data transfer between computer and RPi.
calculated and provided in Table 1. Apache is a popular web server, which is a program
From the pattern classification method of crack that listens for server access requests from Internet
detec- browsers and grants them if per- mitted. The web
tion, fairly good results are obtained with reasonable
servers can be accessed using its IP address.
accuracy. The primary advantage of this method is
(2) Internet Framework: Python is used to deploy
that it is suitable for detection of even a large number
the web server on the RPi. The bottle web framework
of cracks on the surface of the specimen with better
architecture is used to make and enable web requests.
accu- racy when compared to (Zhang et al. 2014a).
It is a simple and lightweight structure which comes
Also it enables a very low percentage of false-positive
with inbuilt servers and can be used to perform var-
detection. However, the disadvantage is that minute
ious routing functions.
cracks might not be detected with good accuracy. The
proposed algo- rithm is implemented in the on-board (3) Live Streaming: The RPi camera can be used to
processor with lesser complexity. scan the civil structure and the live video can be
accessed using any device by connecting to the RPi.
50 A. NAIR ET
AL.
Figure 7. A) Input Images b) LDP-based segmentation output c) Proposed classification algorithm-based segmentation output.
AUSTRALIAN JOURNAL OF ELECTRICAL AND ELECTRONICS ENGINEERING 51
Figure 8. (a) Input Images (b) LDP-based segmentation output (c) Morphological processing algorithm-based segmentation
output.
52 A. NAIR ET
AL.
Figure 9. (a) Original greyscale image (b) Output after morphological processing (c) Output after noise reduction.
Figure 10. Experimental Setup of RPi with (a) PiCam and (b) an LCD Display.
From the live video, one can capture photos instantly user. This image is sent to the web server for proces-
and then use these photos for processing. sing. The captured image as well as the processed
image is displayed as output on the web server. The
morpho- logical processing algorithm has been
5.1.Real-time implementation
implemented in Python in the RPi
The experimental setup consists of RPi and PiCam. (https://www.raspberrypi.org). The experimental
This setup can be placed on any civil structure for setup is done as shown in Figure 10.
continuous monitoring of the structure. The PiCam Sample of the web pages is shown in Figure 11.
can be used to take images whenever desired by the The upload page asks the user to upload the image to
be processed or the PiCam can be used. The
database
AUSTRALIAN JOURNAL OF ELECTRICAL AND ELECTRONICS ENGINEERING 53
Also it provides the accuracy of crack detection. repaired. Such quantitative parameters obtained make
Thus, once all the parameters are obtained one has it easier to ensure a cost-effective treatment of the
to take a decision on when the structure becomes affected structure.
ready to be
AUSTRALIAN JOURNAL OF ELECTRICAL AND ELECTRONICS ENGINEERING 55