IET Image Processing (Aug 2022)

Morphological geodesic active contour algorithm for the segmentation of the histogram‐equalized welding bead image edges

  • John N. Mlyahilu,
  • Joseph N. Mlyahilu,
  • Jae Eun Lee,
  • Young Bong Kim,
  • Jong Nam Kim

DOI
https://doi.org/10.1049/ipr2.12517
Journal volume & issue
Vol. 16, no. 10
pp. 2680 – 2696

Abstract

Read online

Abstract Assessment and evaluation are the essential processes of industrially manufactured products for the determination of the quality and quantity of products. They give justifications in a practical way about whether the machine is perfect or imperfect, which can lead to a better or poorer production. In this study, the authors propose an algorithm that uses morphological geodesic active contour and image processing techniques to perform segmentation and assess the performance of a robot used to manufacture welding beads. The algorithm has four parameters which are pre‐processed images, balloon force, smoothing parameter, and number of iterations. To pre‐process the images, the algorithm uses an inverse Gaussian gradient operator for edge detection and applies the histogram equalization method to level the distribution. To detect the external contour of the bead, the level set is initialized as the region of interest whereby a balloon force can inflate or deflate towards the edges. To smoothen the contour, a smoothing parameter is applied to convert the jagged lines into a curve over a reasonable number of iterations. Based on the experimental results, the authors’ algorithm used a fixed balloon force of −2, a smoothing parameter value of 4, and 40 iterations to segment images obtained from three different environments. The computation time for the segmentation and evaluation of one image was 0.70, 0.61, and 0.67 s for datasets with high brightness, low brightness, and normal brightness, respectively. Additionally, the authors’ proposed algorithm achieved an outstanding performance of 0.9954, 0.9843, 0.9892, and 0.9435 in terms of recall, precision, F‐measure, and IOU, respectively. To justify the performance of the authors’ proposed algorithm, the authors compared it with the existing algorithms and found that it worked better than all the others for segmentation, although it lagged behind the entropy‐based algorithm in terms of speed.