arXiv subjects

Ning Zhang

Publications and source records attributed to Ning Zhang.

At least 307 records · Page 17Linked to original sources

arXiv2019

Mini Lesions Detection on Diabetic Retinopathy Images via Large Scale CNN Features

Diabetic retinopathy (DR) is a diabetes complication that affects eyes. DR is a primary cause of blindness in working-age people and it is estimated that 3 to 4 million people with diabetes are blinded by DR every year worldwide. Early diagnosis have been considered an effective way to mitigate such problem. The ultimate goal of our research is to develop novel machine learning techniques to analyze the DR images generated by the fundus camera for automatically DR diagnosis. In this paper, we focus on identifying small lesions on DR fundus images. The results from our analysis, which include the lesion category and their exact locations in the image, can be used to facilitate the determination of DR severity (indicated by DR stages). Different from traditional object detection for natural images, lesion detection for fundus images have unique challenges. Specifically, the size of a lesion instance is usually very small, compared with the original resolution of the fundus images, making them diffcult to be detected. We analyze the lesion-vs-image scale carefully and propose a large-size feature pyramid network (LFPN) to preserve more image details for mini lesion instance detection. Our method includes an effective region proposal strategy to increase the sensitivity. The experimental results show that our proposed method is superior to the original feature pyramid network (FPN) method and Faster RCNN.

cs.CV↗

arXiv2019

On the sure screening properties of iteratively sure independence screening algorithms

Fan and Lv (2008) proposed the path-breaking theory of sure independence screening (SIS) and an iterative algorithm (ISIS) to effectively reduce the predictor dimension for further variable selection approaches. Fan et al. (2009) extended ISIS to generalized linear models and introduced the Vanilla ISIS (Van-ISIS) algorithm, allowing selected predictors to be screened out in upcoming iterations. The success of SIS depends on its sure screening property, which was obtained by Fan and Lv (2008) under the marginal correlation assumption. However, despite wide applications of ISIS and Van-ISIS in various scientific fields, their sure screening properties have not been proved during the past decade. To fill this gap, we prove the sure screening properties of three different types of iterative algorithms for linear models without relying on the marginal correlation assumption, where ISIS and Van-ISIS can be regarded as two special cases of them.

math.ST↗

arXiv2019

A Linear LMP Model for Active and Reactive Power with Power Loss

Pricing the reactive power is more necessary than ever before because of the increasing challenge of renewable energy integration on reactive power balance and voltage control. However, reactive power price is hard to be efficiently calculated because of the non-linear nature of optimal AC power flow equation. This paper proposes a linear model to calculate active and reactive power LMP simultaneously considering power loss. Firstly, a linearized AC power flow equation is proposed based on an augmented Generation Shift Distribution Factors (GSDF) matrix. Secondly, a linearized LMP model is derived using GSDF and loss factors. The formulation of LMP is further decomposed into four components: energy, congestion, voltage limitation and power loss. Finally, an iterate algorithm is proposed for calculating LMP with the proposed model. The performance of the proposed model is validated by the IEEE-118 bus system.

eess.SY↗

arXiv2019

AFP-Net: Realtime Anchor-Free Polyp Detection in Colonoscopy

Colorectal cancer (CRC) is a common and lethal disease. Globally, CRC is the third most commonly diagnosed cancer in males and the second in females. For colorectal cancer, the best screening test available is the colonoscopy. During a colonoscopic procedure, a tiny camera at the tip of the endoscope generates a video of the internal mucosa of the colon. The video data are displayed on a monitor for the physician to examine the lining of the entire colon and check for colorectal polyps. Detection and removal of colorectal polyps are associated with a reduction in mortality from colorectal cancer. However, the miss rate of polyp detection during colonoscopy procedure is often high even for very experienced physicians. The reason lies in the high variation of polyp in terms of shape, size, textural, color and illumination. Though challenging, with the great advances in object detection techniques, automated polyp detection still demonstrates a great potential in reducing the false negative rate while maintaining a high precision. In this paper, we propose a novel anchor free polyp detector that can localize polyps without using predefined anchor boxes. To further strengthen the model, we leverage a Context Enhancement Module and Cosine Ground truth Projection. Our approach can respond in real time while achieving state-of-the-art performance with 99.36% precision and 96.44% recall.

