Searcharxiv⌕ Search

arXiv subjects

Li Xiao

Publications and source records attributed to Li Xiao.

At least 91 records · Page 5Linked to original sources

Marginal loss and exclusion loss for partially supervised multi-organ segmentation

Annotating multiple organs in medical images is both costly and time-consuming; therefore, existing multi-organ datasets with labels are often low in sample size and mostly partially labeled, that is, a dataset has a few organs labeled but not all organs. In this paper, we investigate how to learn a single multi-organ segmentation network from a union of such datasets. To this end, we propose two types of novel loss function, particularly designed for this scenario: (i) marginal loss and (ii) exclusion loss. Because the background label for a partially labeled image is, in fact, a `merged' label of all unlabelled organs and `true' background (in the sense of full labels), the probability of this `merged' background label is a marginal probability, summing the relevant probabilities before merging. This marginal probability can be plugged into any existing loss function (such as cross entropy loss, Dice loss, etc.) to form a marginal loss. Leveraging the fact that the organs are non-overlapping, we propose the exclusion loss to gauge the dissimilarity between labeled organs and the estimated segmentation of unlabelled organs. Experiments on a union of five benchmark datasets in multi-organ segmentation of liver, spleen, left and right kidneys, and pancreas demonstrate that using our newly proposed loss functions brings a conspicuous performance improvement for state-of-the-art methods without introducing any extra computation.

cs.CV↗

Functional connectome fingerprinting: Identifying individuals and predicting cognitive function via deep learning

The dynamic characteristics of functional network connectivity have been widely acknowledged and studied. Both shared and unique information has been shown to be present in the connectomes. However, very little has been known about whether and how this common pattern can predict the individual variability of the brain, i.e. "brain fingerprinting", which attempts to reliably identify a particular individual from a pool of subjects. In this paper, we propose to enhance the individual uniqueness based on an autoencoder network. More specifically, we rely on the hypothesis that the common neural activities shared across individuals may lessen individual discrimination. By reducing contributions from shared activities, inter-subject variability can be enhanced. Results show that that refined connectomes utilizing an autoencoder with sparse dictionary learning can successfully distinguish one individual from the remaining participants with reasonably high accuracy (up to 99:5% for the rest-rest pair). Furthermore, high-level cognitive behavior (e.g., fluid intelligence, executive function, and language comprehension) can also be better predicted using refined functional connectivity profiles. As expected, the high-order association cortices contributed more to both individual discrimination and behavior prediction. The proposed approach provides a promising way to enhance and leverage the individualized characteristics of brain networks.

q-bio.NC↗

Causal inference of brain connectivity from fMRI with $ψ$-Learning Incorporated Linear non-Gaussian Acyclic Model ($ψ$-LiNGAM)

Functional connectivity (FC) has become a primary means of understanding brain functions by identifying brain network interactions and, ultimately, how those interactions produce cognitions. A popular definition of FC is by statistical associations between measured brain regions. However, this could be problematic since the associations can only provide spatial connections but not causal interactions among regions of interests. Hence, it is necessary to study their causal relationship. Directed acyclic graph (DAG) models have been applied in recent FC studies but often encountered problems such as limited sample sizes and large number of variables (namely high-dimensional problems), which lead to both computational difficulty and convergence issues. As a result, the use of DAG models is problematic, where the identification of DAG models in general is nondeterministic polynomial time hard (NP-hard). To this end, we propose a $ψ$-learning incorporated linear non-Gaussian acyclic model ($ψ$-LiNGAM). We use the association model ($ψ$-learning) to facilitate causal inferences and the model works well especially for high-dimensional cases. Our simulation results demonstrate that the proposed method is more robust and accurate than several existing ones in detecting graph structure and direction. We then applied it to the resting state fMRI (rsfMRI) data obtained from the publicly available Philadelphia Neurodevelopmental Cohort (PNC) to study the cognitive variance, which includes 855 individuals aged 8-22 years. Therein, we have identified three types of hub structure: the in-hub, out-hub and sum-hub, which correspond to the centers of receiving, sending and relaying information, respectively. We also detected 16 most important pairs of causal flows. Several of the results have been verified to be biologically significant.

stat.ML↗

PBRnet: Pyramidal Bounding Box Refinement to Improve Object Localization Accuracy

