Impact of traditional and embedded image denoising on CNN-based deep learning
- Authors: Kaur, Roopdeep , Karmakar, Gour , Imran, Muhammad
- Date: 2023
- Type: Text , Journal article
- Relation: Applied sciences Vol. 13, no. 20 (2023), p.
- Full Text:
- Reviewed:
- Description: In digital image processing, filtering noise is an important step for reconstructing a high-quality image for further processing such as object segmentation, object detection, and object recognition. Various image-denoising approaches, including median, Gaussian, and bilateral filters, are available in the literature. Since convolutional neural networks (CNN) are able to directly learn complex patterns and features from data, they have become a popular choice for image-denoising tasks. As a result of their ability to learn and adapt to various denoising scenarios, CNNs are powerful tools for image denoising. Some deep learning techniques such as CNN incorporate denoising strategies directly into the CNN model layers. A primary limitation of these methods is their necessity to resize images to a consistent size. This resizing can result in a loss of vital image details, which might compromise CNN’s effectiveness. Because of this issue, we utilize a traditional denoising method as a preliminary step for noise reduction before applying CNN. To our knowledge, a comparative performance study of CNN using traditional and embedded denoising against a baseline approach (without denoising) is yet to be performed. To analyze the impact of denoising on the CNN performance, in this paper, firstly, we filter the noise from the images using traditional means of denoising method before their use in the CNN model. Secondly, we embed a denoising layer in the CNN model. To validate the performance of image denoising, we performed extensive experiments for both traffic sign and object recognition datasets. To decide whether denoising will be adopted and to decide on the type of filter to be used, we also present an approach exploiting the peak-signal-to-noise-ratio (PSNRs) distribution of images. Both CNN accuracy and PSNRs distribution are used to evaluate the effectiveness of the denoising approaches. As expected, the results vary with the type of filter, impact, and dataset used in both traditional and embedded denoising approaches. However, traditional denoising shows better accuracy, while embedded denoising shows lower computational time for most of the cases. Overall, this comparative study gives insights into whether denoising will be adopted in various CNN-based image analyses, including autonomous driving, animal detection, and facial recognition.
Algorithm development for the non-destructive testing of structural damage
- Authors: Noori Hoshyar, Azadeh , Rashidi, Maria , Liyanapathirana, Ranjith , Samali, Bijan
- Date: 2019
- Type: Text , Journal article
- Relation: Applied sciences Vol. 9, no. 14 (2019), p. 2810
- Full Text:
- Reviewed:
- Description: Monitoring of structures to identify types of damages that occur under loading is essential in practical applications of civil infrastructure. In this paper, we detect and visualize damage based on several non-destructive testing (NDT) methods. A machine learning (ML) approach based on the Support Vector Machine (SVM) method is developed to prevent misdirection of the event interpretation of what is happening in the material. The objective is to identify cracks in the early stages, to reduce the risk of failure in structures. Theoretical and experimental analyses are derived by computing the performance indicators on the smart aggregate (SA)-based sensor data for concrete and reinforced-concrete (RC) beams. Validity assessment of the proposed indices was addressed through a comparative analysis with traditional SVM. The developed ML algorithms are shown to recognize cracks with a higher accuracy than the traditional SVM. Additionally, we propose different algorithms for microwave- or millimeter-wave imaging of steel plates, composite materials, and metal plates, to identify and visualize cracks. The proposed algorithm for steel plates is based on the gradient magnitude in four directions of an image, and is followed by the edge detection technique. Three algorithms were proposed for each of composite materials and metal plates, and are based on 2D fast Fourier transform (FFT) and hybrid fuzzy c-mean techniques, respectively. The proposed algorithms were able to recognize and visualize the cracking incurred in the structure more efficiently than the traditional techniques. The reported results are expected to be beneficial for NDT-based applications, particularly in civil engineering.
A convolutional recursive modified Self Organizing Map for handwritten digits recognition
- Authors: Mohebi, Ehsan , Bagirov, Adil
- Date: 2014
- Type: Text , Journal article
- Relation: Neural Networks Vol. 60, no. (2014), p. 104-118
- Relation: http://purl.org/au-research/grants/arc/DP140103213
- Full Text: false
- Reviewed:
- Description: It is well known that the handwritten digits recognition is a challenging problem. Different classification algorithms have been applied to solve it. Among them, the Self Organizing Maps (SOM) produced promising results. In this paper, first we introduce a Modified SOM for the vector quantization problem with improved initialization process and topology preservation. Then we develop a Convolutional Recursive Modified SOM and apply it to the problem of handwritten digits recognition. The computational results obtained using the well known MNIST dataset demonstrate the superiority of the proposed algorithm over the existing SOM-based algorithms.
Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
- Authors: Bagirov, Adil , Ugon, Julien , Mirzayeva, Hijran
- Date: 2013
- Type: Text , Journal article
- Relation: European Journal of Operational Research Vol. 229, no. 1 (2013), p. 132-142
- Full Text: false
- Reviewed:
- Description: Clusterwise regression consists of finding a number of regression functions each approximating a subset of the data. In this paper, a new approach for solving the clusterwise linear regression problems is proposed based on a nonsmooth nonconvex formulation. We present an algorithm for minimizing this nonsmooth nonconvex function. This algorithm incrementally divides the whole data set into groups which can be easily approximated by one linear regression function. A special procedure is introduced to generate a good starting point for solving global optimization problems at each iteration of the incremental algorithm. Such an approach allows one to find global or near global solution to the problem when the data sets are sufficiently dense. The algorithm is compared with the multistart Späth algorithm on several publicly available data sets for regression analysis. © 2013 Elsevier B.V. All rights reserved.
- Description: 2003011018