arXiv subjects

Jie Yang

Publications and source records attributed to Jie Yang.

At least 595 records · Page 33Linked to original sources

arXiv2019

High Speed Continuous Variable Source-Independent Quantum Random Number Generation

As a fundamental phenomenon in nature, randomness has a wide range of applications in the fields of science and engineering. Among different types of random number generators (RNG), quantum random number generator (QRNG) is a kind of promising RNG as it can provide provable true random numbers based on the inherent randomness of fundamental quantum processes. Nevertheless, the randomness from a QRNG can be diminished (or even destroyed) if the devices (especially the entropy source devices) are not perfect or ill-characterized. To eliminate the practical security loopholes from the source, source-independent QRNGs, which allow the source to have arbitrary and unknown dimensions, have been introduced and become one of the most important semi-device-independent QRNGs. Herein a method that enables ultra-fast unpredictable quantum random number generation from quadrature fluctuations of quantum optical field without any assumptions on the input states is proposed. Particularly, to estimate a lower bound on the extractable randomness that is independent from side information held by an eavesdropper, a new security analysis framework is established based on the extremality of Gaussian states, which can be easily extended to design and analyze new semi-device-independent continuous variable QRNG protocols. Moreover, the practical imperfections of the QRNG including the effects of excess noise, finite sampling range, finite resolution and asymmetric conjugate quadratures are taken into account and quantitatively analyzed. Finally, the proposed method is experimentally demonstrated to obtain high secure random number generation rates of 15.07 Gbits/s in off-line configuration and can potentially achieve 6 Gbits/s by real-time post-processing.

quant-ph↗

arXiv2019

Light-Induced Charge Density Wave in LaTe$_3$

When electrons in a solid are excited with light, they can alter the free energy landscape and access phases of matter that are beyond reach in thermal equilibrium. This accessibility becomes of vast importance in the presence of phase competition, when one state of matter is preferred over another by only a small energy scale that, in principle, is surmountable by light. Here, we study a layered compound, LaTe$_3$, where a small in-plane (a-c plane) lattice anisotropy results in a unidirectional charge density wave (CDW) along the c-axis. Using ultrafast electron diffraction, we find that after photoexcitation, the CDW along the c-axis is weakened and subsequently, a different competing CDW along the a-axis emerges. The timescales characterizing the relaxation of this new CDW and the reestablishment of the original CDW are nearly identical, which points towards a strong competition between the two orders. The new density wave represents a transient non-equilibrium phase of matter with no equilibrium counterpart, and this study thus provides a framework for unleashing similar states of matter that are "trapped" under equilibrium conditions.

cond-mat.mtrl-sci↗

arXiv2019

Robust Visual Tracking Revisited: From Correlation Filter to Template Matching

In this paper, we propose a novel matching based tracker by investigating the relationship between template matching and the recent popular correlation filter based trackers (CFTs). Compared to the correlation operation in CFTs, a sophisticated similarity metric termed "mutual buddies similarity" (MBS) is proposed to exploit the relationship of multiple reciprocal nearest neighbors for target matching. By doing so, our tracker obtains powerful discriminative ability on distinguishing target and background as demonstrated by both empirical and theoretical analyses. Besides, instead of utilizing single template with the improper updating scheme in CFTs, we design a novel online template updating strategy named "memory filtering" (MF), which aims to select a certain amount of representative and reliable tracking results in history to construct the current stable and expressive template set. This scheme is beneficial for the proposed tracker to comprehensively "understand" the target appearance variations, "recall" some stable results. Both qualitative and quantitative evaluations on two benchmarks suggest that the proposed tracking method performs favorably against some recently developed CFTs and other competitive trackers.

cs.CV↗

arXiv2019

A Regularization Approach for Instance-Based Superset Label Learning

Different from the traditional supervised learning in which each training example has only one explicit label, superset label learning (SLL) refers to the problem that a training example can be associated with a set of candidate labels, and only one of them is correct. Existing SLL methods are either regularization-based or instance-based, and the latter of which has achieved state-of-the-art performance. This is because the latest instance-based methods contain an explicit disambiguation operation that accurately picks up the groundtruth label of each training example from its ambiguous candidate labels. However, such disambiguation operation does not fully consider the mutually exclusive relationship among different candidate labels, so the disambiguated labels are usually generated in a nondiscriminative way, which is unfavorable for the instance-based methods to obtain satisfactory performance. To address this defect, we develop a novel regularization approach for instance-based superset label (RegISL) learning so that our instance-based method also inherits the good discriminative ability possessed by the regularization scheme. Specifically, we employ a graph to represent the training set, and require the examples that are adjacent on the graph to obtain similar labels. More importantly, a discrimination term is proposed to enlarge the gap of values between possible labels and unlikely labels for every training example. As a result, the intrinsic constraints among different candidate labels are deployed, and the disambiguated labels generated by RegISL are more discriminative and accurate than those output by existing instance-based algorithms. The experimental results on various tasks convincingly demonstrate the superiority of our RegISL to other typical SLL methods in terms of both training accuracy and test accuracy.