Many recently developed object detectors focused on coarse-to-fine framework which contains several stages that classify and regress proposals from coarse-grain to fine-grain, and obtains more accurate detection gradually. Multi-resolution models such as Feature Pyramid Network(FPN) integrate information of different levels of resolution and effectively improve the performance. Previous researches also have revealed that localization can be further improved by: 1) using fine-grained information which is more translational variant; 2) refining local areas which is more focused on local boundary information. Based on these principles, we designed a novel boundary refinement architecture to improve localization accuracy by combining coarse-to-fine framework with feature pyramid structure, named as Pyramidal Bounding Box Refinement network(PBRnet), which parameterizes gradually focused boundary areas of objects and leverages lower-level feature maps to extract finer local information when refining the predicted bounding boxes. Extensive experiments are performed on the MS-COCO dataset. The PBRnet brings a significant performance gains by roughly 3 point of $mAP$ when added to FPN or Libra R-CNN. Moreover, by treating Cascade R-CNN as a coarse-to-fine detector and replacing its localization branch by the regressor of PBRnet, it leads an extra performance improvement by 1.5 $mAP$, yielding a total performance boosting by as high as 5 point of $mAP$.

cs.CV↗

Learning from Suspected Target: Bootstrapping Performance for Breast Cancer Detection in Mammography

Deep learning object detection algorithm has been widely used in medical image analysis. Currently all the object detection tasks are based on the data annotated with object classes and their bounding boxes. On the other hand, medical images such as mammography usually contain normal regions or objects that are similar to the lesion region, and may be misclassified in the testing stage if they are not taken care of. In this paper, we address such problem by introducing a novel top likelihood loss together with a new sampling procedure to select and train the suspected target regions, as well as proposing a similarity loss to further identify suspected targets from targets. Mean average precision (mAP) according to the predicted targets and specificity, sensitivity, accuracy, AUC values according to classification of patients are adopted for performance comparisons. We firstly test our proposed method on a private dense mammogram dataset. Results show that our proposed method greatly reduce the false positive rate and the specificity is increased by 0.25 on detecting mass type cancer. It is worth mention that dense breast typically has a higher risk for developing breast cancers and also are harder for cancer detection in diagnosis, and our method outperforms a reported result from performance of radiologists. Our method is also validated on the public Digital Database for Screening Mammography (DDSM) dataset, brings significant improvement on mass type cancer detection and outperforms the most state-of-the-art work.

cs.CV↗

Causality based Feature Fusion for Brain Neuro-Developmental Analysis

Human brain development is a complex and dynamic process that is affected by several factors such as genetics, sex hormones, and environmental changes. A number of recent studies on brain development have examined functional connectivity (FC) defined by the temporal correlation between time series of different brain regions. We propose to add the directional flow of information during brain maturation. To do so, we extract effective connectivity (EC) through Granger causality (GC) for two different groups of subjects, i.e., children and young adults. The motivation is that the inclusion of causal interaction may further discriminate brain connections between two age groups and help to discover new connections between brain regions. The contributions of this study are threefold. First, there has been a lack of attention to EC-based feature extraction in the context of brain development. To this end, we propose a new kernel-based GC (KGC) method to learn nonlinearity of complex brain network, where a reduced Sine hyperbolic polynomial (RSP) neural network was used as our proposed learner. Second, we used causality values as the weight for the directional connectivity between brain regions. Our findings indicated that the strength of connections was significantly higher in young adults relative to children. In addition, our new EC-based feature outperformed FC-based analysis from Philadelphia neurocohort (PNC) study with better discrimination of the different age groups. Moreover, the fusion of these two sets of features (FC + EC) improved brain age prediction accuracy by more than 4%, indicating that they should be used together for brain development studies.

cs.CV↗

A Span-Extraction Dataset for Chinese Machine Reading Comprehension

Machine Reading Comprehension (MRC) has become enormously popular recently and has attracted a lot of attention. However, the existing reading comprehension datasets are mostly in English. In this paper, we introduce a Span-Extraction dataset for Chinese machine reading comprehension to add language diversities in this area. The dataset is composed by near 20,000 real questions annotated on Wikipedia paragraphs by human experts. We also annotated a challenge set which contains the questions that need comprehensive understanding and multi-sentence inference throughout the context. We present several baseline systems as well as anonymous submissions for demonstrating the difficulties in this dataset. With the release of the dataset, we hosted the Second Evaluation Workshop on Chinese Machine Reading Comprehension (CMRC 2018). We hope the release of the dataset could further accelerate the Chinese machine reading comprehension research. Resources are available: https://github.com/ymcui/cmrc2018

