Engineering Commons^™

Resilient And Trustworthy Dynamic Data-Driven Application Systems (Dddas) Services For Crisis Management Environments, Youakim Badr, Salim Hariti, Youssif Al-Nashif, Erik Blasch

Electrical & Computer Engineering Faculty Publications

Future crisis management systems needresilient and trustworthy infrastructures to quickly develop reliable applications and processes, andensure end-to-end security, trust, and privacy. Due to the multiplicity and diversity of involved actors, volumes of data, and heterogeneity of shared information;crisis management systems tend to be highly vulnerable and subjectto unforeseen incidents. As a result, the dependability of crisis management systems can be at risk. This paper presents a cloud-based resilient and trustworthy infrastructure (known as rDaaS) to quickly develop secure crisis management systems. The rDaaS integrates the Dynamic Data-Driven Application Systems (DDDAS) paradigm into a service-oriented architecture over cloud technology and provides …

A Comparative Study Of Two Prediction Models For Brain Tumor Progression, Deqi Zhou, Loc Tran, Jihong Wang, Jiang Li, Karen O. Egiazarian (Ed.), Sos S. Agaian (Ed.), Atanas P. Gotchev (Ed.)

Electrical & Computer Engineering Faculty Publications

MR diffusion tensor imaging (DTI) technique together with traditional T1 or T2 weighted MRI scans supplies rich information sources for brain cancer diagnoses. These images form large-scale, high-dimensional data sets. Due to the fact that significant correlations exist among these images, we assume low-dimensional geometry data structures (manifolds) are embedded in the high-dimensional space. Those manifolds might be hidden from radiologists because it is challenging for human experts to interpret high-dimensional data. Identification of the manifold is a critical step for successfully analyzing multimodal MR images.

We have developed various manifold learning algorithms (Tran et al. 2011; Tran et al. …

Sparse Coding Based Dense Feature Representation Model For Hyperspectral Image Classification, Ender Oguslu, Guoqing Zhou, Zezhong Zheng, Khan Iftekharuddin, Jiang Li

Electrical & Computer Engineering Faculty Publications

We present a sparse coding based dense feature representation model (a preliminary version of the paper was presented at the SPIE Remote Sensing Conference, Dresden, Germany, 2013) for hyperspectral image (HSI) classification. The proposed method learns a new representation for each pixel in HSI through the following four steps: sub-band construction, dictionary learning, encoding, and feature selection. The new representation usually has a very high dimensionality requiring a large amount of computational resources. We applied the l₁/l_q regularized multiclass logistic regression technique to reduce the size of the new representation. We integrated the method with a linear …

The Multimodal Brain Tumor Image Segmentation Benchmark (Brats), Bjoern H. Menze, Andras Jakab, Stefan Bauer, Jayashree Kalpathy-Cramer, Khan M. Iftekharuddin, Syed M.S. Reza

Electrical & Computer Engineering Faculty Publications

In this paper we report the set-up and results of the Multimodal Brain Tumor Image Segmentation Benchmark (BRATS) organized in conjunction with the MICCAI 2012 and 2013 conferences. Twenty state-of-the-art tumor segmentation algorithms were applied to a set of 65 multi-contrast MR scans of low-and high-grade glioma patients-manually annotated by up to four raters-and to 65 comparable scans generated using tumor image simulation software. Quantitative evaluations revealed considerable disagreement between the human raters in segmenting various tumor sub-regions (Dice scores in the range 74%-85%), illustrating the difficulty of this task. We found that different algorithms worked best for different sub-regions …

Adaptive Graph Construction For Isomap Manifold Learning, Loc Tran, Zezhong Zheng, Guoquing Zhou, Jiang Li, Karen O. Egiazarian (Ed.), Sos S. Agaian (Ed.), Atanas P. Gotchev (Ed.)

Electrical & Computer Engineering Faculty Publications

Isomap is a classical manifold learning approach that preserves geodesic distance of nonlinear data sets. One of the main drawbacks of this method is that it is susceptible to leaking, where a shortcut appears between normally separated portions of a manifold. We propose an adaptive graph construction approach that is based upon the sparsity property of the ℓ₁ norm. The ℓ₁ enhanced graph construction method replaces k-nearest neighbors in the classical approach. The proposed algorithm is first tested on the data sets from the UCI data base repository which showed that the proposed approach performs better than …