cs.CV↗

arXiv2019

Ultrafast decoupling of atomic sublattices in a charge-density-wave material

Atomic rearrangements within crystals lie at the foundation of electron-phonon-coupled phenomena such as metal-insulator transition and superconductivity. Advanced laser-pump-probe studies have recently focused on various charge-density-wave (CDW) materials to sharpen our understanding of the charge-lattice entanglement, where non-thermal melting of the CDW state is evident from the enhanced Bragg diffraction peak intensities - attributed to the dominance of the metal-atom dynamics over the nonmetal-anion one. Here using ultrafast MeV electron diffraction on the prototypical CDW material 1T-TaSeTe, we observe an unusual coexistence of systematically enhanced and suppressed Bragg peak intensities upon the CDW suppression, indicating a dominance of nonmetal-anion dynamics during photoexcitation. By tracking these atomic trajectories quantitatively through the ultrafast process, we identify a transient state that manifests itself as an unexpected decoupling of the Ta and Se/Te sublattices. These findings unambiguously unveil a new kind of laser manipulations of lattice order parameters, which has potentials in creating new quantum states and discerning hidden phases such as intra-unit-cell orders.

cond-mat.mtrl-sci↗

arXiv2019

Varifocal-Net: A Chromosome Classification Approach using Deep Convolutional Networks

Chromosome classification is critical for karyotyping in abnormality diagnosis. To expedite the diagnosis, we present a novel method named Varifocal-Net for simultaneous classification of chromosome's type and polarity using deep convolutional networks. The approach consists of one global-scale network (G-Net) and one local-scale network (L-Net). It follows three stages. The first stage is to learn both global and local features. We extract global features and detect finer local regions via the G-Net. By proposing a varifocal mechanism, we zoom into local parts and extract local features via the L-Net. Residual learning and multi-task learning strategies are utilized to promote high-level feature extraction. The detection of discriminative local parts is fulfilled by a localization subnet of the G-Net, whose training process involves both supervised and weakly-supervised learning. The second stage is to build two multi-layer perceptron classifiers that exploit features of both two scales to boost classification performance. The third stage is to introduce a dispatch strategy of assigning each chromosome to a type within each patient case, by utilizing the domain knowledge of karyotyping. Evaluation results from 1909 karyotyping cases showed that the proposed Varifocal-Net achieved the highest accuracy per patient case (%) 99.2 for both type and polarity tasks. It outperformed state-of-the-art methods, demonstrating the effectiveness of our varifocal mechanism, multi-scale feature ensemble, and dispatch strategy. The proposed method has been applied to assist practical karyotype diagnosis.

cs.CV↗

arXiv2019

Dynamical slowing down in an ultrafast photo-induced phase transition

Complex systems, which consist of a large number of interacting constituents, often exhibit universal behavior near a phase transition. A slowdown of certain dynamical observables is one such recurring feature found in a vast array of contexts. This phenomenon, known as critical slowing down, is well studied mostly in thermodynamic phase transitions. However, it is less understood in highly nonequilibrium settings, where the time it takes to traverse the phase boundary becomes comparable to the timescale of dynamical fluctuations. Using transient optical spectroscopy and femtosecond electron diffraction, we studied a photo-induced transition of a model charge-density-wave (CDW) compound, LaTe$_3$. We observed that it takes the longest time to suppress the order parameter at the threshold photoexcitation density, where the CDW transiently vanishes. This finding can be quantitatively captured by generalizing the time-dependent Landau theory to a system far from equilibrium. The experimental observation and theoretical understanding of dynamical slowing down may offer insight into other general principles behind nonequilibrium phase transitions in many-body systems.

cond-mat.str-el↗

arXiv2019

A New Nonparametric Estimate of the Risk-Neutral Density with Applications to Variance Swaps

We develop a new nonparametric approach for estimating the risk-neutral density of asset prices and reformulate its estimation into a double-constrained optimization problem. We evaluate our approach using the S\&P 500 market option prices from 1996 to 2015. A comprehensive cross-validation study shows that our approach outperforms the existing nonparametric quartic B-spline and cubic spline methods, as well as the parametric method based on the Normal Inverse Gaussian distribution. As an application, we use the proposed density estimator to price long-term variance swaps, and the model-implied prices match reasonably well with those of the variance future downloaded from the CBOE website.

q-fin.PR↗

arXiv2019

Online PCB Defect Detector On A New PCB Defect Dataset

