arXiv subjects

Yi Ding

Publications and source records attributed to Yi Ding.

At least 163 records · Page 9Linked to original sources

arXiv2020

Multiple Instance Segmentation in Brachial Plexus Ultrasound Image Using BPMSegNet

The identification of nerve is difficult as structures of nerves are challenging to image and to detect in ultrasound images. Nevertheless, the nerve identification in ultrasound images is a crucial step to improve performance of regional anesthesia. In this paper, a network called Brachial Plexus Multi-instance Segmentation Network (BPMSegNet) is proposed to identify different tissues (nerves, arteries, veins, muscles) in ultrasound images. The BPMSegNet has three novel modules. The first is the spatial local contrast feature, which computes contrast features at different scales. The second one is the self-attention gate, which reweighs the channels in feature maps by their importance. The third is the addition of a skip concatenation with transposed convolution within a feature pyramid network. The proposed BPMSegNet is evaluated by conducting experiments on our constructed Ultrasound Brachial Plexus Dataset (UBPD). Quantitative experimental results show the proposed network can segment multiple tissues from the ultrasound images with a good performance.

cs.CV↗

arXiv2020

DeepKeyGen: A Deep Learning-based Stream Cipher Generator for Medical Image Encryption and Decryption

The need for medical image encryption is increasingly pronounced, for example to safeguard the privacy of the patients' medical imaging data. In this paper, a novel deep learning-based key generation network (DeepKeyGen) is proposed as a stream cipher generator to generate the private key, which can then be used for encrypting and decrypting of medical images. In DeepKeyGen, the generative adversarial network (GAN) is adopted as the learning network to generate the private key. Furthermore, the transformation domain (that represents the "style" of the private key to be generated) is designed to guide the learning network to realize the private key generation process. The goal of DeepKeyGen is to learn the mapping relationship of how to transfer the initial image to the private key. We evaluate DeepKeyGen using three datasets, namely: the Montgomery County chest X-ray dataset, the Ultrasonic Brachial Plexus dataset, and the BraTS18 dataset. The evaluation findings and security analysis show that the proposed key generation network can achieve a high-level security in generating the private key.

cs.CR↗

arXiv2020

A Multi-View Dynamic Fusion Framework: How to Improve the Multimodal Brain Tumor Segmentation from Multi-Views?

When diagnosing the brain tumor, doctors usually make a diagnosis by observing multimodal brain images from the axial view, the coronal view and the sagittal view, respectively. And then they make a comprehensive decision to confirm the brain tumor based on the information obtained from multi-views. Inspired by this diagnosing process and in order to further utilize the 3D information hidden in the dataset, this paper proposes a multi-view dynamic fusion framework to improve the performance of brain tumor segmentation. The proposed framework consists of 1) a multi-view deep neural network architecture, which represents multi learning networks for segmenting the brain tumor from different views and each deep neural network corresponds to multi-modal brain images from one single view and 2) the dynamic decision fusion method, which is mainly used to fuse segmentation results from multi-views as an integrate one and two different fusion methods, the voting method and the weighted averaging method, have been adopted to evaluate the fusing process. Moreover, the multi-view fusion loss, which consists of the segmentation loss, the transition loss and the decision loss, is proposed to facilitate the training process of multi-view learning networks so as to keep the consistency of appearance and space, not only in the process of fusing segmentation results, but also in the process of training the learning network. \par By evaluating the proposed framework on BRATS 2015 and BRATS 2018, it can be found that the fusion results from multi-views achieve a better performance than the segmentation result from the single view and the effectiveness of proposed multi-view fusion loss has also been proved. Moreover, the proposed framework achieves a better segmentation performance and a higher efficiency compared to other counterpart methods.

eess.IV↗

arXiv2020

A polynomial-time algorithm for learning nonparametric causal graphs

We establish finite-sample guarantees for a polynomial-time algorithm for learning a nonlinear, nonparametric directed acyclic graphical (DAG) model from data. The analysis is model-free and does not assume linearity, additivity, independent noise, or faithfulness. Instead, we impose a condition on the residual variances that is closely related to previous work on linear models with equal variances. Compared to an optimal algorithm with oracle knowledge of the variable ordering, the additional cost of the algorithm is linear in the dimension $d$ and the number of samples $n$. Finally, we compare the proposed algorithm to existing approaches in a simulation study.

