scholarly journals Brain Extraction Using Active Contour Neighborhood-Based Graph Cuts Model

Symmetry ◽  
2020 ◽  
Vol 12 (4) ◽  
pp. 559 ◽  
Author(s):  
Shaofeng Jiang ◽  
Yu Wang ◽  
Xuxin Zhou ◽  
Zhen Chen ◽  
Suhua Yang
Keyword(s):  
Local Convergence ◽  
Active Contour ◽  
Sagittal Plane ◽  
Brain Mri ◽  
Graph Cuts ◽  
Dice Similarity Coefficient ◽  
Data Sets ◽  
Similarity Coefficients ◽  
Data Set ◽  
Brain Extraction

The extraction of brain tissue from brain MRI images is an important pre-procedure for the neuroimaging analyses. The brain is bilaterally symmetric both in coronal plane and transverse plane, but is usually asymmetric in sagittal plane. To address the over-smoothness, boundary leakage, local convergence and asymmetry problems in many popular methods, we developed a brain extraction method using an active contour neighborhood-based graph cuts model. The method defined a new asymmetric assignment of edge weights in graph cuts for brain MRI images. The new graph cuts model was performed iteratively in the neighborhood of brain boundary named the active contour neighborhood (ACN), and was effective to eliminate boundary leakage and avoid local convergence. The method was compared with other popular methods on the Internet Brain Segmentation Repository (IBSR) and OASIS data sets. In testing cross IBSR data set (18 scans with 1.5 mm thickness), IBSR data set (20 scans with 3.1 mm thickness) and OASIS data set (77 scans with 1 mm thickness), the mean Dice similarity coefficients obtained by the proposed method were 0.957 ± 0.013, 0.960 ± 0.009 and 0.936 ± 0.018 respectively. The result obtained by the proposed method is very similar with manual segmentation and achieved the best mean Dice similarity coefficient on IBSR data. Our experiments indicate that the proposed method can provide competitively accurate results and may obtain brain tissues with sharp brain boundary from brain MRI images.

Autonomous Trajectory Planning for External Ventricular Drain Placement

2018 ◽  
Vol 15 (4) ◽  
pp. 433-439
Author(s):  
Joel S Beckett ◽  
Bilwaj Gaonkar ◽  
Diana Babayan ◽  
Justin Mathew ◽  
David McArthur ◽  
...  
Keyword(s):  
Image Registration ◽  
Intracranial Hemorrhage ◽  
Sagittal Plane ◽  
External Ventricular Drain ◽  
Ct Scans ◽  
Data Sets ◽  
Foramen Of Monro ◽  
Data Set ◽  
Neurosurgical Procedure ◽  
Noncontrast Ct

Abstract BACKGROUND External ventricular drain (EVD) placement is the most frequently performed neurosurgical procedure for management of various conditions including hydrocephalus, traumatic brain injury, and stroke. State-of-the-art computational pattern recognition techniques could improve the safety and accuracy of EVD placement. Placement of the Kocher's point EVD is the most common neurosurgical procedure which is often performed in urgent conditions. OBJECTIVE To present the development of a novel computer algorithm identifying appropriate anatomy and autonomously plan EVD placement on clinical computed tomography (CT) scans. METHODS The algorithm was tested on 2 data sets containing 5-mm slice noncontrast CT scans. The first contained images of 300 patients without significant intracranial pathology (normal), the second of 43 patients with significant acute intracranial hemorrhage. Automated planning was performed by custom 2-tiered heuristic with run-time template selection in combination with refinement using nonlinear image registration. RESULTS Automated EVD planning was accurate in 297 of 300 normal and 41 of 43 patient cases. In the normal data set, mean distance between Kocher's point and the ipsilateral foramen of Monro was 63 ± 3.1 mm in women and 65 ± 6.5 mm in men (P = .0008). Trajectory angle with respect to the sagittal plane was 91 ± 6° in women and 90 ± 6° in men (obtuse posterior) (P = .15); to the coronal plane, 85 ± 6° and 86 ± 5° in women and men (P = .12), respectively (acute lateral). CONCLUSION A combination of linear and nonlinear image registration techniques accurately planned EVD trajectory in 99% of normal scans and 95% of scans with significant intracranial hemorrhage.

scholarly journals Three-dimensional deep learning with spatial erasing for unsupervised anomaly segmentation in brain MRI

2021 ◽  
Author(s):  
Marcel Bengs ◽  
Finn Behrendt ◽  
Julia Krüger ◽  
Roland Opfer ◽  
Alexander Schlaefer
Keyword(s):  
Deep Learning ◽  
Brain Mri ◽  
Magnetic Resonance Images ◽  
Spatial Context ◽  
Data Sets ◽  
Learning Methods ◽  
Data Set ◽  
Performance Improvements ◽  
Wide Range ◽  
The Impact

