Searcharxiv⌕ Search

arXiv subjects

Li Shen

Publications and source records attributed to Li Shen.

At least 451 records · Page 25Linked to original sources
arXiv2019

Nonlinear optical properties of polycrystalline silicon core fibers from Telecom wavelengths into the mid-infrared spectral region

Polycrystalline silicon core fibers (SCFs) fabricated via the molten core drawing (MCD) method are emerging as a flexible optoelectronic platform. Here, the optical transmission properties of MCD SCFs that have been tapered down to a few micrometer-sized core dimensions are characterized from the Telecom band to the mid-infrared spectal regime. The SCFs exhibit low linear losses on the order of a few dB/cm over the entire wavelength range. Characterization of the two-photon absorption coefficient \b{eta}_TPA and nonlinear refractive index n_2 of the SCFs reveals values consistent with previous measurements of single crystal silicon materials, indicating the high optical quality of the polysilicon core material. The high nonlinear figure of merit obtained for wavelengths above 2μm highlight the potential for these fibers to find application in infrared nonlinear photonics.

physics.optics↗
arXiv2019

Gather-Excite: Exploiting Feature Context in Convolutional Neural Networks

While the use of bottom-up local operators in convolutional neural networks (CNNs) matches well some of the statistics of natural images, it may also prevent such models from capturing contextual long-range feature interactions. In this work, we propose a simple, lightweight approach for better context exploitation in CNNs. We do so by introducing a pair of operators: gather, which efficiently aggregates feature responses from a large spatial extent, and excite, which redistributes the pooled information to local features. The operators are cheap, both in terms of number of added parameters and computational complexity, and can be integrated directly in existing architectures to improve their performance. Experiments on several datasets show that gather-excite can bring benefits comparable to increasing the depth of a CNN at a fraction of the cost. For example, we find ResNet-50 with gather-excite operators is able to outperform its 101-layer counterpart on ImageNet with no additional learnable parameters. We also propose a parametric gather-excite operator pair which yields further performance gains, relate it to the recently-introduced Squeeze-and-Excitation Networks, and analyse the effects of these changes to the CNN feature activation statistics.

cs.CV↗
arXiv2018

Deep Learning to Improve Breast Cancer Early Detection on Screening Mammography

The rapid development of deep learning, a family of machine learning techniques, has spurred much interest in its application to medical imaging problems. Here, we develop a deep learning algorithm that can accurately detect breast cancer on screening mammograms using an "end-to-end" training approach that efficiently leverages training datasets with either complete clinical annotation or only the cancer status (label) of the whole image. In this approach, lesion annotations are required only in the initial training stage, and subsequent stages require only image-level labels, eliminating the reliance on rarely available lesion annotations. Our all convolutional network method for classifying screening mammograms attained excellent performance in comparison with previous methods. On an independent test set of digitized film mammograms from Digital Database for Screening Mammography (DDSM), the best single model achieved a per-image AUC of 0.88, and four-model averaging improved the AUC to 0.91 (sensitivity: 86.1%, specificity: 80.1%). On a validation set of full-field digital mammography (FFDM) images from the INbreast database, the best single model achieved a per-image AUC of 0.95, and four-model averaging improved the AUC to 0.98 (sensitivity: 86.7%, specificity: 96.1%). We also demonstrate that a whole image classifier trained using our end-to-end approach on the DDSM digitized film mammograms can be transferred to INbreast FFDM images using only a subset of the INbreast data for fine-tuning and without further reliance on the availability of lesion annotations. These findings show that automatic deep learning methods can be readily trained to attain high accuracy on heterogeneous mammography platforms, and hold tremendous promise for improving clinical tools to reduce false positive and false negative screening mammography results.

cs.CV↗
arXiv2018

A Hybrid Method of Combinatorial Search and Coordinate Descent for Discrete Optimization

