Fractional Rényi Entropy Image Enhancement for Deep Segmentation of Kidney MRI

Recently,many rapid developments in digital medical imaging have made further contributions to health care systems.The segmentation of regions of interest in medical images plays a vital role in assisting doctors with their medical diagnoses.Many factors like image contrast and quality affect the result of image segmentation.Due to that,image contrast remains a challenging problem for image segmentation.This study presents a new image enhancement model based on fractional Rényi entropy for the segmentation of kidney MRI scans.The proposed work consists of two stages:enhancement by fractional Rényi entropy,and MRI Kidney deep segmentation.The proposed enhancement model exploits the pixel’s probability representations for image enhancement.Since fractional Rényi entropy involves fractional calculus that has the ability to model the non-linear complexity problem to preserve the spatial relationship between pixels,yielding an overall better details of the kidney MRI scans.In the second stage,the deep learning kidney segmentation model is designed to segment kidney regions in MRI scans.The experimental results showed an average of 95.60%dice similarity index coefficient,which indicates best overlap between the segmented bodies with the ground truth.It is therefore concluded that the proposed enhancement model is suitable and effective for improving the kidney segmentation performance.

Completed attention convolutional neural network for MRI image segmentation

Attention mechanism combined with convolutional neural network(CNN) achieves promising performance for magnetic resonance imaging(MRI) image segmentation,however these methods only learn attention weights from single scale,resulting in incomplete attention learning.A novel method named completed attention convolutional neural network(CACNN) is proposed for MRI image segmentation.Specifically,the channel-wise attention block(CWAB) and the pixel-wise attention block(PWAB) are designed to learn attention weights from the aspects of channel and pixel levels.As a result,completed attention weights are obtained,which is beneficial to discriminative feature learning.The method is verified on two widely used datasets(HVSMR and MRBrainS),and the experimental results demonstrate that the proposed method achieves better results than the state-of-theart methods.

Extracting Eye Models from MRI Scans Using U-Net-Based Deep Learning Framework

.Abstracting eye models from MRI images is critical in advancing medical imaging, particularly for clinical diagnostics. Current methods often struggle with accuracy and efficiency, highlighting a gap this research aims to fill. This study investigates the application of machine learning methods, focusing on the U-net-based deep learning framework, to improve the accuracy of eye model extraction. The objectives include fitting measured eye data to models such as the Ellipsoid model, evaluating automated segmentation tools, and assessing the usability of machine learning-based extractions in clinical scenarios. We employed point cloud data of 202,872 points to fit eye models using ellipsoid, non-linear, and spherical fitting techniques. The fitting processes were optimized to ensure precision and reliability. We compared the performance of these models using mean squared error (MSE) as the primary metric. The non-linear model emerged as the most accurate, with a significantly lower MSE (1.186562) compared to the ellipsoid (781.0542) and spherical models. This finding indicates that the non-linear model provides a more detailed and precise representation of the eye’s geometry. These results suggest that machine learning methods, particularly non-linear models, can significantly enhance the accuracy and usability of eye model extraction in clinical diagnostics, offering a robust framework for future advancements in medical imaging.

A Survey of MRI-Based Brain Tumor Segmentation Methods

Brain tumor segmentation aims to separate the different tumor tissues such as active cells, necrotic core,and edema from normal brain tissues of White Matter（WM）, Gray Matter（GM）, and Cerebrospinal Fluid（CSF）. MRIbased brain tumor segmentation studies are attracting more and more attention in recent years due to non-invasive imaging and good soft tissue contrast of Magnetic Resonance Imaging（MRI） images. With the development of almost two decades, the innovative approaches applying computer-aided techniques for segmenting brain tumor are becoming more and more mature and coming closer to routine clinical applications. The purpose of this paper is to provide a comprehensive overview for MRI-based brain tumor segmentation methods. Firstly, a brief introduction to brain tumors and imaging modalities of brain tumors is given. Then, the preprocessing operations and the state of the art methods of MRI-based brain tumor segmentation are introduced. Moreover, the evaluation and validation of the results of MRI-based brain tumor segmentation are discussed. Finally, an objective assessment is presented and future developments and trends are addressed for MRI-based brain tumor segmentation methods.

Based on rough set and fuzzy clustering of MRI brain segmentation

A new method of MRI brain segmentation integrates fuzzy c-means （FCM） clustering and rough set theory. In this paper, we use rough set algorithm to find the suitable initial clustering number to initial clustering centers for FCM. Then we use FCM to MRI brain segmentation, but the algorithm of FCM has the limitation of converging to local infinitesimal point in medical segmentation. While avoiding being trapped in a local optimum, we use the particle swarm optimization algorithm to restrict convergence of FCM which can reduce calculation. The final experiment results show that improved algorithm not only retains the advantages of rapid convergence but also can control the local convergence and improve the global search ability. The method in this paper is better than that of cluttering performance.

MINIMUM ATTRIBUTE CO-REDUCTION ALGORITHM BASED ON MULTILEVEL EVOLUTIONARY TREE WITH SELF-ADAPTIVE SUBPOPULATIONS

Attribute reduction is an important process in rough set theory.Finding minimum attribute reduction has been proven to help the user-oriented make better knowledge discovery in some cases.In this paper,an efficient minimum attribute reduction algorithm is proposed based on the multilevel evolutionary tree with self-adaptive subpopulations.A model of multilevel evolutionary tree with self-adaptive subpopulations is constructed,and interacting attribute sets are better decomposed into subsets by the self-adaptive mechanism of elitist populations.Moreover it can self-adapt the subpopulation sizes according to the historical performance record so that interacting attribute decision variables are captured into the same grouped subpopulation,which will be extended to better performance in both quality of solution and competitive computation complexity for minimum attribute reduction.The conducted experiments show the proposed algorithm is better on both efficiency and accuracy of minimum attribute reduction than some representative algorithms.Finally the proposed algorithm is applied to magnetic resonance image(MRI)segmentation,and its stronger applicability is further demonstrated by the effective and robust segmentation results.

MRI image segmentation based on fast kernel clustering analysis

Kernel-based clustering is supposed to provide a better analysis tool for pattern classification,which implicitly maps input samples to a highdimensional space for improving pattern separability.For this implicit space map,the kernel trick is believed to elegantly tackle the problem of“curse of dimensionality”,which has actually been more challenging for kernel-based clustering in terms of computational complexity and classification accuracy,which traditional kernelized algorithms cannot effectively deal with.In this paper,we propose a novel kernel clustering algorithm,called KFCM-III,for this problem by replacing the traditional isotropic Gaussian kernel with the anisotropic kernel formulated by Mahalanobis distance.Moreover,a reduced-set represented kernelized center has been employed for reducing the computational complexity of KFCM-I algorithm and circumventing the model deficiency of KFCM-II algorithm.The proposed KFCMIII has been evaluated for segmenting magnetic resonance imaging(MRI)images.For this task,an image intensity inhomogeneity correction is employed during image segmentation process.With a scheme called preclassification,the proposed intensity correction scheme could further speed up image segmentation.The experimental results on public image data show the superiorities of KFCM-III.