eess.IV↗

arXiv2019

Probabilistic duck curve in high PV penetration power system: Concept, modeling, and empirical analysis in China

The high penetration of photovoltaic (PV) is reshaping the electricity net-load curve and has a significant impact on power system operation and planning. The concept of duck curve is widely used to describe the timing imbalance between peak demand and PV generation. The traditional duck curve is deterministic and only shows a single extreme or typical scenario during a day. Thus, it cannot capture both the probability of that scenario and the uncertainty of PV generation and loads. These weaknesses limit the application of the duck curve on power system planning under high PV penetration. To address this issue, the novel concepts of probabilistic duck curve (PDC) and probabilistic ramp curve (PRC) are proposed to accurately model the uncertainty and variability of electricity net load and ramp under high PV penetration. An efficient method is presented for modeling PDC and PRC using kernel density estimation, copula function, and dependent discrete convolution. Several indices are designed to quantify the characteristics of the PDC and PRC. For the application, we demonstrate how the PDC and PRC will benefit flexible resource planning. Finally, an empirical study on the Qinghai provincial power system of China validates the effectiveness of the presented method. The results of PDC and PRC intuitively illustrate that the ramp demand and the valley of net load face considerable uncertainty under high PV penetration. The results of flexible resource planning indicate that retrofitting coal-fired units has remarkable performance on enhancing the power system flexibility in Qinghai. In average, reducing the minimal output of coal-fired units by 1 MW will increase PV accommodation by over 4 MWh each day.

eess.SY↗

arXiv2019

Measurement of frequency sensitivity coefficient and evaluation of type-B uncertainty for atomic frequency standard based on statistical correlation of noise

Precise measurement of frequency sensitivity coefficients (FSCs) of some physical effects contributing to uncertainty is an important work in type-B uncertainty (u_B) evaluation of atomic frequency standards. We proposed a method based on statistical correlation of noise to measure FSCs and evaluate u_B for atomic frequency standards, and giving a full statistical expression of FSC as K_I=COV_A(y,x_I)/(sigma(x_I))^2 , where y and x_I are fractional frequency of atomic frequency standards and noise independent variable of Ith physical effects, respectively. The confidence value and the effect of time interval have also been discussed. Except for theoretical derivation, the method also has been validated by numerical simulation and demonstration experiments. Comparing with standard method, the statistical correlation of noise method combines u_B evaluation with type-A uncertainty (u_A), measures FSCs not by special experiments, but from the monitoring data when the device is running. It not only gives a criterion to test the standard method, but also can evaluate many effects at the same time when the device is operating. The method can be extended to other precision measurement fields and is available to comprehend the physical effectiveness of the least square method.

quant-ph↗

arXiv2019

Fast mmwave Beam Alignment via Correlated Bandit Learning

Beam alignment (BA) is to ensure the transmitter and receiver beams are accurately aligned to establish a reliable communication link in millimeter-wave (mmwave) systems. Existing BA methods search the entire beam space to identify the optimal transmit-receive beam pair, which incurs significant BA latency on the order of seconds in the worst case. In this paper, we develop a learning algorithm to reduce BA latency, namely Hierarchical Beam Alignment (HBA) algorithm. We first formulate the BA problem as a stochastic multi-armed bandit problem with the objective to maximize the cumulative received signal strength within a certain period. The proposed algorithm takes advantage of the correlation structure among beams such that the information from nearby beams is extracted to identify the optimal beam, instead of searching the entire beam space. Furthermore, the prior knowledge on the channel fluctuation is incorporated in the proposed algorithm to further accelerate the BA process. Theoretical analysis indicates that the proposed algorithm is asymptotically optimal. Extensive simulation results demonstrate that the proposed algorithm can identify the optimal beam with a high probability and reduce the BA latency from hundreds of milliseconds to a few milliseconds in the multipath channel, as compared to the existing BA method in IEEE 802.11ad.

eess.SP↗

arXiv2019