Discrete optimization is a central problem in mathematical optimization with a broad range of applications, among which binary optimization and sparse optimization are two common ones. However, these problems are NP-hard and thus difficult to solve in general. Combinatorial search methods such as branch-and-bound and exhaustive search find the global optimal solution but are confined to small-sized problems, while coordinate descent methods such as coordinate gradient descent are efficient but often suffer from poor local minima. In this paper, we consider a hybrid method that combines the effectiveness of combinatorial search and the efficiency of coordinate descent. Specifically, we consider random strategy or/and greedy strategy to select a subset of coordinates as the working set, and then perform global combinatorial search over the working set based on the original objective function. In addition, we provide some optimality analysis and convergence analysis for the proposed method. Our method finds stronger stationary points than existing methods. Finally, we demonstrate the efficacy of our method on some sparse optimization and binary optimization applications. As a result, our method achieves state-of-the-art performance in terms of accuracy. For example, our method generally outperforms the well-known orthogonal matching pursuit method in sparse optimization. Keywords: Sparsity Optimization, Binary Optimization, Coordinate Descent, Combinatorial Search, Discrete Optimization, Convergence Analysis.

math.OC↗
arXiv2018

Deep Learning for Quality Control of Subcortical Brain 3D Shape Models

We present several deep learning models for assessing the morphometric fidelity of deep grey matter region models extracted from brain MRI. We test three different convolutional neural net architectures (VGGNet, ResNet and Inception) over 2D maps of geometric features. Further, we present a novel geometry feature augmentation technique based on a parametric spherical mapping. Finally, we present an approach for model decision visualization, allowing human raters to see the areas of subcortical shapes most likely to be deemed of failing quality by the machine. Our training data is comprised of 5200 subjects from the ENIGMA Schizophrenia MRI cohorts, and our test dataset contains 1500 subjects from the ENIGMA Major Depressive Disorder cohorts. Our final models reduce human rater time by 46-70%. ResNet outperforms VGGNet and Inception for all of our predictive tasks.

q-bio.NC↗
arXiv2018

Image Registration and Predictive Modeling: Learning the Metric on the Space of Diffeomorphisms

We present a method for metric optimization in the Large Deformation Diffeomorphic Metric Mapping (LDDMM) framework, by treating the induced Riemannian metric on the space of diffeomorphisms as a kernel in a machine learning context. For simplicity, we choose the kernel Fischer Linear Discriminant Analysis (KLDA) as the framework. Optimizing the kernel parameters in an Expectation-Maximization framework, we define model fidelity via the hinge loss of the decision function. The resulting algorithm optimizes the parameters of the LDDMM norm-inducing differential operator as a solution to a group-wise registration and classification problem. In practice, this may lead to a biology-aware registration, focusing its attention on the predictive task at hand such as identifying the effects of disease. We first tested our algorithm on a synthetic dataset, showing that our parameter selection improves registration quality and classification accuracy. We then tested the algorithm on 3D subcortical shapes from the Schizophrenia cohort Schizconnect. Our Schizpohrenia-Control predictive model showed significant improvement in ROC AUC compared to baseline parameters.

cs.CV↗
arXiv2018

Comparator Networks

The objective of this work is set-based verification, e.g. to decide if two sets of images of a face are of the same person or not. The traditional approach to this problem is to learn to generate a feature vector per image, aggregate them into one vector to represent the set, and then compute the cosine similarity between sets. Instead, we design a neural network architecture that can directly learn set-wise verification. Our contributions are: (i) We propose a Deep Comparator Network (DCN) that can ingest a pair of sets (each may contain a variable number of images) as inputs, and compute a similarity between the pair--this involves attending to multiple discriminative local regions (landmarks), and comparing local descriptors between pairs of faces; (ii) To encourage high-quality representations for each set, internal competition is introduced for recalibration based on the landmark score; (iii) Inspired by image retrieval, a novel hard sample mining regime is proposed to control the sampling process, such that the DCN is complementary to the standard image classification models. Evaluations on the IARPA Janus face recognition benchmarks show that the comparator networks outperform the previous state-of-the-art results by a large margin.

cs.CV↗
arXiv2018

An Algorithmic Framework of Variable Metric Over-Relaxed Hybrid Proximal Extra-Gradient Method

