A novel approach for detection and delineation of cell nuclei using feature similarity index measure

Discrete protein metric (DPM): A new image similarity metric to calculate accuracy of deep learning-generated cell focal adhesion predictions

Understanding cell behaviors can provide new knowledge on the development of different pathologies. Focal adhesion (FA) sites are important sub-cellular structures that are involved in these processes. To better facilitate the study of FA sites, deep learning (DL) can be used to predict FA site morphology based on limited microscopic datasets (e.g., cell membrane images). However, calculating the accuracy score of these predictions can be challenging due to the discrete/point pattern like nature of FA sites. In the present work, a new image similarity metric, discrete protein metric (DPM), was developed to calculate FA prediction accuracy. This metric measures differences in distribution (d), shape/size (s), and angle (a) of FA sites between predicted and ground truth microscopy images. Performance of the DPM was evaluated by comparing it to three other commonly used image similarity metrics: Pearson correlation coefficient (PCC), feature similarity index (FSIM), and Intersection over Union (IoU). A sensitivity analysis was performed by comparing changes in each metric value due to quantifiable changes in FA site location, number, aspect ratio, area, or orientation. Furthermore, accuracy score of DL-generated predictions was calculated using all four metrics to compare their ability to capture variation across samples. Results showed better sensitivity and range of variation for DPM compared to the other metrics tested. Most importantly, DPM had the ability to determine which FA predictions were quantitatively more accurate and consistent with qualitative assessments. The proposed DPM hence provides a method to validate DL-generated FA predictions and has the potential to be used for investigation of other sub-cellular protein aggregates relevant to cell biology.

Multilevel thresholding using a modified ant lion optimizer with opposition-based learning for color image segmentation

Multilevel thresholding has important research value in image segmentation and can effectively solve region analysis problems of complex images. In this paper, Otsu and Kapur's entropy are adopted among thresholding segmentation methods. They are used as the objective functions. When the number of threshold increases, the time complexity increases exponentially. In order to overcome this drawback, a modified ant lion optimizer algorithm based on opposition-based learning (MALO) is proposed to determine the optimum threshold values by the maximization of the objective functions. By introducing the opposition-based learning strategy, the search accuracy and convergence performance are increased. In addition to IEEE CEC 2017 benchmark functions validation, 11 state-of-the-art algorithms are selected for comparison. A series of experiments are conducted to evaluate the segmentation performance of the algorithm. The evaluation metrics include: fitness value, peak signal-to-noise ratio, structural similarity index, feature similarity index, and computational time. The experimental data are analyzed and discussed in details. The experimental results significantly demonstrate that the proposed method is superior over others, which can be considered as a powerful and efficient thresholding technique.

Dragonfly Algorithm with Opposition-Based Learning for Multilevel Thresholding Color Image Segmentation

Multilevel thresholding is a very active research field in image segmentation, and has been successfully used in various applications. However, the computational time will increase exponentially as the number of thresholds increases, and for color images which contain more information this is even worse. To overcome the drawback while maintaining segmentation accuracy, a modified version of dragonfly algorithm (DA) with opposition-based learning (OBLDA) for color image segmentation is proposed in this paper. The opposition-based learning (OBL) strategy simultaneously considers the current solution and the opposite solution, which are symmetrical in the search space. With the introduction of OBL, the proposed algorithm has a faster convergence speed and more balanced exploration–exploitation compared with the original DA. In order to clearly demonstrate the outstanding performance of the OBLDA, the proposed method is compared with seven state-of-the-art meta-heuristic algorithms, through experiments on 10 test images. The optimal threshold values are calculated by the maximization of between-class variance and Kapur’s entropy. Meanwhile, some indicators, including peak signal to noise ratio (PSNR), feature similarity index (FSIM), structure similarity index (SSIM), the average fitness values, standard deviation (STD), and computation time are used as evaluation criteria in the experiments. The promising results reveal that proposed method has the advantages of high accuracy and remarkable stability. Wilcoxon’s rank sum test and Friedman test are also performed to verify the superiority of OBLDA in a statistical way. Furthermore, various satellite images are also included for robustness testing. In conclusion, the OBLDA algorithm is a feasible and effective method for multilevel thresholding color image segmentation.

Kapur's Entropy for Color Image Segmentation Based on a Hybrid Whale Optimization Algorithm

In this paper, a new hybrid whale optimization algorithm (WOA) called WOA-DE is proposed to better balance the exploitation and exploration phases of optimization. Differential evolution (DE) is adopted as a local search strategy with the purpose of enhancing exploitation capability. The WOA-DE algorithm is then utilized to solve the problem of multilevel color image segmentation that can be considered as a challenging optimization task. Kapur's entropy is used to obtain an efficient image segmentation method. In order to evaluate the performance of proposed algorithm, different images are selected for experiments, including natural images, satellite images and magnetic resonance (MR) images. The experimental results are compared with state-of-the-art meta-heuristic algorithms as well as conventional approaches. Several performance measures have been used such as average fitness values, standard deviation (STD), peak signal to noise ratio (PSNR), structural similarity index (SSIM), feature similarity index (FSIM), Wilcoxon's rank sum test, and Friedman test. The experimental results indicate that the WOA-DE algorithm is superior to the other meta-heuristic algorithms. In addition, to show the effectiveness of the proposed technique, the Otsu method is used for comparison.