Abstract Purpose Brain Magnetic Resonance Images (MRIs) are essential for the diagnosis of neurological diseases. Recently, deep learning methods for unsupervised anomaly detection (UAD) have been proposed for the analysis of brain MRI. These methods rely on healthy brain MRIs and eliminate the requirement of pixel-wise annotated data compared to supervised deep learning. While a wide range of methods for UAD have been proposed, these methods are mostly 2D and only learn from MRI slices, disregarding that brain lesions are inherently 3D and the spatial context of MRI volumes remains unexploited. Methods We investigate whether using increased spatial context by using MRI volumes combined with spatial erasing leads to improved unsupervised anomaly segmentation performance compared to learning from slices. We evaluate and compare 2D variational autoencoder (VAE) to their 3D counterpart, propose 3D input erasing, and systemically study the impact of the data set size on the performance. Results Using two publicly available segmentation data sets for evaluation, 3D VAEs outperform their 2D counterpart, highlighting the advantage of volumetric context. Also, our 3D erasing methods allow for further performance improvements. Our best performing 3D VAE with input erasing leads to an average DICE score of 31.40% compared to 25.76% for the 2D VAE. Conclusions We propose 3D deep learning methods for UAD in brain MRI combined with 3D erasing and demonstrate that 3D methods clearly outperform their 2D counterpart for anomaly segmentation. Also, our spatial erasing method allows for further performance improvements and reduces the requirement for large data sets.

scholarly journals Band-based similarity indices for gene expression clustering and classification.

2019 ◽  
Author(s):  
Aurora Torrente
Keyword(s):  
Gene Expression ◽  
Euclidean Distance ◽  
Real Data ◽  
Data Sets ◽  
Similarity Coefficients ◽  
Computationally Efficient ◽  
Data Set ◽  
Similarity Indices ◽  
Clustering And Classification ◽  
Band Depth

Abstract Background: The concept of depth induces an ordering from centre outwards in multivariate data. Most depth definitions are unfeasible for dimensions larger than three or four, but the Modified Band Depth (MBD) is a notable exception that has proven to be a valuable tool in the analysis of gene expression data. However, given a notion of depth, there exists no straight forward method to derive a depth-based similarity or dissimilarity measure between observations to be used in standard tasks such as clustering or classification. Results: We propose a methodology to assess a data-driven (dis)similarity between two observations, taking advantage of the bands used in the computation of the MBD. To that end, we build binary vectors associated to each observation to compute the number of times each coordinate is located between the limits of the intervals defined by all possible bands in the set. Those vectors and their Boolean products are used to derive contingency tables from which standard similarity indices can be calculated. Our approach is computationally efficient and can be applied to bands formed by any number of observations from the data set. Conclusions: We have evaluated the performance of several similarity indices with respect to that of the Euclidean distance, used as benchmark, in standard clustering and classification techniques in a variety of simulated and real data sets. Our experiments show that the technique for deriving such measures is very promising, with some of the selected indices outperforming the Euclidean distance. The use of the method is not restricted to these, the extension to other similarity coefficients being straight-forward.

The social wasp Vespula germanica (Fabricius) (Hymenoptera: Vespidae) population dynamics in England over 39 years.

2018 ◽  
Vol 154 (2) ◽  
pp. 149-155
Author(s):  
Michael Archer
Keyword(s):  
Population Dynamics ◽  
Population Dynamic ◽  
Ecological Factors ◽  
Social Wasp ◽  
Data Sets ◽  
Data Set ◽  
Vespula Germanica ◽  
The Social ◽  
Minimum Number ◽  
Suction Traps

1. Yearly records of worker Vespula germanica (Fabricius) taken in suction traps at Silwood Park (28 years) and at Rothamsted Research (39 years) are examined. 2. Using the autocorrelation function (ACF), a significant negative 1-year lag followed by a lesser non-significant positive 2-year lag was found in all, or parts of, each data set, indicating an underlying population dynamic of a 2-year cycle with a damped waveform. 3. The minimum number of years before the 2-year cycle with damped waveform was shown varied between 17 and 26, or was not found in some data sets. 4. Ecological factors delaying or preventing the occurrence of the 2-year cycle are considered.

Predictive and Descriptive CoMFA Models: The Effect of Variable Selection

2018 ◽  
Vol 21 (2) ◽  
pp. 117-124 ◽  
Author(s):  
Bakhtyar Sepehri ◽  
Nematollah Omidikia ◽  
Mohsen Kompany-Zareh ◽  
Raouf Ghavami
Keyword(s):  
Variable Selection ◽  
Predictive Power ◽  
Selection Method ◽  
Data Sets ◽  
Data Set ◽  
Comfa Model ◽  
Variable Selection Method

