Levy Flight and Chaos Theory-Based Gravitational Search Algorithm for Image Segmentation

Abstract

Image segmentation is one of the pivotal steps in image processing due to its enormous application potential in medical image analysis, data mining, and pattern recognition. In fact, image segmentation is the process of splitting an image into multiple parts in order to provide detailed information on different aspects of the image. Traditional image segmentation techniques suffer from local minima and premature convergence issues when exploring complex search spaces. Additionally, these techniques also take considerable runtime to find the optimal pixels as the threshold levels are increased. Therefore, in order to overcome the computational overhead and convergence problems of the multilevel thresholding process, a robust optimizer, namely the Levy flight and Chaos theory-based Gravitational Search Algorithm (LCGSA), is employed to perform the segmentation of the COVID-19 chest CT scan images. In LCGSA, exploration is carried out by Levy flight, while chaotic maps guarantee the exploitation of the search space. Meanwhile, Kapur’s entropy method is utilized for segmenting the image into various regions based on the pixel intensity values. To investigate the segmentation performance of ten chaotic versions of LCGSA, firstly, several benchmark images from the USC-SIPI database are considered for the numerical analysis. Secondly, the applicability of LCGSA for solving real-world image processing problems is examined by using various COVID-19 chest CT scan imaging datasets from the Kaggle database. Further, an ablation study is carried out on different chest CT scan images by considering ground truth images. Moreover, various qualitative and quantitative metrics are used for the performance evaluation. The overall analysis of the experimental results indicated the efficient performance of LCGSA over other peer algorithms in terms of taking less computational time and providing optimal values for image quality metrics.