We propose a novel algorithmic framework of Variable Metric Over-Relaxed Hybrid Proximal Extra-gradient (VMOR-HPE) method with a global convergence guarantee for the maximal monotone operator inclusion problem. Its iteration complexities and local linear convergence rate are provided, which theoretically demonstrate that a large over-relaxed step-size contributes to accelerating the proposed VMOR-HPE as a byproduct. Specifically, we find that a large class of primal and primal-dual operator splitting algorithms are all special cases of VMOR-HPE. Hence, the proposed framework offers a new insight into these operator splitting algorithms. In addition, we apply VMOR-HPE to the Karush-Kuhn-Tucker (KKT) generalized equation of linear equality constrained multi-block composite convex optimization, yielding a new algorithm, namely nonsymmetric Proximal Alternating Direction Method of Multipliers with a preconditioned Extra-gradient step in which the preconditioned metric is generated by a blockwise Barzilai-Borwein line search technique (PADMM-EBB). We also establish iteration complexities of PADMM-EBB in terms of the KKT residual. Finally, we apply PADMM-EBB to handle the nonnegative dual graph regularized low-rank representation problem. Promising results on synthetic and real datasets corroborate the efficacy of PADMM-EBB.

math.OC↗
arXiv2018

A Generalized Matrix Splitting Algorithm

Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization, $\ell_1$ norm regularized optimization, and $\ell_0$ norm regularized optimization as special cases. This paper proposes and analyzes a new Generalized Matrix Splitting Algorithm (GMSA) for minimizing composite functions. It can be viewed as a generalization of the classical Gauss-Seidel method and the Successive Over-Relaxation method for solving linear systems in the literature. Our algorithm is derived from a novel triangle operator mapping, which can be computed exactly using a new generalized Gaussian elimination procedure. We establish the global convergence, convergence rate, and iteration complexity of GMSA for convex problems. In addition, we also discuss several important extensions of GMSA. Finally, we validate the performance of our proposed method on three particular applications: nonnegative matrix factorization, $\ell_0$ norm regularized sparse coding, and $\ell_1$ norm regularized Dantzig selector problem. Extensive experiments show that our method achieves state-of-the-art performance in term of both efficiency and efficacy.

math.NA↗
arXiv2018

VGGFace2: A dataset for recognising faces across pose and age

In this paper, we introduce a new large-scale face dataset named VGGFace2. The dataset contains 3.31 million images of 9131 subjects, with an average of 362.6 images for each subject. Images are downloaded from Google Image Search and have large variations in pose, age, illumination, ethnicity and profession (e.g. actors, athletes, politicians). The dataset was collected with three goals in mind: (i) to have both a large number of identities and also a large number of images for each identity; (ii) to cover a large range of pose, age and ethnicity; and (iii) to minimize the label noise. We describe how the dataset was collected, in particular the automated and manual filtering stages to ensure a high accuracy for the images of each identity. To assess face recognition performance using the new dataset, we train ResNet-50 (with and without Squeeze-and-Excitation blocks) Convolutional Neural Networks on VGGFace2, on MS- Celeb-1M, and on their union, and show that training on VGGFace2 leads to improved recognition performance over pose and age. Finally, using the models trained on these datasets, we demonstrate state-of-the-art performance on all the IARPA Janus face recognition benchmarks, e.g. IJB-A, IJB-B and IJB-C, exceeding the previous state-of-the-art by a large margin. Datasets and models are publicly available.

cs.CV↗
arXiv2018

Capillary waves with surface viscosity

Experiments over the last 50 years have suggested a tentative correlation between the surface (shear) viscosity and the stability of a foam or emulsion. We examine this link theoretically using small-amplitude capillary waves in the presence of a surfactant solution of dilute concentrations where the associated Marangoni and surface viscosity effects are modelled via the Boussinesq-Scriven formulation. The resulting integro-differential initial value problem is solved analytically and surface viscosity is found to contribute an overall damping effect on the amplitude of the capillary wave with varying degrees depending on the lengthscale of the system. Numerically, we find the critical damping wavelength to increase for increasing surface concentration but the rate of increase remains different for both the surface viscosity and the Marangoni effect.