3D Anchor-Free Lesion Detector on Computed Tomography Scans

Lesions are injuries and abnormal tissues in the human body. Detecting lesions in 3D Computed Tomography (CT) scans can be time-consuming even for very experienced physicians and radiologists. In recent years, CNN based lesion detectors have demonstrated huge potentials. Most of current state-of-the-art lesion detectors employ anchors to enumerate all possible bounding boxes with respect to the dataset in process. This anchor mechanism greatly improves the detection performance while also constraining the generalization ability of detectors. In this paper, we propose an anchor-free lesion detector. The anchor mechanism is removed and lesions are formalized as single keypoints. By doing so, we witness a considerable performance gain in terms of both accuracy and inference speed compared with the anchor-based baseline

cs.CV↗

arXiv2019

Dynamic Kernel Distillation for Efficient Pose Estimation in Videos

Existing video-based human pose estimation methods extensively apply large networks onto every frame in the video to localize body joints, which suffer high computational cost and hardly meet the low-latency requirement in realistic applications. To address this issue, we propose a novel Dynamic Kernel Distillation (DKD) model to facilitate small networks for estimating human poses in videos, thus significantly lifting the efficiency. In particular, DKD introduces a light-weight distillator to online distill pose kernels via leveraging temporal cues from the previous frame in a one-shot feed-forward manner. Then, DKD simplifies body joint localization into a matching procedure between the pose kernels and the current frame, which can be efficiently computed via simple convolution. In this way, DKD fast transfers pose knowledge from one frame to provide compact guidance for body joint localization in the following frame, which enables utilization of small networks in video-based pose estimation. To facilitate the training process, DKD exploits a temporally adversarial training strategy that introduces a temporal discriminator to help generate temporally coherent pose kernels and pose estimation results within a long range. Experiments on Penn Action and Sub-JHMDB benchmarks demonstrate outperforming efficiency of DKD, specifically, 10x flops reduction and 2x speedup over previous best model, and its state-of-the-art accuracy.

cs.CV↗

arXiv2019

Laplace Landmark Localization

Landmark localization in images and videos is a classic problem solved in various ways. Nowadays, with deep networks prevailing throughout machine learning, there are revamped interests in pushing facial landmark detection technologies to handle more challenging data. Most efforts use network objectives based on L1 or L2 norms, which have several disadvantages. First of all, the locations of landmarks are determined from generated heatmaps (i.e., confidence maps) from which predicted landmark locations (i.e., the means) get penalized without accounting for the spread: a high scatter corresponds to low confidence and vice-versa. For this, we introduce a LaplaceKL objective that penalizes for a low confidence. Another issue is a dependency on labeled data, which are expensive to obtain and susceptible to error. To address both issues we propose an adversarial training framework that leverages unlabeled data to improve model performance. Our method claims state-of-the-art on all of the 300W benchmarks and ranks second-to-best on the Annotated Facial Landmarks in the Wild (AFLW) dataset. Furthermore, our model is robust with a reduced size: 1/8 the number of channels (i.e., 0.0398MB) is comparable to state-of-that-art in real-time on CPU. Thus, we show that our method is of high practical value to real-life application.

cs.CV↗

arXiv2019

Finding Needles in a Moving Haystack: Prioritizing Alerts with Adversarial Reinforcement Learning

Detection of malicious behavior is a fundamental problem in security. One of the major challenges in using detection systems in practice is in dealing with an overwhelming number of alerts that are triggered by normal behavior (the so-called false positives), obscuring alerts resulting from actual malicious activity. While numerous methods for reducing the scope of this issue have been proposed, ultimately one must still decide how to prioritize which alerts to investigate, and most existing prioritization methods are heuristic, for example, based on suspiciousness or priority scores. We introduce a novel approach for computing a policy for prioritizing alerts using adversarial reinforcement learning. Our approach assumes that the attackers know the full state of the detection system and dynamically choose an optimal attack as a function of this state, as well as of the alert prioritization policy. The first step of our approach is to capture the interaction between the defender and attacker in a game theoretic model. To tackle the computational complexity of solving this game to obtain a dynamic stochastic alert prioritization policy, we propose an adversarial reinforcement learning framework. In this framework, we use neural reinforcement learning to compute best response policies for both the defender and the adversary to an arbitrary stochastic policy of the other. We then use these in a double-oracle framework to obtain an approximate equilibrium of the game, which in turn yields a robust stochastic policy for the defender. Extensive experiments using case studies in fraud and intrusion detection demonstrate that our approach is effective in creating robust alert prioritization policies.

