The automatic segmentation of blood cells for detecting hematological disorders is a crucial job. It has a vital role in diagnosis, treatment planning, and output evaluation. The existing methods suffer from the issues like noise, improper seed-point detection, and oversegmentation problems, which are solved here using a Laplacian-of-Gaussian (LoG)-based modified highboosting operation, bounded opening followed by fast radial symmetry (BOFRS)-based seed-point detection, and hybrid ellipse fitting (EF), respectively. This article proposes a novel hybrid EF-based blood-cell segmentation approach, which may be used for detecting various hematological disorders. Our prime contributions are: 1) more accurate seed-point detection based on BO-FRS; 2) a novel least-squares (LS)-based geometric EF approach; and 3) an improved segmentation performance by employing a hybridized version of geometric and algebraic EF techniques retaining the benefits of both approaches. It is a computationally efficient approach since it hybridizes noniterative-geometric and algebraic methods. Moreover, we propose to estimate the minor and major axes based on the residue and residue offset factors. The residue offset parameter, proposed here, yields more accurate segmentation with proper EF. Our method is compared with the state-of-the-art methods. It outperforms the existing EF techniques in terms of dice similarity, Jaccard score, precision, and F1 score. It may be useful for other medical and cybernetics applications.

The fuzzy C -means (FCM) clustering procedure is an unsupervised form of grouping the homogenous pixels of an image in the feature space into clusters. A brain magnetic resonance (MR) image is affected by noise and intensity inhomogeneity (IIH) during the acquisition process. FCM has been used in MR brain tissue segmentation. However, it does not consider the neighboring pixels for computing the membership values, thereby misclassifying the noisy pixels. The inaccurate cluster centers obtained in FCM do not address the problem of IIH. A fixed value of the fuzzifier ( m ) used in FCM brings uncertainty in controlling the fuzziness of the extracted clusters. To resolve these issues, we suggest a novel type-2 adaptive weighted spatial FCM (AWSFCM) clustering algorithm for MR brain tissue segmentation. The idea of type-2 FCM applied to the problem on hand is new and is reported in this article. The application of the proposed technique to the problem of MR brain tissue segmentation replaces the fixed fuzzifier value with a fuzzy linguistic fuzzifier value ( M ). The introduction of the spatial information in the membership function reduces the misclassification of noisy pixels. Furthermore, the incorporation of adaptive weights into the cluster center update function improves the accuracy of the final cluster centers, thereby reducing the effect of IIH. The suggested algorithm is evaluated using T1-w, T2-w, and proton density (PD) brain MR image slices. The performance is justified in terms of qualitative and quantitative measures followed by statistical analysis. The outcomes demonstrate the superiority and robustness of the algorithm in comparison to the state-of-the-art methods. This article is useful for the cybernetics application.

Bias field correction is an essential pre‐processing requirement for brain tissue segmentation task. Authentic brain tissue regions are highly useful for classification and detection of abnormalities. A poor resolution magnetic resonance (MR) image is produced with irregularities in structure, abnormalities in the intensity distribution and noise during the acquisition procedure. The existing bias field correction methods do not consider the spatial information. Further, the problem of equidistant pixels while clustering is not addressed. These problems lead to poor segmentation accuracy. To solve these problems, the authors suggest a novel biased fuzzy clustering technique for the problem on hand. The basic idea is to incorporate the spatial information by altering the membership matrix of standard fuzzy C‐means clustering to lower the effect of noise and intensity inhomogeneity. It also helps in improving the segmentation accuracies of the tissue regions by assigning the equidistant pixels to a single cluster. The suggested technique is validated with different modalities of brain MR images. Various evaluation indices are computed followed by the statistical analysis to justify the superiority of the suggested technique in comparison to the state‐of‐the‐art methods.

In the normal image thresholding methods based on two-dimensional histogram, the edge information of the regions is not maintained because of the local averaging activity used. Moreover, the computation time increases with the increase in the level of thresholds. This paper focusses on retaining more edge information by calculating the image entropy along the diagonal regions of the gray level co-occurrence matrix inspired from the partitioned design structure matrix, which is a novel idea. In addition, the key to our success is the theoretical investigation of a novel diagonal class entropy (DCE) concept that utilizes the minimum area for computation. The benefits of the proposed method are: 1) improved results; 2) efficient to preserve more precise shape of the edges; and 3) the computation time decreases with the increase in the threshold levels. The optimal thresholds are obtained by minimizing the DCE using coral reef optimization (CRO). A first hand fitness function for multilevel image thresholding is derived. The fight for space and the efficient reproduction characteristics of the CRO makes it attractive for this application. Benchmark images from the Berkley segmentation dataset are taken to experiment. Our results are compared with other state-of-the-art thresholding methods. The results obtained are encouraging and may set the path for further investigation in the domain of multilevel thresholding.

This paper presents a method for design of two dimensional (2-D) recursive filters using bacteria foraging optimization (BFO) technique. The design of 2-D recursive filter is considered as a constrained optimization problem. The solution is obtained through the convergence of a biased random search using BFO. With the help of numerical illustrations, we present the theoretical results. Comparison with the results of earlier methods is made.