stat.ML↗

arXiv2020

Sudden Freezing and Thawing of Entanglement Sharing in a Shrunken Volume

Within the one-excitation context of two identical two-level atoms interacting with a common cavity, we examine the dynamics of all bipartite one-to-other entanglements between each qubit and the remaining part of the whole system. We find a new non-analytic "sudden" dynamical behavior of entanglement. Specifically, the sum of the three one-to-other entanglements of the system can be suddenly frozen at its maximal value or can be suddenly thawed from this value in a periodic manner. We calculate the onset timing of sudden freezing and sudden thawing under several different initial conditions. The phenomenon of permanent freezing for entanglement is also found. We also identify a non-trivial upper limit for the sum of three individual entanglements, which exposes the concept of entanglement sharing in a shrunken "volume". Further analyses about freezing and thawing processes reveal quantitative and qualitative laws of entanglement sharing.

quant-ph↗

arXiv2020

Ultrafast non-volatile flash memory based on van der Waals heterostructures

Flash memory has become a ubiquitous solid-state memory device, it is widely used in portable digital devices, computers, and enterprise applications. The development of the information age has put forward higher requirements for memory speed and retention performance. Here, we demonstrate an ultrafast non-volatile memory based on MoS2/h-BN/multi-layer graphene (MLG) van der Waals heterostructures, which has an atomic-level flat interface and achieves ultrafast writing/erasing speed (~20 ns), surpassing the reported state-of-the-art flash memory (~100 ns). The ultrafast flash memory could lay the foundation for the next-generation of high-speed non-volatile memory.

physics.app-ph↗

arXiv2020

Planimation

Planimation is a modular and extensible open source framework to visualise sequential solutions of planning problems specified in PDDL. We introduce a preliminary declarative PDDL-like animation profile specification, expressive enough to synthesise animations of arbitrary initial states and goals of a benchmark with just a single profile.

cs.AI↗

arXiv2020

Minimax designs for causal effects in temporal experiments with treatment habituation

Randomized experiments are the gold standard for estimating the causal effects of an intervention. In the simplest setting, each experimental unit is randomly assigned to receive treatment or control, and then the outcomes in each treatment arm are compared. In many settings, however, randomized experiments need to be executed over several time periods such that treatment assignment happens at each time period. In such temporal experiments, it has been observed that the effects of an intervention on a given unit may be large when the unit is first exposed to it, but then it often attenuates, or even vanishes, after repeated exposures. This phenomenon is typically due to units' habituation to the intervention, or some other general form of learning, such as when users gradually start to ignore repeated mails sent by a promotional campaign. This paper proposes randomized designs for estimating causal effects in temporal experiments when habituation is present. We show that our designs are minimax optimal in a large class of practical designs. Our analysis is based on the randomization framework of causal inference, and imposes no parametric modeling assumptions on the outcomes.

stat.ME↗

arXiv2020

DeepEDN: A Deep Learning-based Image Encryption and Decryption Network for Internet of Medical Things

Internet of Medical Things (IoMT) can connect many medical imaging equipments to the medical information network to facilitate the process of diagnosing and treating for doctors. As medical image contains sensitive information, it is of importance yet very challenging to safeguard the privacy or security of the patient. In this work, a deep learning based encryption and decryption network (DeepEDN) is proposed to fulfill the process of encrypting and decrypting the medical image. Specifically, in DeepEDN, the Cycle-Generative Adversarial Network (Cycle-GAN) is employed as the main learning network to transfer the medical image from its original domain into the target domain. Target domain is regarded as a "Hidden Factors" to guide the learning model for realizing the encryption. The encrypted image is restored to the original (plaintext) image through a reconstruction network to achieve an image decryption. In order to facilitate the data mining directly from the privacy-protected environment, a region of interest(ROI)-mining-network is proposed to extract the interested object from the encrypted image. The proposed DeepEDN is evaluated on the chest X-ray dataset. Extensive experimental results and security analysis show that the proposed method can achieve a high level of security with a good performance in efficiency.

cs.CR↗

arXiv2020

