scholarly journals Comparative Testing of DNA Segmentation Algorithms Using Benchmark Simulations

2009 ◽  
Vol 27 (5) ◽  
pp. 1015-1024 ◽  
Author(s):  
Eran Elhaik ◽  
Dan Graur ◽  
Krešimir Josić
Keyword(s):  
Comparative Testing ◽  
Segmentation Algorithms ◽  
Dna Segmentation

Comparative testing of subunit, adjuvanted, whole-virion inactivated and live influenza vaccines against homologous and heterosubtypic challenge

2014 ◽  
Vol 18 (1) ◽  
Author(s):  
A. S. Gambaryan ◽  
◽  
E. Y. Boravleva ◽  
N. V. Bykova ◽  
A. P. Kaplun ◽  
...  
Keyword(s):  
Influenza Vaccines ◽  
Comparative Testing

Integrating Improved U-Net and Continuous Maximum Flow Algorithm for 3D Brain Tumor Image Segmentation

2020 ◽  
Vol 64 (4) ◽  
pp. 40412-1-40412-11
Author(s):  
Kexin Bai ◽  
Qiang Li ◽  
Ching-Hsin Wang
Keyword(s):  
Brain Tumor ◽  
Data Augmentation ◽  
A Priori ◽  
Class Imbalance ◽  
Maximum Flow ◽  
Magnetic Resonance Images ◽  
Tumor Segmentation ◽  
Similarity Coefficients ◽  
Segmentation Algorithms ◽  
Flow Algorithm

Abstract To address the issues of the relatively small size of brain tumor image datasets, severe class imbalance, and low precision in existing segmentation algorithms for brain tumor images, this study proposes a two-stage segmentation algorithm integrating convolutional neural networks (CNNs) and conventional methods. Four modalities of the original magnetic resonance images were first preprocessed separately. Next, preliminary segmentation was performed using an improved U-Net CNN containing deep monitoring, residual structures, dense connection structures, and dense skip connections. The authors adopted a multiclass Dice loss function to deal with class imbalance and successfully prevented overfitting using data augmentation. The preliminary segmentation results subsequently served as the a priori knowledge for a continuous maximum flow algorithm for fine segmentation of target edges. Experiments revealed that the mean Dice similarity coefficients of the proposed algorithm in whole tumor, tumor core, and enhancing tumor segmentation were 0.9072, 0.8578, and 0.7837, respectively. The proposed algorithm presents higher accuracy and better stability in comparison with some of the more advanced segmentation algorithms for brain tumor images.

scholarly journals Deformable Models for Segmentation Based on Local Analysis

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Jimena Olveres ◽  
Erik Carbajal-Degante ◽  
Boris Escalante-Ramírez ◽  
Enrique Vallejo ◽  
Carla María García-Moreno
Keyword(s):  
Local Binary Patterns ◽  
Distance Measures ◽  
Local Analysis ◽  
Hermite Transform ◽  
Active Shape Models ◽  
Shape Models ◽  
Segmentation Methods ◽  
Segmentation Algorithms ◽  
Image Modality ◽  
New Algorithms

Segmentation tasks in medical imaging represent an exhaustive challenge for scientists since the image acquisition nature yields issues that hamper the correct reconstruction and visualization processes. Depending on the specific image modality, we have to consider limitations such as the presence of noise, vanished edges, or high intensity differences, known, in most cases, as inhomogeneities. New algorithms in segmentation are required to provide a better performance. This paper presents a new unified approach to improve traditional segmentation methods as Active Shape Models and Chan-Vese model based on level set. The approach introduces a combination of local analysis implementations with classic segmentation algorithms that incorporates local texture information given by the Hermite transform and Local Binary Patterns. The mixture of both region-based methods and local descriptors highlights relevant regions by considering extra information which is helpful to delimit structures. We performed segmentation experiments on 2D images including midbrain in Magnetic Resonance Imaging and heart’s left ventricle endocardium in Computed Tomography. Quantitative evaluation was obtained with Dice coefficient and Hausdorff distance measures. Results display a substantial advantage over the original methods when we include our characterization schemes. We propose further research validation on different organ structures with promising results.

Revisiting the K-nn algorithm for obstetric image segmentation

2021 ◽  
pp. 1-13
Author(s):  
P. Salgado ◽  
T.-P. Azevedo Perdicoúlis
Keyword(s):  
Magnetic Resonance Image ◽  
Medical Image ◽  
Clustering Algorithm ◽  
Ultrasound Image ◽  
Well Being ◽  
Health Conditions ◽  
Medical Applications ◽  
Training Set ◽  
Segmentation Methods ◽  
Segmentation Algorithms

Medical image techniques are used to examine and determine the well-being of the foetus during pregnancy. Digital image processing (DIP) is essential to extract valuable information embedded in most biomedical signals. After, intelligent segmentation methods, based on classifier algorithms, must be applied to identify structures and relevant features from previous data. The success of both is essential for helping doctors to identify adverse health conditions from the medical images. To obtain easy and reliable DIP methods for foetus images in real-time, at different gestational ages, aware pre-processing needs to be applied to the images. Thence, some data features are extracted that are meant to be used as input to the segmentation algorithms presented in this work. Due to the high dimension of the problems in question, assemblage of the data is also desired. The segmentation of the images is done by revisiting the K-nn algorithm that is a conventional nonparametric classifier. Besides its simplicity, its power to accomplish high classification results in medical applications has been demonstrated. In this work two versions of this algorithm are presented (i) an enhancement of the standard version by aggregating the data apriori and (ii) an iterative version of the same method where the training set (TS) is not static. The procedure is demonstrated in two experiments, where two images of different technologies were selected: a magnetic resonance image and an ultrasound image, respectively. The results were assessed by comparison with the K-means clustering algorithm, a well-known and robust method for this type of task. Both described versions showed results close to 100% matching with the ones obtained by the validation method, although the iterative version displays much higher reliability in the classification.

Sign in / Sign up

Export Citation Format

Share Document