2,109 research outputs found

    On the formulation of a minimal uncertainty model for robust control with structured uncertainty

    Get PDF
    In the design and analysis of robust control systems for uncertain plants, representing the system transfer matrix in the form of what has come to be termed an M-delta model has become widely accepted and applied in the robust control literature. The M represents a transfer function matrix M(s) of the nominal closed loop system, and the delta represents an uncertainty matrix acting on M(s). The nominal closed loop system M(s) results from closing the feedback control system, K(s), around a nominal plant interconnection structure P(s). The uncertainty can arise from various sources, such as structured uncertainty from parameter variations or multiple unsaturated uncertainties from unmodeled dynamics and other neglected phenomena. In general, delta is a block diagonal matrix, but for real parameter variations delta is a diagonal matrix of real elements. Conceptually, the M-delta structure can always be formed for any linear interconnection of inputs, outputs, transfer functions, parameter variations, and perturbations. However, very little of the currently available literature addresses computational methods for obtaining this structure, and none of this literature addresses a general methodology for obtaining a minimal M-delta model for a wide class of uncertainty, where the term minimal refers to the dimension of the delta matrix. Since having a minimally dimensioned delta matrix would improve the efficiency of structured singular value (or multivariable stability margin) computations, a method of obtaining a minimal M-delta would be useful. Hence, a method of obtaining the interconnection system P(s) is required. A generalized procedure for obtaining a minimal P-delta structure for systems with real parameter variations is presented. Using this model, the minimal M-delta model can then be easily obtained by closing the feedback loop. The procedure involves representing the system in a cascade-form state-space realization, determining the minimal uncertainty matrix, delta, and constructing the state-space representation of P(s). Three examples are presented to illustrate the procedure

    A problem formulation for glideslope tracking in wind shear using advanced robust control techniques

    Get PDF
    A formulation of the longitudinal glideslope tracking of a transport-class aircraft in severe wind shear and turbulence for application to robust control system design is presented. Mathematical wind shear models are incorporated into the vehicle mathematical model, and wind turbulence is modeled as an input disturbance signal. For this problem formulation, the horizontal and vertical wind shear gradients are treated as real uncertain parameters that vary over an entire wind shear profile. The primary objective is to examine the formulation of this problem into an appropriate design format for use in m-synthesis control system design

    Error Corrective Boosting for Learning Fully Convolutional Networks with Limited Data

    Full text link
    Training deep fully convolutional neural networks (F-CNNs) for semantic image segmentation requires access to abundant labeled data. While large datasets of unlabeled image data are available in medical applications, access to manually labeled data is very limited. We propose to automatically create auxiliary labels on initially unlabeled data with existing tools and to use them for pre-training. For the subsequent fine-tuning of the network with manually labeled data, we introduce error corrective boosting (ECB), which emphasizes parameter updates on classes with lower accuracy. Furthermore, we introduce SkipDeconv-Net (SD-Net), a new F-CNN architecture for brain segmentation that combines skip connections with the unpooling strategy for upsampling. The SD-Net addresses challenges of severe class imbalance and errors along boundaries. With application to whole-brain MRI T1 scan segmentation, we generate auxiliary labels on a large dataset with FreeSurfer and fine-tune on two datasets with manual annotations. Our results show that the inclusion of auxiliary labels and ECB yields significant improvements. SD-Net segments a 3D scan in 7 secs in comparison to 30 hours for the closest multi-atlas segmentation method, while reaching similar performance. It also outperforms the latest state-of-the-art F-CNN models.Comment: Accepted at MICCAI 201

    Simultaneous Matrix Diagonalization for Structural Brain Networks Classification

    Full text link
    This paper considers the problem of brain disease classification based on connectome data. A connectome is a network representation of a human brain. The typical connectome classification problem is very challenging because of the small sample size and high dimensionality of the data. We propose to use simultaneous approximate diagonalization of adjacency matrices in order to compute their eigenstructures in more stable way. The obtained approximate eigenvalues are further used as features for classification. The proposed approach is demonstrated to be efficient for detection of Alzheimer's disease, outperforming simple baselines and competing with state-of-the-art approaches to brain disease classification

    Adolescent brain maturation and cortical folding: evidence for reductions in gyrification

    Get PDF
    Evidence from anatomical and functional imaging studies have highlighted major modifications of cortical circuits during adolescence. These include reductions of gray matter (GM), increases in the myelination of cortico-cortical connections and changes in the architecture of large-scale cortical networks. It is currently unclear, however, how the ongoing developmental processes impact upon the folding of the cerebral cortex and how changes in gyrification relate to maturation of GM/WM-volume, thickness and surface area. In the current study, we acquired high-resolution (3 Tesla) magnetic resonance imaging (MRI) data from 79 healthy subjects (34 males and 45 females) between the ages of 12 and 23 years and performed whole brain analysis of cortical folding patterns with the gyrification index (GI). In addition to GI-values, we obtained estimates of cortical thickness, surface area, GM and white matter (WM) volume which permitted correlations with changes in gyrification. Our data show pronounced and widespread reductions in GI-values during adolescence in several cortical regions which include precentral, temporal and frontal areas. Decreases in gyrification overlap only partially with changes in the thickness, volume and surface of GM and were characterized overall by a linear developmental trajectory. Our data suggest that the observed reductions in GI-values represent an additional, important modification of the cerebral cortex during late brain maturation which may be related to cognitive development

    A Multi-Armed Bandit to Smartly Select a Training Set from Big Medical Data

    Full text link
    With the availability of big medical image data, the selection of an adequate training set is becoming more important to address the heterogeneity of different datasets. Simply including all the data does not only incur high processing costs but can even harm the prediction. We formulate the smart and efficient selection of a training dataset from big medical image data as a multi-armed bandit problem, solved by Thompson sampling. Our method assumes that image features are not available at the time of the selection of the samples, and therefore relies only on meta information associated with the images. Our strategy simultaneously exploits data sources with high chances of yielding useful samples and explores new data regions. For our evaluation, we focus on the application of estimating the age from a brain MRI. Our results on 7,250 subjects from 10 datasets show that our approach leads to higher accuracy while only requiring a fraction of the training data.Comment: MICCAI 2017 Proceeding

    Multi-view Brain Network Prediction from a Source View Using Sample Selection via CCA-Based Multi-kernel Connectomic Manifold Learning

    Get PDF
    Several challenges emerged from the dataclysm of neuroimaging datasets spanning both healthy and disordered brain spectrum. In particular, samples with missing data views (e.g., functional imaging modality) constitute a hurdle to conventional big data learning techniques which ideally would be trained using a maximum number of samples across all views. Existing works on predicting target data views from a source data view mainly used brain images such as predicting PET image from MRI image. However, to the best of our knowledge, predicting a set of target brain networks from a source network remains unexplored. To ll this gap, a multi-kernel manifold learning (MKML) framework is proposed to learn how to predict multi-view brain networks from a source network to impute missing views in a connectomic dataset. Prior to performing multiple kernel learning of multi-view data, it is typically assumed that the source and target data come from the same distribution. However, multi-view connectomic data can be drawn from different distributions. In order to build robust predictors for predicting target multi-view networks from a source network view, it is necessary to take into account the shift between the source and target domains. Hence, we first estimate a mapping function that transforms the source and the target domains into a shared space where their correlation is maximized using canonical correlation analysis (CCA). Next, we nest the projected training and testing source samples into a connectomic manifold using multiple kernel learning, where we identify the most similar training samples to the testing source network. Given a testing subject, we introduce a cross-domain trust score to assess the reliability of each selected training sample for the target prediction task. Our model outperformed both conventional MKML technique and the proposed CCA-based MKMLtechnique without enhancement by trust scores

    Supervised Nonparametric Image Parcellation

    Get PDF
    Author Manuscript 2010 August 25. 12th International Conference, London, UK, September 20-24, 2009, Proceedings, Part IISegmentation of medical images is commonly formulated as a supervised learning problem, where manually labeled training data are summarized using a parametric atlas. Summarizing the data alleviates the computational burden at the expense of possibly losing valuable information on inter-subject variability. This paper presents a novel framework for Supervised Nonparametric Image Parcellation (SNIP). SNIP models the intensity and label images as samples of a joint distribution estimated from the training data in a non-parametric fashion. By capitalizing on recently developed fast and robust pairwise image alignment tools, SNIP employs the entire training data to segment a new image via Expectation Maximization. The use of multiple registrations increases robustness to occasional registration failures. We report experiments on 39 volumetric brain MRI scans with manual labels for the white matter, cortex and subcortical structures. SNIP yields better segmentation than state-of-the-art algorithms in multiple regions of interest.NAMIC (NIHNIBIBNAMICU54-EB005149)NAC (NIHNCRRNACP41-RR13218)mBIRN (NIHNCRRmBIRNU24-RR021382)NIH NINDS (Grant R01-NS051826)National Science Foundation (U.S.) (CAREER Grant 0642971)NCRR (P41-RR14075)NCRR (R01 RR16594-01A1)NIBIB (R01 EB001550)NIBIB (R01EB006758)NINDS (R01 NS052585-01)Mind Research InstituteEllison Medical FoundationSingapore. Agency for Science, Technology and Researc

    Deep Learning versus Classical Regression for Brain Tumor Patient Survival Prediction

    Full text link
    Deep learning for regression tasks on medical imaging data has shown promising results. However, compared to other approaches, their power is strongly linked to the dataset size. In this study, we evaluate 3D-convolutional neural networks (CNNs) and classical regression methods with hand-crafted features for survival time regression of patients with high grade brain tumors. The tested CNNs for regression showed promising but unstable results. The best performing deep learning approach reached an accuracy of 51.5% on held-out samples of the training set. All tested deep learning experiments were outperformed by a Support Vector Classifier (SVC) using 30 radiomic features. The investigated features included intensity, shape, location and deep features. The submitted method to the BraTS 2018 survival prediction challenge is an ensemble of SVCs, which reached a cross-validated accuracy of 72.2% on the BraTS 2018 training set, 57.1% on the validation set, and 42.9% on the testing set. The results suggest that more training data is necessary for a stable performance of a CNN model for direct regression from magnetic resonance images, and that non-imaging clinical patient information is crucial along with imaging information.Comment: Contribution to The International Multimodal Brain Tumor Segmentation (BraTS) Challenge 2018, survival prediction tas
    corecore