TSception: A Deep Learning Framework for Emotion Detection Using EEG

In this paper, we propose a deep learning framework, TSception, for emotion detection from electroencephalogram (EEG). TSception consists of temporal and spatial convolutional layers, which learn discriminative representations in the time and channel domains simultaneously. The temporal learner consists of multi-scale 1D convolutional kernels whose lengths are related to the sampling rate of the EEG signal, which learns multiple temporal and frequency representations. The spatial learner takes advantage of the asymmetry property of emotion responses at the frontal brain area to learn the discriminative representations from the left and right hemispheres of the brain. In our study, a system is designed to study the emotional arousal in an immersive virtual reality (VR) environment. EEG data were collected from 18 healthy subjects using this system to evaluate the performance of the proposed deep learning network for the classification of low and high emotional arousal states. The proposed method is compared with SVM, EEGNet, and LSTM. TSception achieves a high classification accuracy of 86.03%, which outperforms the prior methods significantly (p<0.05). The code is available at https://github.com/deepBrains/TSception

eess.SP↗

arXiv2020

Dynamical systems theory for causal inference with application to synthetic control methods

In this paper, we adopt results in nonlinear time series analysis for causal inference in dynamical settings.~Our motivation is policy analysis with panel data, particularly through the use of "synthetic control" methods. These methods regress pre-intervention outcomes of the treated unit to outcomes from a pool of control units, and then use the fitted regression model to estimate causal effects post-intervention. In this setting, we propose to screen out control units that have a weak dynamical relationship to the treated unit. In simulations, we show that this method can mitigate bias from "cherry-picking" of control units, which is usually an important concern. We illustrate on real-world applications, including the tobacco legislation example of \citet{Abadie2010}, and Brexit.

stat.ME↗

arXiv2019

Multi-state Operating Reserve Model of Aggregate Thermostatically-Controlled-Loads for Power System Short-Term Reliability Evaluation

Thermostatically-controlled-loads (TCLs) have been regarded as a good candidate for maintaining the power system reliability by providing operating reserve. The short-term reliability evaluation of power systems, which is essential for power system operators in decision making to secure the system real time balancing, calls for the accurate modelling of operating reserve provided by TCLs. However, the particular characteristics of TCLs make their dynamic response different from the traditional generating units, resulting in difficulties to accurately represent the reliability of operating reserve provided by TCLs with conventional reliability model. This paper proposes a novel multi-state reliability model of operating reserve provided by TCLs considering their dynamic response during the reserve deployment process. An analytical model for characterizing dynamics of operating reserve provided by TCLs is firstly developed based on the migration of TCLs' room temperature within the temperature hysteresis band. Then, considering the stochastic consumers' behaviour and ambient temperature, the probability distribution functions of reserve capacity provided by TCLs are obtained by cumulants. On this basis, the states of reserve capacity and the corresponding probabilities at each time instant are obtained for representing the reliability of operating reserve provided by TCLs in the LZ-transform approach. Case studies are conducted to validate the proposed technique.

math.OC↗

arXiv2019

Improving Sepsis Treatment Strategies by Combining Deep and Kernel-Based Reinforcement Learning

Sepsis is the leading cause of mortality in the ICU. It is challenging to manage because individual patients respond differently to treatment. Thus, tailoring treatment to the individual patient is essential for the best outcomes. In this paper, we take steps toward this goal by applying a mixture-of-experts framework to personalize sepsis treatment. The mixture model selectively alternates between neighbor-based (kernel) and deep reinforcement learning (DRL) experts depending on patient's current history. On a large retrospective cohort, this mixture-based approach outperforms physician, kernel only, and DRL-only experts.

cs.LG↗

arXiv2018

Evaluating Reinforcement Learning Algorithms in Observational Health Settings

