Enhancing level set brain tumor segmentation using fuzzy shape prior information and deep learning

Magnetic resonance imaging (MRI) brain tumor segmentation is a crucial task for clinical treatment. However, it is challenging owing to variations in type, size, and location of tumors. In addition, anatomical variation in individuals, intensity non-uniformity, and noises adversely affect brain tumor segmentation. To address these challenges, an automatic region-based brain tumor segmentation approach is presented in this paper which combines fuzzy shape prior term and deep learning. We define a new energy function in which an Adaptively Regularized Kernel-Based Fuzzy C-Means (ARKFCM) Clustering algorithm is utilized for inferring the shape of the tumor to be embedded into the level set method. In this way, some shortcomings of traditional level set methods such as contour leakage and shrinkage have been eliminated. Moreover, a fully automated method is achieved by using U-Net to obtain the initial contour, reducing sensitivity to initial contour selection. The proposed method is validated on the BraTS 2017 benchmark dataset for brain tumor segmentation. Average values of Dice, Jaccard, Sensitivity and specificity are 0.93 ± 0.03, 0.86 ± 0.06, 0.95 ± 0.04, and 0.99 ± 0.003, respectively. Experimental results indicate that the proposed method outperforms the other state-of-the-art methods in brain tumor segmentation.     

Adaptive robust control of uncertain systems with state and input delay

In this paper, adaptive robust control of uncertain systems with multiple time delays in states and input is considered. It is assumed that the parameter uncertainties are time varying norm-bounded whose bounds are unknown but their functional properties are known. To overcome the effect of input delay on the closed loop system stability, new Lyapunov Krasovskii functional will be introduced. It is shown that the proposed adaptive robust controller guarantees globally uniformly exponentially convergence of all system solutions to a ball with any certain convergence rate. Moreover, if there is no disturbance in the system, asymptotic stability of the closed loop system will be established. The proposed design condition is formulated in terms of linear matrix inequality (LMI) which can be easily solved by LMI Toolbox in Matlab. Finally, an illustrative example is included to show the effectiveness of results developed in this paper.     

Estimation of the minimum machining performance in the abrasive waterjet machining using integrated ANN-SA

In this study, Artificial Neural Network (ANN) and Simulated Annealing (SA) techniques were integrated labeled as integrated ANN-SA to estimate optimal process parameters in abrasive waterjet (AWJ) machining operation. The considered process parameters include traverse speed, waterjet pressure, standoff distance, abrasive grit size and abrasive flow rate. The quality of the cutting of machined-material is assessed by looking to the roughness average value (R_a). The optimal values of the process parameters are targeted for giving a minimum value of R_a. It was evidence that integrated ANN-SA is capable of giving much lower value of R_a at the recommended optimal process parameters compared to the result of experimental and ANN single-based modeling. The number of iterations for the optimal solutions is also decreased compared to the result of SA single-based optimization.     

A domain decomposition strategy for alignment of multiple biological sequences on multiprocessor platforms

Multiple Sequences Alignment (MSA) of biological sequences is a fundamental problem in computational biology due to its critical significance in wide ranging applications including haplotype reconstruction, sequence homology, phylogenetic analysis, and prediction of evolutionary origins. The MSA problem is considered NP-hard and known heuristics for the problem do not scale well with increasing numbers of sequences. On the other hand, with the advent of a new breed of fast sequencing techniques it is now possible to generate thousands of sequences very quickly. For rapid sequence analysis, it is therefore desirable to develop fast MSA algorithms that scale well with an increase in the dataset size. In this paper, we present a novel domain decomposition based technique to solve the MSA problem on multiprocessing platforms. The domain decomposition based technique, in addition to yielding better quality, gives enormous advantages in terms of execution time and memory requirements. The proposed strategy allows one to decrease the time complexity of any known heuristic of O(N)^x$O{\left(N\right)}^x$ complexity by a factor of O(1/p)^x$O{(1/p)}^x$, where N$N$ is the number of sequences, x$x$ depends on the underlying heuristic approach, and p$p$ is the number of processing nodes. In particular, we propose a highly scalable algorithm, Sample-Align-D, for aligning biological sequences using Muscle system as the underlying heuristic. The proposed algorithm has been implemented on a cluster of workstations using the MPI library. Experimental results for different problem sizes are analyzed in terms of quality of alignment, execution time and speed-up.     