Aims & Scope: In this research, 8 variable selection approaches were used to investigate the effect of variable selection on the predictive power and stability of CoMFA models. Materials & Methods: Three data sets including 36 EPAC antagonists, 79 CD38 inhibitors and 57 ATAD2 bromodomain inhibitors were modelled by CoMFA. First of all, for all three data sets, CoMFA models with all CoMFA descriptors were created then by applying each variable selection method a new CoMFA model was developed so for each data set, 9 CoMFA models were built. Obtained results show noisy and uninformative variables affect CoMFA results. Based on created models, applying 5 variable selection approaches including FFD, SRD-FFD, IVE-PLS, SRD-UVEPLS and SPA-jackknife increases the predictive power and stability of CoMFA models significantly. Result & Conclusion: Among them, SPA-jackknife removes most of the variables while FFD retains most of them. FFD and IVE-PLS are time consuming process while SRD-FFD and SRD-UVE-PLS run need to few seconds. Also applying FFD, SRD-FFD, IVE-PLS, SRD-UVE-PLS protect CoMFA countor maps information for both fields.

Human Activity Recognition using Fourier Transform Inspired Deep Learning Combination Model

2019 ◽  
Vol 9 (1) ◽  
pp. 16-31
Author(s):  
Kyungkoo Jun
Keyword(s):  
Fourier Transform ◽  
Deep Learning ◽  
Short Term Memory ◽  
Window Size ◽  
Sensor Data ◽  
Data Sets ◽  
Data Set ◽  
Proposed Model ◽  
Testing Data ◽  
Labeling Scheme

Background & Objective: This paper proposes a Fourier transform inspired method to classify human activities from time series sensor data. Methods: Our method begins by decomposing 1D input signal into 2D patterns, which is motivated by the Fourier conversion. The decomposition is helped by Long Short-Term Memory (LSTM) which captures the temporal dependency from the signal and then produces encoded sequences. The sequences, once arranged into the 2D array, can represent the fingerprints of the signals. The benefit of such transformation is that we can exploit the recent advances of the deep learning models for the image classification such as Convolutional Neural Network (CNN). Results: The proposed model, as a result, is the combination of LSTM and CNN. We evaluate the model over two data sets. For the first data set, which is more standardized than the other, our model outperforms previous works or at least equal. In the case of the second data set, we devise the schemes to generate training and testing data by changing the parameters of the window size, the sliding size, and the labeling scheme. Conclusion: The evaluation results show that the accuracy is over 95% for some cases. We also analyze the effect of the parameters on the performance.

scholarly journals An Algorithm for the Removal of Cosmic Ray Artifacts in Spectral Data Sets

2019 ◽  
Vol 73 (8) ◽  
pp. 893-901
Author(s):  
Sinead J. Barton ◽  
Bryan M. Hennelly
Keyword(s):  
Cosmic Ray ◽  
Data Sets ◽  
Biological Cells ◽  
Statistical Classification ◽  
Signal To Noise ◽  
Multivariate Statistical ◽  
Data Set ◽  
Artefact Removal ◽  
Single Capture ◽  
Acquisition Method

Cosmic ray artifacts may be present in all photo-electric readout systems. In spectroscopy, they present as random unidirectional sharp spikes that distort spectra and may have an affect on post-processing, possibly affecting the results of multivariate statistical classification. A number of methods have previously been proposed to remove cosmic ray artifacts from spectra but the goal of removing the artifacts while making no other change to the underlying spectrum is challenging. One of the most successful and commonly applied methods for the removal of comic ray artifacts involves the capture of two sequential spectra that are compared in order to identify spikes. The disadvantage of this approach is that at least two recordings are necessary, which may be problematic for dynamically changing spectra, and which can reduce the signal-to-noise (S/N) ratio when compared with a single recording of equivalent duration due to the inclusion of two instances of read noise. In this paper, a cosmic ray artefact removal algorithm is proposed that works in a similar way to the double acquisition method but requires only a single capture, so long as a data set of similar spectra is available. The method employs normalized covariance in order to identify a similar spectrum in the data set, from which a direct comparison reveals the presence of cosmic ray artifacts, which are then replaced with the corresponding values from the matching spectrum. The advantage of the proposed method over the double acquisition method is investigated in the context of the S/N ratio and is applied to various data sets of Raman spectra recorded from biological cells.

Imbalanced Data Detection Kernel Method in Closed Systems

2013 ◽  
Vol 756-759 ◽  
pp. 3652-3658
Author(s):  
You Li Lu ◽  
Jun Luo
Keyword(s):  
Kernel Methods ◽  
Kernel Method ◽  
Imbalanced Data ◽  
Data Detection ◽  
Data Sets ◽  
System Call ◽  
Data Set ◽  
Imbalanced Data Sets ◽  
Lower Complexity ◽  
Closed Systems