Previous works for PCB defect detection based on image difference and image processing techniques have already achieved promising performance. However, they sometimes fall short because of the unaccounted defect patterns or over-sensitivity about some hyper-parameters. In this work, we design a deep model that accurately detects PCB defects from an input pair of a detect-free template and a defective tested image. A novel group pyramid pooling module is proposed to efficiently extract features of a large range of resolutions, which are merged by group to predict PCB defect of corresponding scales. To train the deep model, a dataset is established, namely DeepPCB, which contains 1,500 image pairs with annotations including positions of 6 common types of PCB defects. Experiment results validate the effectiveness and efficiency of the proposed model by achieving $98.6\%$ mAP @ 62 FPS on DeepPCB dataset. This dataset is now available at: https://github.com/tangsanli5201/DeepPCB.

cs.CV↗

arXiv2019

D-optimal Designs for Multinomial Logistic Models

We consider optimal designs for general multinomial logistic models, which cover baseline-category, cumulative, adjacent-categories, and continuation-ratio logit models, with proportional odds, non-proportional odds, or partial proportional odds assumption. We derive the corresponding Fisher information matrices in three different forms to facilitate their calculations, determine the conditions for their positive definiteness, and search for optimal designs. We conclude that, unlike the designs for binary responses, a feasible design for a multinomial logistic model may contain less experimental settings than parameters, which is of practical significance. We also conclude that even for a minimally supported design, a uniform allocation, which is typically used in practice, is not optimal in general for a multinomial logistic model. We develop efficient algorithms for searching D-optimal designs. Using examples based on real experiments, we show that the efficiency of an experiment can be significantly improved if our designs are adopted.

math.ST↗

arXiv2019

Highly Efficient Follicular Segmentation in Thyroid Cytopathological Whole Slide Image

In this paper, we propose a novel method for highly efficient follicular segmentation of thyroid cytopathological WSIs. Firstly, we propose a hybrid segmentation architecture, which integrates a classifier into Deeplab V3 by adding a branch. A large amount of the WSI segmentation time is saved by skipping the irrelevant areas using the classification branch. Secondly, we merge the low scale fine features into the original atrous spatial pyramid pooling (ASPP) in Deeplab V3 to accurately represent the details in cytopathological images. Thirdly, our hybrid model is trained by a criterion-oriented adaptive loss function, which leads the model converging much faster. Experimental results on a collection of thyroid patches demonstrate that the proposed model reaches 80.9% on the segmentation accuracy. Besides, 93% time is reduced for the WSI segmentation by using our proposed method, and the WSI-level accuracy achieves 53.4%.

cs.CV↗

arXiv2019

Decompose to manipulate: Manipulable Object Synthesis in 3D Medical Images with Structured Image Decomposition

The performance of medical image analysis systems is constrained by the quantity of high-quality image annotations. Such systems require data to be annotated by experts with years of training, especially when diagnostic decisions are involved. Such datasets are thus hard to scale up. In this context, it is hard for supervised learning systems to generalize to the cases that are rare in the training set but would be present in real-world clinical practices. We believe that the synthetic image samples generated by a system trained on the real data can be useful for improving the supervised learning tasks in the medical image analysis applications. Allowing the image synthesis to be manipulable could help synthetic images provide complementary information to the training data rather than simply duplicating the real-data manifold. In this paper, we propose a framework for synthesizing 3D objects, such as pulmonary nodules, in 3D medical images with manipulable properties. The manipulation is enabled by decomposing of the object of interests into its segmentation mask and a 1D vector containing the residual information. The synthetic object is refined and blended into the image context with two adversarial discriminators. We evaluate the proposed framework on lung nodules in 3D chest CT images and show that the proposed framework could generate realistic nodules with manipulable shapes, textures and locations, etc. By sampling from both the synthetic nodules and the real nodules from 2800 3D CT volumes during the classifier training, we show the synthetic patches could improve the overall nodule detection performance by average 8.44% competition performance metric (CPM) score.

cs.CV↗

arXiv2019

Deep-Learning-based Millimeter-Wave Massive MIMO for Hybrid Precoding

Millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) has been regarded to be an emerging solution for the next generation of communications, in which hybrid analog and digital precoding is an important method for reducing the hardware complexity and energy consumption associated with mixed signal components. However, the fundamental limitations of the existing hybrid precoding schemes is that they have high computational complexity and fail to fully exploit the spatial information. To overcome these limitations, this paper proposes, a deep-learning-enabled mmWave massive MIMO framework for effective hybrid precoding, in which each selection of the precoders for obtaining the optimized decoder is regarded as a mapping relation in the deep neural network (DNN). Specifically, the hybrid precoder is selected through training based on the DNN for optimizing precoding process of the mmWave massive MIMO. Additionally, we present extensive simulation results to validate the excellent performance of the proposed scheme. The results exhibit that the DNN-based approach is capable ofminimizing the bit error ratio (BER) and enhancing spectrum efficiency of the mmWave massive MIMO, which achieves better performance in hybrid precoding compared with conventional schemes while substantially reducing the required computational complexity.