cs.CL↗

Training Artificial Neural Networks by Generalized Likelihood Ratio Method: Exploring Brain-like Learning to Improve Robustness

In this work, we propose a generalized likelihood ratio method capable of training the artificial neural networks with some biological brain-like mechanisms,.e.g., (a) learning by the loss value, (b) learning via neurons with discontinuous activation and loss functions. The traditional back propagation method cannot train the artificial neural networks with aforementioned brain-like learning mechanisms. Numerical results show that the robustness of various artificial neural networks trained by the new method is significantly improved when the input data is affected by both the natural noises and adversarial attacks. Code is available: \url{https://github.com/LX-doctorAI/GLR_ADV} .

cs.LG↗

Brain Maturation Study during Adolescence Using Graph Laplacian Learning Based Fourier Transform

Objective: Longitudinal neuroimaging studies have demonstrated that adolescence is the crucial developmental epoch of continued brain growth and change. A large number of researchers dedicate to uncovering the mechanisms about brain maturity during adolescence. Motivated by both achievement in graph signal processing and recent evidence that some brain areas act as hubs connecting functionally specialized systems, we proposed an approach to detect these regions from spectral analysis perspective. In particular, as human brain undergoes substantial development throughout adolescence, we addressed the challenge by evaluating the functional network difference among age groups from functional magnetic resonance imaging (fMRI) observations. Methods: We treated these observations as graph signals defined on the parcellated functional brain regions and applied graph Laplacian learning based Fourier Transform (GLFT) to transform the original graph signals into frequency domain. Eigen-analysis was conducted afterwards to study the behavior of the corresponding brain regions, which enables the characterization of brain maturation. Result: We first evaluated our method on the synthetic data and further applied the method to resting and task state fMRI imaging data from Philadelphia Neurodevelopmental Cohort (PNC) dataset, comprised of normally developing adolescents from 8 to 22. The model provided a highest accuracy of 95.69% in distinguishing different adolescence stages. Conclusion: We detected 13 hubs from resting state fMRI and 16 hubs from task state fMRI that are highly related to brain maturation process. Significance: The proposed GLFT method is powerful in extracting the brain connectivity patterns and identifying hub regions with a high prediction power

q-bio.NC↗

A Manifold Regularized Multi-Task Learning Model for IQ Prediction from Multiple fMRI Paradigms

Multi-modal brain functional connectivity (FC) data have shown great potential for providing insights into individual variations in behavioral and cognitive traits. The joint learning of multi-modal imaging data can utilize the intrinsic association, and thus can boost the learning performance. Although several multi-task based learning models have already been proposed by viewing the feature learning on each modality as one task, most of them ignore the geometric structure information inherent in the modalities, which may play an important role in extracting discriminative features. In this paper, we propose a new manifold regularized multi-task learning model by simultaneously considering between-subject and between-modality relationships. Besides employing a group-sparsity regularizer to jointly select a few common features across multiple tasks (modalities), we design a novel manifold regularizer to preserve the structure information both within and between modalities in our model. This will make our model more adaptive for realistic data analysis. Our model is then validated on the Philadelphia Neurodevelopmental Cohort dataset, where we regard our modalities as functional MRI (fMRI) data collected under two paradigms. Specifically, we conduct experimental studies on fMRI based FC network data in two task conditions for intelligence quotient (IQ) prediction. The results demonstrate that our proposed model can not only achieve improved prediction performance, but also yield a set of IQ-relevant biomarkers.

q-bio.QM↗

Alternating Diffusion Map Based Fusion of Multimodal Brain Connectivity Networks for IQ Prediction

To explain individual differences in development, behavior, and cognition, most previous studies focused on projecting resting-state functional MRI (fMRI) based functional connectivity (FC) data into a low-dimensional space via linear dimensionality reduction techniques, followed by executing analysis operations. However, linear dimensionality analysis techniques may fail to capture nonlinearity of brain neuroactivity. Moreover, besides resting-state FC, FC based on task fMRI can be expected to provide complementary information. Motivated by these considerations, we nonlinearly fuse resting-state and task-based FC networks (FCNs) to seek a better representation in this paper. We propose a framework based on alternating diffusion map (ADM), which extracts geometry-preserving low-dimensional embeddings that successfully parameterize the intrinsic variables driving the phenomenon of interest. Specifically, we first separately build resting-state and task-based FCNs by symmetric positive definite matrices using sparse inverse covariance estimation for each subject, and then utilize the ADM to fuse them in order to extract significant low-dimensional embeddings, which are used as fingerprints to identify individuals. The proposed framework is validated on the Philadelphia Neurodevelopmental Cohort data, where we conduct extensive experimental study on resting-state and fractal $n$-back task fMRI for the classification of intelligence quotient (IQ). The fusion of resting-state and $n$-back task fMRI by the proposed framework achieves better classification accuracy than any single fMRI, and the proposed framework is shown to outperform several other data fusion methods. To our knowledge, this paper is the first to demonstrate a successful extension of the ADM to fuse resting-state and task-based fMRI data for accurate prediction of IQ.

q-bio.NC↗

The Arecibo Legacy Fast ALFA Survey: The ALFALFA Extragalactic HI Source Catalog

We present the catalog of ~31500 extragalactic HI line sources detected by the completed ALFALFA survey out to z < 0.06 including both high signal-to-noise ratio (> 6.5) detections and ones of lower quality which coincide in both position and recessional velocity with galaxies of known redshift. We review the observing technique, data reduction pipeline, and catalog construction process, focusing on details of particular relevance to understanding the catalog's compiled parameters. We further describe and make available the digital HI line spectra associated with the catalogued sources. In addition to the extragalactic HI line detections, we report nine confirmed OH megamasers and ten OH megamaser candidates at 0.16 < z < 0.22 whose OH line signals are redshifted into the ALFALFA frequency band. Because of complexities in data collection and processing associated with the use of a feed-horn array on a complex single-dish antenna in the terrestrial radio frequency interference environment, we also present a list of suggestions and caveats for consideration by users of the ALFALFA extragalactic catalog for future scientific investigations.

astro-ph.GA↗

Uncertainty Principles Associated with the Offset Linear Canonical Transform

As a time-shifted and frequency-modulated version of the linear canonical transform (LCT), the offset linear canonical transform (OLCT) provides a more general framework of most existing linear integral transforms in signal processing and optics. To study simultaneous localization of a signal and its OLCT, the classical Heisenberg's uncertainty principle has been recently generalized for the OLCT. In this paper, we complement it by presenting another two uncertainty principles, i.e., Donoho-Stark's uncertainty principle and Amrein-Berthier-Benedicks's uncertainty principle, for the OLCT. Moreover, we generalize the short-time LCT to the short-time OLCT. We likewise present Lieb's uncertainty principle for the short-time OLCT and give a lower bound for its essential support.

eess.SP↗

Radial Velocity Retrieval for Multichannel SAR Moving Targets with Time-Space Doppler De-ambiguity

In this paper, with respect to multichannel synthetic aperture radars (SAR), we first formulate the problems of Doppler ambiguities on the radial velocity (RV) estimation of a ground moving target in range-compressed domain, range-Doppler domain and image domain, respectively. It is revealed that in these problems, a cascaded time-space Doppler ambiguity (CTSDA) may encounter, i.e., time domain Doppler ambiguity (TDDA) in each channel arises first and then spatial domain Doppler ambiguity (SDDA) among multi-channels arises second. Accordingly, the multichannel SAR systems with different parameters are investigated in three different cases with diverse Doppler ambiguity properties, and a multi-frequency SAR is then proposed to obtain the RV estimation by solving the ambiguity problem based on Chinese remainder theorem (CRT). In the first two cases, the ambiguity problem can be solved by the existing closed-form robust CRT. In the third case, it is found that the problem is different from the conventional CRT problems and we call it a double remaindering problem in this paper. We then propose a sufficient condition under which the double remaindering problem, i.e., the CTSDA, can also be solved by the closed-form robust CRT. When the sufficient condition is not satisfied for a multi-channel SAR, a searching based method is proposed. Finally, some results of numerical experiments are provided to demonstrate the effectiveness of the proposed methods.

cs.IT↗

Exploring A Multi-Scale Method for Molecular Simulations in Continuum Solvent Model: Explicit Simulation of Continuum Solvent As An Incompressible Fluid

A multi-scale framework was recently proposed for more realistic molecular dynamics simulations in continuum solvent models by coupling a molecular mechanics treatment of solute with a fluid mechanics treatment of solvent, where we formulated the physical model and developed a numerical fluid dynamics integrator. In this study, we incorporated the fluid dynamics integrator with the Amber simulation engine to conduct atomistic simulations of biomolecules. At this stage of the development, only nonelectrostatic interactions, i.e., van del Waals and hydrophobic interactions are included in the multi-scale model. Nevertheless numerical challenges exist in accurately interpolating the highly nonlinear van del Waals term when solving the finite-difference fluid dynamics equations. We were able to bypass the challenge rigorously by merging the van del Waals potential and pressure together when solving the fluid dynamics equations and by considering its contribution in the free-boundary condition analytically. The multi-scale simulation engine was first validated by reproducing the solute-solvent interface of a single atom with analytical solution. Next, we performed the relaxation simulation of a restrained symmetrical monomer and observed a symmetrical solvent interface at equilibrium with detailed surface features resembling those found on the solvent excluded surface. Four typical small molecular complexes were then tested, both volume and force balancing analysis showing that these simple complexes can reach equilibrium within the simulation time window. Finally, we studied the quality of the multi-scale solute-solvent interfaces for the four tested dimer complexes and found they agree well with the boundaries as sampled in the explicit water simulations.

physics.bio-ph↗

A Continuum Poisson-Boltzmann Model for Membrane Channel Proteins

Membrane proteins constitute a large portion of the human proteome and perform a variety of important functions as membrane receptors, transport proteins, enzymes, signaling proteins, and more. The computational studies of membrane proteins are usually much more complicated than those of globular proteins. Here we propose a new continuum model for Poisson-Boltzmann calculations of membrane channel proteins. Major improvements over the existing continuum slab model are as follows: 1) The location and thickness of the slab model are fine-tuned based on explicit-solvent MD simulations. 2) The highly different accessibility in the membrane and water regions are addressed with a two-step, two-probe grid labeling procedure, and 3) The water pores/channels are automatically identified. The new continuum membrane model is optimized (by adjusting the membrane probe, as well as the slab thickness and center) to best reproduce the distributions of buried water molecules in the membrane region as sampled in explicit water simulations. Our optimization also shows that the widely adopted water probe of 1.4 Å for globular proteins is a very reasonable default value for membrane protein simulations. It gives an overall minimum number of inconsistencies between the continuum and explicit representations of water distributions in membrane channel proteins, at least in the water accessible pore/channel regions that we focus on. Finally, we validate the new membrane model by carrying out binding affinity calculations for a potassium channel, and we observe a good agreement with experiment results.