physics.flu-dyn↗
arXiv2018

Drug Recommendation toward Safe Polypharmacy

Adverse drug reactions (ADRs) induced from high-order drug-drug interactions (DDIs) due to polypharmacy represent a significant public health problem. In this paper, we formally formulate the to-avoid and safe (with respect to ADRs) drug recommendation problems when multiple drugs have been taken simultaneously. We develop a joint model with a recommendation component and an ADR label prediction component to recommend for a prescription a set of to-avoid drugs that will induce ADRs if taken together with the prescription. We also develop real drug-drug interaction datasets and corresponding evaluation protocols. Our experimental results on real datasets demonstrate the strong performance of the joint model compared to other baseline methods.

cs.IR↗
arXiv2017

Investigation of channel model for weakly coupled multicore fiber

We investigate the evolution of decorrelation bandwidth of inter core crosstalk (IC-XT) in homogeneous weakly coupled multicore fibers (WC-MCFs). The modified mode-coupled equations (MCEs) are numerically solved by combining the fourth order Runge-Kutta method and compound Simpson integral method. It can be theoretically and numerically observed that the decorrelation bandwidth of IC-XT decreases with transmission distance by fractional linear function. The evolution rule of IC-XT's decorrelation bandwidth is further confirmed by experiments, which can be used as an evaluation criterion for channel model. Finally, we propose a new channel model with the coupling matrix of IC-XT generated automatically by phase transfer function (PTF), which is in good agreement with the above evaluation criterion. We believe the proposed channel model can provide a good simulation platform for homogeneous WC-MCF based communication systems.

physics.optics↗
arXiv2017

The Marangoni effect on small-amplitude capillary waves in viscous fluids

We derive a general integrodifferential equation for the transient behaviour of small-amplitude capillary waves on the planar surface of a viscous fluid in the presence of the Marangoni effect. The equation is solved for an insoluble surfactant solution in concentration below the critical micelle concentration (cmc) undergoing convective-diffusive surface transport. The special case of a diffusion-driven surfactant is considered near the the critical damping wavelength. The Marangoni effect is shown to contribute to the overall damping mechanism and a first-order term correction to the critical wavelength with respect to the surfactant concentration difference and the Schmidt number is proposed.

physics.flu-dyn↗
arXiv2017

Machine Learning for Large-Scale Quality Control of 3D Shape Models in Neuroimaging

As very large studies of complex neuroimaging phenotypes become more common, human quality assessment of MRI-derived data remains one of the last major bottlenecks. Few attempts have so far been made to address this issue with machine learning. In this work, we optimize predictive models of quality for meshes representing deep brain structure shapes. We use standard vertex-wise and global shape features computed homologously across 19 cohorts and over 7500 human-rated subjects, training kernelized Support Vector Machine and Gradient Boosted Decision Trees classifiers to detect meshes of failing quality. Our models generalize across datasets and diseases, reducing human workload by 30-70\%, or equivalently hundreds of human rater hours for datasets of comparable size, with recall rates approaching inter-rater reliability.

q-bio.QM↗
arXiv2017

Andreev Reflection Spectroscopy of Topological Superconductor Candidate Nb$_x$Bi$_2$Se$_3$

We study unconventional superconductivity in thin exfoliated single crystals of a promising 3D topological superconductor candidate, Nb-doped Bi$_2$Se$_3$ through Andreev reflection spectroscopy and magneto-transport. Measurements of Andreev reflection in low and high resistance samples both show enhanced conductance around zero bias and conductance dips at the superconducting energy gap. Such behavior is inconsistent with conventional Blonder-Tinkham-Klapwijk theory of Andreev reflection. We discuss how our results are consistent with $p$-wave pairing symmetry, supporting the possibility of topological superconductivity in Nb-doped Bi$_2$Se$_3$.

cond-mat.supr-con↗