O(log2 M) self-organizing map algorithm without learning of neighborhood vectors

Probabilistic Nested Model Selection in Pharmacokinetic Analysis of DCE-MRI Data in Animal Model of Cerebral Tumor

Purpose

Best current practice in the analysis of dynamic contrast enhanced (DCE)-MRI is to employ a voxel-by-voxel model selection from a hierarchy of nested models. This nested model selection (NMS) assumes that the observed time-trace of contrast-agent (CA) concentration within a voxel, corresponds to a singular physiologically nested model. However, admixtures of different models may exist within a voxel's CA time-trace. This study introduces an unsupervised feature engineering technique (Kohonen-Self-Organizing-Map (K-SOM)) to estimate the voxel-wise probability of each nested model.

Methods

Sixty-six immune-compromised-RNU rats were implanted with human U-251N cancer cells, and DCE-MRI data were acquired from all the rat brains. The time-trace of change in the longitudinalrelaxivityΔ R 1 for all animals' brain voxels was calculated. DCE-MRI pharmacokinetic (PK) analysis was performed using NMS to estimate three model regions: Model-1: normal vasculature without leakage, Model-2: tumor tissues with leakage without back-flux to the vasculature, Model-3: tumor vessels with leakage and back-flux. Approximately two hundred thirty thousand (229,314) normalized Δ R 1 profiles of animals' brain voxels along with their NMS results were used to build a K-SOM (topology-size: 8×8, with competitive-learning algorithm) and probability map of each model. K-fold nested-cross-validation (NCV, k=10) was used to evaluate the performance of the K-SOM probabilistic-NMS (PNMS) technique against the NMS technique.

Results

The K-SOM PNMS's estimation for the leaky tumor regions were strongly similar (Dice-Similarity-Coefficient, DSC=0.774 [CI: 0.731-0.823], and 0.866 [CI: 0.828-0.912] for Models 2 and 3, respectively) to their respective NMS regions. The mean-percent-differences (MPDs, NCV, k=10) for the estimated permeability parameters by the two techniques were: -28%, +18%, and +24%, forv p , K trans , andv e , respectively. The KSOM-PNMS technique produced microvasculature parameters and NMS regions less impacted by the arterial-input-function dispersion effect.

Conclusion

This study introduces an unsupervised model-averaging technique (K-SOM) to estimate the contribution of different nested-models in PK analysis and provides a faster estimate of permeability parameters.

Radiomics characterization of tissues in an animal brain tumor model imaged using dynamic contrast enhanced (DCE) MRI

Here, we investigate radiomics-based characterization of tumor vascular and microenvironmental properties in an orthotopic rat brain tumor model measured using dynamic-contrast-enhanced (DCE) MRI. Thirty-two immune compromised-RNU rats implanted with human U-251N cancer cells were imaged using DCE-MRI (7Tesla, Dual-Gradient-Echo). The aim was to perform pharmacokinetic analysis using a nested model (NM) selection technique to classify brain regions according to vasculature properties considered as the source of truth. A two-dimensional convolutional-based radiomics analysis was performed on the raw-DCE-MRI of the rat brains to generate dynamic radiomics maps. The raw-DCE-MRI and respective radiomics maps were used to build 28 unsupervised Kohonen self-organizing-maps (K-SOMs). A Silhouette-Coefficient (SC), k-fold Nested-Cross-Validation (k-fold-NCV), and feature engineering analyses were performed on the K-SOMs' feature spaces to quantify the distinction power of radiomics features compared to raw-DCE-MRI for classification of different Nested Models. Results showed that eight radiomics features outperformed respective raw-DCE-MRI in prediction of the three nested models. The average percent difference in SCs between radiomics features and raw-DCE-MRI was: 29.875% ± 12.922%, p < 0.001. This work establishes an important first step toward spatiotemporal characterization of brain regions using radiomics signatures, which is fundamental toward staging of tumors and evaluation of tumor response to different treatments.

Toward a new task assignment and path evolution (TAPE) for missile defense system (MDS) using intelligent adaptive SOM with recurrent neural networks (RNNs)

In this paper, a new adaptive self-organizing map (SOM) with recurrent neural network (RNN) controller is proposed for task assignment and path evolution of missile defense system (MDS). We address the problem of N agents (defending missiles) and D targets (incoming missiles) in MDS. A new RNN controller is designed to force an agent (or defending missile) toward a target (or incoming missile), and a monitoring controller is also designed to reduce the error between RNN controller and ideal controller. A new SOM with RNN controller is then designed to dispatch agents to their corresponding targets by minimizing total damaging cost. This is actually an important application of the multiagent system. The SOM with RNN controller is the main controller. After task assignment, the weighting factors of our new SOM with RNN controller are activated to dispatch the agents toward their corresponding targets. Using the Lyapunov constraints, the weighting factors for the proposed SOM with RNN controller are updated to guarantee the stability of the path evolution (or planning) system. Excellent simulations are obtained using this new approach for MDS, which show that our RNN has the lowest average miss distance among the several techniques.

String tightening as a self-organizing phenomenon

The phenomenon of self-organization has been of special interest to the neural network community throughout the last couple of decades. In this paper, we study a variant of the self-organizing map (SOM) that models the phenomenon of self-organization of the particles forming a string when the string is tightened from one or both of its ends. The proposed variant, called the string tightening self-organizing neural network (STON), can be used to solve certain practical problems, such as computation of shortest homotopic paths, smoothing paths to avoid sharp turns, computation of convex hull, etc. These problems are of considerable interest in computational geometry, robotics path-planning, artificial intelligence (AI) (diagrammatic reasoning), very large scale integration (VLSI) routing, and geographical information systems. Given a set of obstacles and a string with two fixed terminal points in a 2-D space, the STON model continuously tightens the given string until the unique shortest configuration in terms of the Euclidean metric is reached. The STON minimizes the total length of a string on convergence by dynamically creating and selecting feature vectors in a competitive manner. Proof of correctness of this anytime algorithm and experimental results obtained by its deployment have been presented in the paper.