physics.bio-ph↗

Minimum Degree-Weighted Distance Decoding for Polynomial Residue Codes with Non-Pairwise Coprime Moduli

This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed decoding is based on the degree-weighted distance and different from the traditional minimum Hamming distance decoding. It is shown that for the two types of minimum distance decoders, i.e., the minimum degree-weighted distance decoding and the minimum Hamming distance decoding, one is not absolutely stronger than the other, but they can complement each other from different points of view.

cs.IT↗

Robust Polynomial Reconstruction via Chinese Remainder Theorem in the Presence of Small Degree Residue Errors

Based on unique decoding of the polynomial residue code with non-pairwise coprime moduli, a polynomial with degree less than that of the least common multiple (lcm) of all the moduli can be accurately reconstructed when the number of residue errors is less than half the minimum distance of the code. However, once the number of residue errors is beyond half the minimum distance of the code, the unique decoding may fail and lead to a large reconstruction error. In this paper, assuming that all the residues are allowed to have errors with small degrees, we consider how to reconstruct the polynomial as accurately as possible in the sense that a reconstructed polynomial is obtained with only the last $τ$ number of coefficients being possibly erroneous, when the residues are affected by errors with degrees upper bounded by $τ$. In this regard, we first propose a multi-level robust Chinese remainder theorem (CRT) for polynomials, namely, a trade-off between the dynamic range of the degree of the polynomial to be reconstructed and the residue error bound $τ$ is formulated. Furthermore, a simple closed-form reconstruction algorithm is also proposed.

cs.IT↗