cs.CR↗

arXiv2019

Improving Robustness of ML Classifiers against Realizable Evasion Attacks Using Conserved Features

Machine learning (ML) techniques are increasingly common in security applications, such as malware and intrusion detection. However, ML models are often susceptible to evasion attacks, in which an adversary makes changes to the input (such as malware) in order to avoid being detected. A conventional approach to evaluate ML robustness to such attacks, as well as to design robust ML, is by considering simplified feature-space models of attacks, where the attacker changes ML features directly to effect evasion, while minimizing or constraining the magnitude of this change. We investigate the effectiveness of this approach to designing robust ML in the face of attacks that can be realized in actual malware (realizable attacks). We demonstrate that in the context of structure-based PDF malware detection, such techniques appear to have limited effectiveness, but they are effective with content-based detectors. In either case, we show that augmenting the feature space models with conserved features (those that cannot be unilaterally modified without compromising malicious functionality) significantly improves performance. Finally, we show that feature space models enable generalized robustness when faced with a variety of realizable attacks, as compared to classifiers which are tuned to be robust to a specific realizable attack.

cs.CR↗

arXiv2019

Context-Aware Zero-Shot Recognition

We present a novel problem setting in zero-shot learning, zero-shot object recognition and detection in the context. Contrary to the traditional zero-shot learning methods, which simply infers unseen categories by transferring knowledge from the objects belonging to semantically similar seen categories, we aim to understand the identity of the novel objects in an image surrounded by the known objects using the inter-object relation prior. Specifically, we leverage the visual context and the geometric relationships between all pairs of objects in a single image, and capture the information useful to infer unseen categories. We integrate our context-aware zero-shot learning framework into the traditional zero-shot learning techniques seamlessly using a Conditional Random Field (CRF). The proposed algorithm is evaluated on both zero-shot region classification and zero-shot detection tasks. The results on Visual Genome (VG) dataset show that our model significantly boosts performance with the additional visual context compared to traditional methods.

cs.CV↗

arXiv2019

Throughput Maximization in Two-hop DF Multiple-Relay Network with Simultaneous Wireless Information and Power Transfer

This paper investigates the end-to-end throughput maximization problem for a two-hop multiple-relay network, with relays powered by simultaneous wireless information and power transfer (SWIPT) technique. Nonlinearity of energy harvester at every relay node is taken into account and two models for approximating the nonlinearity are adopted: logistic model and linear cut-off model. Decode-and-forward (DF) is implemented, and time switching (TS) mode and power splitting (PS) mode are considered. Optimization problems are formulated for TS mode and PS mode under logistic model and linear cut-off model, respectively. End-to-end throughput is aimed to be maximized by optimizing the transmit power and bandwidth on every source-relay-destination link, and PS ratio and/or TS ratio on every relay node. Although the formulated optimization problems are all non-convex. Through a series of analysis and transformation, and with the aid of bi-level optimization and monotonic optimization, etc., we find the global optimal solution of every formulated optimization problem. In some case, a simple yet optimal solution of the formulated problem is also derived. Numerical results verify the effectiveness of our proposed methods.

cs.IT↗

arXiv2019

Matrix Modeling of Energy Hub with Variable Energy Efficiencies

The modeling of multi-energy systems (MES) is the basic task of analyzing energy systems integration. The variable energy efficiencies of the energy conversion and storage components in MES introduce nonlinearity to the model and thus complicate the analysis and optimization of MES. In this paper, we propose a standardized matrix modeling approach to automatically model MES with variable energy efficiencies based on the energy hub (EH) modeling framework. We use piecewise linearization to approximate the variable energy efficiencies; as a result, a component with variable efficiency is equivalent to several parallel components with constant efficiencies. The nonlinear energy conversion and storage relationship in EH can thus be further modeled under a linear modeling framework using matrices. Such matrix modeling approach makes the modeling of an arbitrary EH with nonlinear energy components highly automated by computers. The proposed modeling approach can further facilitate the operation and planning optimization of EH with variable efficiencies. Case studies are presented to show how the nonlinear approximation accuracy and calculation efficiency can be balanced using the proposed model in the optimal operation of EH.

