Many optimization problems have become increasingly complex, which promotes researches on the improvement of different optimization algorithms. The monarch butterfly optimization (MBO) algorithm has proven to be an effective tool to solve various kinds of optimization problems. However, in the basic MBO algorithm, the search strategy easily falls into local optima, causing premature convergence and poor performance on many complex optimization problems. To solve the issues, this paper develops a novel MBO algorithm based on opposition‐based learning (OBL) and random local perturbation (RLP). Firstly, the OBL method is introduced to generate the opposition‐based population coming from the original population. By comparing the opposition‐based population with the original population, the better individuals are selected and pass to the next generation, and then this process can efficiently prevent the MBO from falling into a local optimum. Secondly, a new RLP is defined and introduced to improve the migration operator. This operation shares the information of excellent individuals and is helpful for guiding some poor individuals toward the optimal solution. A greedy strategy is employed to replace the elitist strategy to eliminate setting the elitist parameter in the basic MBO, and it can reduce a sorting operation and enhance the computational efficiency. Finally, an OBL and RLP‐based improved MBO (OPMBO) algorithm with its complexity analysis is developed, following on which many experiments on a series of different dimensional benchmark functions are performed and the OPMBO is applied to clustering optimization on several public data sets. Experimental results demonstrate that the proposed algorithm can achieve the great optimization performance compared with a few state‐of‐the‐art algorithms in most of the test cases.
Inhomogeneous images cannot be segmented quickly or accurately using local or global image information. To solve this problem, an image segmentation method using a novel active contour model that is based on an improved signed pressure force (SPF) function and a local image fitting (LIF) model is proposed in this paper, which is based on local and global image information. First, a weight function of the global grayscale means of the inside and outside of a contour curve is presented by combining the internal gray mean value with the external gray mean value, based on which a new SPF function is defined. The SPF function can segment blurred images and weak gradient images. Then, the LIF model is introduced by using local image information to segment intensity-inhomogeneous images. Subsequently, a weight function is established based on the local and global image information, and then the weight function is used to adjust the weights between the local information term and the global information term. Thus, a novel active contour model is presented, and an improved SPF- and LIF-based image segmentation (SPFLIF-IS) algorithm is developed based on that model. Experimental results show that the proposed method not only exhibits high robustness to the initial contour and noise but also effectively segments multiobjective images and images with intensity inhomogeneity and can analyze real images well.
Deep learning (DL) has been widely used in biomedical image segmentation and automatic disease diagnosis, leading to state-of-the-art performance. However, automated cardiac disease diagnosis heavily relies on cardiac segmentation maps from cardiac magnetic resonance (CMR), most current DL segmentation methods, such as 2D convolution on planes, 3D convolution, are not fully applicable to CMR due to loss of spatial structure information or large gap between slices. To make better exploit spatial aspects of the CMR data to improve cardiac segmentation accuracy, we propose a new DL segmentation structure, which consists of a residual convolution neural network for compressing the intra-slice information, and a bidirectional-convolutional long short term memory (Bi-CLSTM) for leveraging the inter-slice contexts. Moreover, automatic disease diagnosis has been conducted using the segmentation maps. Experimental results of the automatic cardiac diagnosis challenge (ACDC) show that our cardiac segmentation structure and disease diagnosis methods have achieved promising results and it can be widely extended to computer-aided diagnosis.
This paper proposes a vessel active contour model based on local intensity weighting and a vessel vector field. Firstly, the energy function we define is evaluated along the evolving curve instead of all image points, and the function value at each point on the curve is based on the interior and exterior weighted means in a local neighborhood of the point, which is good for dealing with the intensity inhomogeneity. Secondly, a vascular vector field derived from a vesselness measure is employed to guide the contour to evolve along the vessel central skeleton into thin and weak vessels. Thirdly, an automatic initialization method that makes the model converge rapidly is developed, and it avoids repeated trails in conventional local region active contour models. Finally, a speed-up strategy is implemented by labeling the steadily evolved points, and it avoids the repeated computation of these points in the subsequent iterations. Experiments using synthetic and real vessel images validate the proposed model. Comparisons with the localized active contour model, local binary fitting model, and vascular active contour model show that the proposed model is more accurate, efficient, and suitable for extraction of the vessel tree from different medical images.