Under the study of Kernel Methods, this paper put forward two improved algorithm which called R-SVM & I-SVDD in order to cope with the imbalanced data sets in closed systems. R-SVM used K-means algorithm clustering space samples while I-SVDD improved the performance of original SVDD by imbalanced sample training. Experiment of two sets of system call data set shows that these two algorithms are more effectively and R-SVM has a lower complexity.

scholarly journals Investigating the impact of pre-processing techniques and pre-trained word embeddings in detecting Arabic health information on social media

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Yahya Albalawi ◽  
Jim Buckley ◽  
Nikola S. Nikolov
Keyword(s):  
Social Media ◽  
Deep Learning ◽  
Comprehensive Evaluation ◽  
Classification Problem ◽  
Data Sets ◽  
Word Embeddings ◽  
Data Set ◽  
Lower Accuracy ◽  
Health Related ◽  
The Impact

AbstractThis paper presents a comprehensive evaluation of data pre-processing and word embedding techniques in the context of Arabic document classification in the domain of health-related communication on social media. We evaluate 26 text pre-processings applied to Arabic tweets within the process of training a classifier to identify health-related tweets. For this task we use the (traditional) machine learning classifiers KNN, SVM, Multinomial NB and Logistic Regression. Furthermore, we report experimental results with the deep learning architectures BLSTM and CNN for the same text classification problem. Since word embeddings are more typically used as the input layer in deep networks, in the deep learning experiments we evaluate several state-of-the-art pre-trained word embeddings with the same text pre-processing applied. To achieve these goals, we use two data sets: one for both training and testing, and another for testing the generality of our models only. Our results point to the conclusion that only four out of the 26 pre-processings improve the classification accuracy significantly. For the first data set of Arabic tweets, we found that Mazajak CBOW pre-trained word embeddings as the input to a BLSTM deep network led to the most accurate classifier with F1 score of 89.7%. For the second data set, Mazajak Skip-Gram pre-trained word embeddings as the input to BLSTM led to the most accurate model with F1 score of 75.2% and accuracy of 90.7% compared to F1 score of 90.8% achieved by Mazajak CBOW for the same architecture but with lower accuracy of 70.89%. Our results also show that the performance of the best of the traditional classifier we trained is comparable to the deep learning methods on the first dataset, but significantly worse on the second dataset.

PSVI-8 Meta-regression Analysis to Determine the Relationship Between Growing Pig Body Weight and Variation

2021 ◽  
Vol 99 (Supplement_1) ◽  
pp. 218-219
Author(s):  
Andres Fernando T Russi ◽  
Mike D Tokach ◽  
Jason C Woodworth ◽  
Joel M DeRouchey ◽  
Robert D Goodband ◽  
...  
Keyword(s):  
Body Weight ◽  
Regression Analysis ◽  
Sample Size ◽  
Polynomial Regression ◽  
Data Sets ◽  
Regression Equations ◽  
Prediction Equations ◽  
Data Set ◽  
Rate Of Increase ◽  
The Relationship

Abstract The swine industry has been constantly evolving to select animals with improved performance traits and to minimize variation in body weight (BW) in order to meet packer specifications. Therefore, understanding variation presents an opportunity for producers to find strategies that could help reduce, manage, or deal with variation of pigs in a barn. A systematic review and meta-analysis was conducted by collecting data from multiple studies and available data sets in order to develop prediction equations for coefficient of variation (CV) and standard deviation (SD) as a function of BW. Information regarding BW variation from 16 papers was recorded to provide approximately 204 data points. Together, these data included 117,268 individually weighed pigs with a sample size that ranged from 104 to 4,108 pigs. A random-effects model with study used as a random effect was developed. Observations were weighted using sample size as an estimate for precision on the analysis, where larger data sets accounted for increased accuracy in the model. Regression equations were developed using the nlme package of R to determine the relationship between BW and its variation. Polynomial regression analysis was conducted separately for each variation measurement. When CV was reported in the data set, SD was calculated and vice versa. The resulting prediction equations were: CV (%) = 20.04 – 0.135 × (BW) + 0.00043 × (BW)2, R2=0.79; SD = 0.41 + 0.150 × (BW) - 0.00041 × (BW)2, R2 = 0.95. These equations suggest that there is evidence for a decreasing quadratic relationship between mean CV of a population and BW of pigs whereby the rate of decrease is smaller as mean pig BW increases from birth to market. Conversely, the rate of increase of SD of a population of pigs is smaller as mean pig BW increases from birth to market.

Sign in / Sign up

Export Citation Format

Share Document