Dynamic hybrid automatic repeat request (DHARQ) for WiMAX – Mobile multihop relay using adaptive power control

Wireless multihop network is currently attracting much attention as a new wireless broadband access technology due to numerous benefits. This work proposes a power control scheme for WiMAX multihop relay system. In contrast to existing power control and optimization approaches, our proposed method uses an adaptive Channel Quality Measurement for a relay station to reduce interferences to other mobile station (MS) or relay station (RS) within the same cell and hence increase the number of hops per link and consequently maximize the spatial reuse. The proposed power control is applied to a new dynamic HARQ algorithm for adaptive channel quality enhancement. Simulation results have indicated that the proposed approach achieves superior BER/PER performance enhancement in comparison to previous related works.     

Short-term and long-term memory analysis of learning using 2D and 3D educational contents

ABSTRACT

The effect of 2D and 3D educational content learning on memory has been studied using electroencephalography (EEG) brain signal. A hypothesis is set that the 3D materials are better than the 2D materials for learning and memory recall. To test the hypothesis, we proposed a classification system that will predict true or false recall for short-term memory (STM) and long-term memory (LTM) after learning by either 2D or 3D educational contents. For this purpose, EEG brain signals are recorded during learning and testing; the signals are then analysed in the time domain using different types of features in various frequency bands. The features are then fed into a support vector machine (SVM)-based classifier. The experimental results indicate that the learning and memory recall using 2D and 3D contents do not have significant differences for both the STM and the LTM.     

Genetic Algorithm and Simulated Annealing to estimate optimal process parameters of the abrasive waterjet machining

In this study, two computational approaches, Genetic Algorithm and Simulated Annealing, are applied to search for a set of optimal process parameters value that leads to the minimum value of machining performance. The objectives of the applied techniques are: (1) to estimate the minimum value of the machining performance compared to the machining performance value of the experimental data and regression modeling, (2) to estimate the optimal process parameters values that has to be within the range of the minimum and maximum coded values for process parameters of experimental design that are used for experimental trial and (3) to evaluate the number of iteration generated by the computational approaches that lead to the minimum value of machining performance. Set of the machining process parameters and machining performance considered in this work deal with the real experimental data of the non-conventional machining operation, abrasive waterjet. The results of this study showed that both of the computational approaches managed to estimate the optimal process parameters, leading to the minimum value of machining performance when compared to the result of real experimental data.     

SimClus: an effective algorithm for clustering with a lower bound on similarity

Clustering algorithms generally accept a parameter k from the user, which determines the number of clusters sought. However, in many application domains, like document categorization, social network clustering, and frequent pattern summarization, the proper value of k is difficult to guess. An alternative clustering formulation that does not require k is to impose a lower bound on the similarity between an object and its corresponding cluster representative. Such a formulation chooses exactly one representative for every cluster and minimizes the representative count. It has many additional benefits. For instance, it supports overlapping clusters in a natural way. Moreover, for every cluster, it selects a representative object, which can be effectively used in summarization or semi-supervised classification task. In this work, we propose an algorithm, SimClus, for clustering with lower bound on similarity. It achieves a O(log n) approximation bound on the number of clusters, whereas for the best previous algorithm the bound can be as poor as O(n). Experiments on real and synthetic data sets show that our algorithm produces more than 40% fewer representative objects, yet offers the same or better clustering quality. We also propose a dynamic variant of the algorithm, which can be effectively used in an on-line setting.     

An optical solution to the 3-SAT problem using wavelength based selectors

In this paper, an optical wavelength-based method to solve a well-known NP-complete problem 3-SAT is provided. In the 3-SAT problem, a formula F in the form of conjunction of some clauses over Boolean variables is given and the question is to find if F is satisfiable or not. The provided method uses exponential number of different wavelengths in a light ray and considers each group of wavelengths as a possible value-assignment for the variables. It then uses optical devices to drop wavelengths not satisfying F from the light ray. At the end, remaining wavelengths indicate satisfiability of the formula. The method provides two ways to arrange the optical devices to select satisfying wavelengths for a given clause: simple clause selectors and combined clause selectors, both requiring exponential preprocessing time. After preprocessing phase, the provided method requires polynomial time and optical devices to solve each problem instance.