Much attention has been devoted recently to the development of machine learning algorithms with the goal of improving treatment policies in healthcare. Reinforcement learning (RL) is a sub-field within machine learning that is concerned with learning how to make sequences of decisions so as to optimize long-term effects. Already, RL algorithms have been proposed to identify decision-making strategies for mechanical ventilation, sepsis management and treatment of schizophrenia. However, before implementing treatment policies learned by black-box algorithms in high-stakes clinical decision problems, special care must be taken in the evaluation of these policies. In this document, our goal is to expose some of the subtleties associated with evaluating RL algorithms in healthcare. We aim to provide a conceptual starting point for clinical and computational researchers to ask the right questions when designing and evaluating algorithms for new ways of treating patients. In the following, we describe how choices about how to summarize a history, variance of statistical estimators, and confounders in more ad-hoc measures can result in unreliable, even misleading estimates of the quality of a treatment policy. We also provide suggestions for mitigating these effects---for while there is much promise for mining observational health data to uncover better treatment policies, evaluation must be performed thoughtfully.

cs.LG↗

arXiv2018

RUN:Residual U-Net for Computer-Aided Detection of Pulmonary Nodules without Candidate Selection

The early detection and early diagnosis of lung cancer are crucial to improve the survival rate of lung cancer patients. Pulmonary nodules detection results have a significant impact on the later diagnosis. In this work, we propose a new network named RUN to complete nodule detection in a single step by bypassing the candidate selection. The system introduces the shortcut of the residual network to improve the traditional U-Net, thereby solving the disadvantage of poor results due to its lack of depth. Furthermore, we compare the experimental results with the traditional U-Net. We validate our method in LUng Nodule Analysis 2016 (LUNA16) Nodule Detection Challenge. We acquire a sensitivity of 90.90% at 2 false positives per scan and therefore achieve better performance than the current state-of-the-art approaches.

cs.CV↗

arXiv2018

Multiresolution Kernel Approximation for Gaussian Process Regression

Gaussian process regression generally does not scale to beyond a few thousands data points without applying some sort of kernel approximation method. Most approximations focus on the high eigenvalue part of the spectrum of the kernel matrix, $K$, which leads to bad performance when the length scale of the kernel is small. In this paper we introduce Multiresolution Kernel Approximation (MKA), the first true broad bandwidth kernel approximation algorithm. Important points about MKA are that it is memory efficient, and it is a direct method, which means that it also makes it easy to approximate $K^{-1}$ and $\mathop{\textrm{det}}(K)$.

stat.ML↗

arXiv2016

Adaptive Subgradient Methods for Online AUC Maximization

Learning for maximizing AUC performance is an important research problem in Machine Learning and Artificial Intelligence. Unlike traditional batch learning methods for maximizing AUC which often suffer from poor scalability, recent years have witnessed some emerging studies that attempt to maximize AUC by single-pass online learning approaches. Despite their encouraging results reported, the existing online AUC maximization algorithms often adopt simple online gradient descent approaches that fail to exploit the geometrical knowledge of the data observed during the online learning process, and thus could suffer from relatively larger regret. To address the above limitation, in this work, we explore a novel algorithm of Adaptive Online AUC Maximization (AdaOAM) which employs an adaptive gradient method that exploits the knowledge of historical gradients to perform more informative online learning. The new adaptive updating strategy of the AdaOAM is less sensitive to the parameter settings and maintains the same time complexity as previous non-adaptive counterparts. Additionally, we extend the algorithm to handle high-dimensional sparse data (SAdaOAM) and address sparsity in the solution by performing lazy gradient updating. We analyze the theoretical bounds and evaluate their empirical performance on various types of data sets. The encouraging empirical results obtained clearly highlighted the effectiveness and efficiency of the proposed algorithms.

cs.LG↗

arXiv2014

Impact of Equipment Failures and Wind Correlation on Generation Expansion Planning

Generation expansion planning has become a complex problem within a deregulated electricity market environment due to all the uncertainties affecting the profitability of a given investment. Current expansion models usually overlook some of these uncertainties in order to reduce the computational burden. In this paper, we raise a flag on the importance of both equipment failures (units and lines) and wind power correlation on generation expansion decisions. For this purpose, we use a bilevel stochastic optimization problem, which models the sequential and noncooperative game between the generating company (GENCO) and the system operator. The upper-level problem maximizes the GENCO's expected profit, while the lower-level problem simulates an hourly market-clearing procedure, through which LMPs are determined. The uncertainty pertaining to failures and wind power correlation are characterized by a scenario set, and their impact on generation expansion decisions are quantified and discussed for a 24-bus power system.

math.OC↗