math.OC↗

arXiv2019

A Unified Algorithmic Framework of Symmetric Gauss-Seidel Decomposition based Proximal ADMMs for Convex Composite Programming

This paper aims to present a fairly accessible generalization of several symmetric Gauss-Seidel decomposition based multi-block proximal alternating direction methods of multipliers (ADMMs) for convex composite optimization problems. The proposed method unifies and refines many constructive techniques that were separately developed for the computational efficiency of multi-block ADMM-type algorithms. Specifically, the majorized augmented Lagrangian functions, the indefinite proximal terms, the inexact symmetric Gauss-Seidel decomposition theorem, the tolerance criteria of approximately solving the subproblems, and the large dual step-lengths, are all incorporated in one algorithmic framework, which we named as sGS-imiPADMM. From the popularity of convergent variants of multi-block ADMMs in recent years, especially for high-dimensional multi-block convex composite conic programming problems, the unification presented in this paper, as well as the corresponding convergence results, may have the great potential of facilitating the implementation of many multi-block ADMMs in various problem settings.

math.OC↗

arXiv2019

An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems

Nowadays, analysing data from different classes or over a temporal grid has attracted a great deal of interest. As a result, various multiple graphical models for learning a collection of graphical models simultaneously have been derived by introducing sparsity in graphs and similarity across multiple graphs. This paper focuses on the fused multiple graphical Lasso model which encourages not only shared pattern of sparsity, but also shared values of edges across different graphs. For solving this model, we develop an efficient regularized proximal point algorithm, where the subproblem in each iteration of the algorithm is solved by a superlinearly convergent semismooth Newton method. To implement the semismooth Newton method, we derive an explicit expression for the generalized Jacobian of the proximal mapping of the fused multiple graphical Lasso regularizer. Unlike those widely used first order methods, our approach has heavily exploited the underlying second order information through the semismooth Newton method. This can not only accelerate the convergence of the algorithm, but also improve its robustness. The efficiency and robustness of our proposed algorithm are demonstrated by comparing with some state-of-the-art methods on both synthetic and real data sets. Supplementary materials for this article are available online.

math.OC↗

arXiv2018

Nanoscale Self-Healing Mechanisms in Shape Memory Ceramics

Shape memory (SM) ceramics, such as yttria-stabilized tetragonal zirconia (YSTZ), are a unique family of SM materials that offer unique properties including ultra-high operating temperature, and high resistance to chemical corrosion and oxidation. However, formation of defects is usually observed in SM ceramics during manufacturing and/or by mechanical deformation. To fully take advantage of the SM properties of these ceramics, it is necessary to fully understand the nano-structural evolution of defects under external stimuli. In this study, defect closure behaviors in YSTZ nanopillars are investigated by atomistic simulations. Two characteristic orientations of [011-] and [001] are selected to represent the dominant deformation mechanisms of phase transformation and dislocation migration, respectively. With the presence of crack and void, the strength and yield strain of nanopillars are noted to decrease significantly, especially for [011-]-oriented YSTZ nanopillars. Volume expansion associated with the tetragonal to monoclinic phase transformation is observed to promote healing of crack and void. Atom stress analyses reveal stress concentrations along the newly formed monoclinic phase bands. A critical crack width is identified, less than which the crack can be fully closed in compression. Size effect study reveals that an increase in nanopillar size has a positive effect on crack self-healing behavior. For [001]-oriented YSTZ nanopillars, dislocation migration leads to formations of an amorphous phase, which also assist the crack and void closure process. The revealed crack/void healing mechanisms may provide a path for mitigating internal defects that influences the mechanical properties and deformation mechanisms of SM ceramics.

cond-mat.mtrl-sci↗