eess.SP↗

arXiv2018

Class-Aware Adversarial Lung Nodule Synthesis in CT Images

Though large-scale datasets are essential for training deep learning systems, it is expensive to scale up the collection of medical imaging datasets. Synthesizing the objects of interests, such as lung nodules, in medical images based on the distribution of annotated datasets can be helpful for improving the supervised learning tasks, especially when the datasets are limited by size and class balance. In this paper, we propose the class-aware adversarial synthesis framework to synthesize lung nodules in CT images. The framework is built with a coarse-to-fine patch in-painter (generator) and two class-aware discriminators. By conditioning on the random latent variables and the target nodule labels, the trained networks are able to generate diverse nodules given the same context. By evaluating on the public LIDC-IDRI dataset, we demonstrate an example application of the proposed framework for improving the accuracy of the lung nodule malignancy estimation as a binary classification problem, which is important in the lung screening scenario. We show that combining the real image patches and the synthetic lung nodules in the training set can improve the mean AUC classification score across different network architectures by 2%.

cs.CV↗

arXiv2018

Discriminative analysis of the human cortex using spherical CNNs - a study on Alzheimer's disease diagnosis

In neuroimaging studies, the human cortex is commonly modeled as a sphere to preserve the topological structure of the cortical surface. Cortical neuroimaging measures hence can be modeled in spherical representation. In this work, we explore analyzing the human cortex using spherical CNNs in an Alzheimer's disease (AD) classification task using cortical morphometric measures derived from structural MRI. Our results show superior performance in classifying AD versus cognitively normal and in predicting MCI progression within two years, using structural MRI information only. This work demonstrates for the first time the potential of the spherical CNNs framework in the discriminative analysis of the human cortex and could be extended to other modalities and other neurological diseases.

cs.CV↗

arXiv2018

Embedding Bilateral Filter in Least Squares for Efficient Edge-preserving Image Smoothing

Edge-preserving smoothing is a fundamental procedure for many computer vision and graphic applications. This can be achieved with either local methods or global methods. In most cases, global methods can yield superior performance over local ones. However, local methods usually run much faster than global ones. In this paper, we propose a new global method that embeds the bilateral filter in the least squares model for efficient edge-preserving smoothing. The proposed method can show comparable performance with the state-of-the-art global method. Meanwhile, since the proposed method can take advantages of the efficiency of the bilateral filter and least squares model, it runs much faster. In addition, we show the flexibility of our method which can be easily extended by replacing the bilateral filter with its variants. They can be further modified to handle more applications. We validate the effectiveness and efficiency of the proposed method through comprehensive experiments in a range of applications.

cs.GR↗

arXiv2018

Hardware-Constrained Millimeter Wave Systems for 5G: Challenges, Opportunities, and Solutions

Although millimeter wave (mmWave) systems promise to offer larger bandwidth and unprecedented peak data rates, their practical implementation faces several hardware challenges compared to sub-6 GHz communication systems. These hardware constraints can seriously undermine the performance and deployment progress of mmWave systems and, thus, necessitate disruptive solutions in the cross-design of analog and digital modules. In this article, we discuss the importance of different hardware constraints and propose a novel system architecture, which is able to release these hardware constraints while achieving better performance for future millimeter wave communication systems. The characteristics of the proposed architecture are articulated in detail, and a representative example is provided to demonstrate its validity and efficacy.

cs.IT↗

arXiv2018

Subword Encoding in Lattice LSTM for Chinese Word Segmentation

We investigate a lattice LSTM network for Chinese word segmentation (CWS) to utilize words or subwords. It integrates the character sequence features with all subsequences information matched from a lexicon. The matched subsequences serve as information shortcut tunnels which link their start and end characters directly. Gated units are used to control the contribution of multiple input links. Through formula derivation and comparison, we show that the lattice LSTM is an extension of the standard LSTM with the ability to take multiple inputs. Previous lattice LSTM model takes word embeddings as the lexicon input, we prove that subword encoding can give the comparable performance and has the benefit of not relying on any external segmentor. The contribution of lattice LSTM comes from both lexicon and pretrained embeddings information, we find that the lexicon information contributes more than the pretrained embeddings information through controlled experiments. Our experiments show that the lattice structure with subword encoding gives competitive or better results with previous state-of-the-art methods on four segmentation benchmarks. Detailed analyses are conducted to compare the performance of word encoding and subword encoding in lattice LSTM. We also investigate the performance of lattice LSTM structure under different circumstances and when this model works or fails.

cs.CL↗