Search

The experimental features of positive-parity doublet bands in the odd-\emph{A} cesium isotopes $^{125,127,129,131}$Cs, including angular momentum alignment, energy staggering, $B(M1)/B(E2)$ etc. are studied systematically and compared to those of the candidate chiral bands in the adjacent odd-odd Cs isotopes. The configuration assignments and the dynamics of these bands are discussed. The self-consistent tilted axis cranking relativistic mean-field calculations are performed with configuration reassigned to these bands. The experimental level schemes of four nuclei are well reproduced, and the calculations also show four nuclei have obvious triaxial deformations and thus support the candidate chiral doublet bands in $^{125,127,129,131}$Cs., Comment: 18 pages, 10 figures

In this work, we attempt the segmentation of cardiac structures in late gadolinium-enhanced (LGE) magnetic resonance images (MRI) using only minimal supervision in a two-step approach. In the first step, we register a small set of five LGE cardiac magnetic resonance (CMR) images with ground truth labels to a set of 40 target LGE CMR images without annotation. Each manually annotated ground truth provides labels of the myocardium and the left ventricle (LV) and right ventricle (RV) cavities, which are used as atlases. After multi-atlas label fusion by majority voting, we possess noisy labels for each of the targeted LGE images. A second set of manual labels exists for 30 patients of the target LGE CMR images, but are annotated on different MRI sequences (bSSFP and T2-weighted). Again, we use multi-atlas label fusion with a consistency constraint to further refine our noisy labels if additional annotations in other modalities are available for a given patient. In the second step, we train a deep convolutional network for semantic segmentation on the target data while using data augmentation techniques to avoid over-fitting to the noisy labels. After inference and simple post-processing, we achieve our final segmentation for the targeted LGE CMR images, resulting in an average Dice of 0.890, 0.780, and 0.844 for LV cavity, LV myocardium, and RV cavity, respectively., Comment: Accepted at the MICCAI Workshop Statistical Atlases and Computational Modeling of the Heart (STACOM), MS-CMRSeg 2019: Multi-sequence Cardiac MR Segmentation Challenge, Shenzen, China

Annotation of medical images has been a major bottleneck for the development of accurate and robust machine learning models. Annotation is costly and time-consuming and typically requires expert knowledge, especially in the medical domain. Here, we propose to use minimal user interaction in the form of extreme point clicks in order to train a segmentation model that can, in turn, be used to speed up the annotation of medical images. We use extreme points in each dimension of a 3D medical image to constrain an initial segmentation based on the random walker algorithm. This segmentation is then used as a weak supervisory signal to train a fully convolutional network that can segment the organ of interest based on the provided user clicks. We show that the network's predictions can be refined through several iterations of training and prediction using the same weakly annotated data. Ultimately, our method has the potential to speed up the generation process of new training datasets for the development of new machine learning and deep learning-based models for, but not exclusively, medical image analysis., Comment: Accepted at the MICCAI Workshop for Large-scale Annotation of Biomedical data and Expert Label Synthesis, Shenzen, China, 2019

We find a novel mechanism for generating transverse single-spin asymmetry (SSA) in semi-inclusive deep inelastic scattering, distinct from the known ones which involve the Sivers and Collins functions, or their collinear twist-three counterparts. It is demonstrated that a phase needed for SSA can be produced purely within a parton-level cross section starting at two loops. We identify the complete set of two-loop diagrams for SSA, and discuss their gauge invariance and collinear factorization which features the $g_T$ distribution function. In the $k_T$ factorization framework, many more sources for SSA exist, and contributions from all possible two-parton transverse-momentum-dependent parton distribution functions are presented up to two loops and twist three., Comment: 21 pages, 14 figures

Radiogenomic map linking image features and gene expression profiles is useful for noninvasively identifying molecular properties of a particular type of disease. Conventionally, such map is produced in three separate steps: 1) gene-clustering to "metagenes", 2) image feature extraction, and 3) statistical correlation between metagenes and image features. Each step is independently performed and relies on arbitrary measurements. In this work, we investigate the potential of an end-to-end method fusing gene data with image features to generate synthetic image and learn radiogenomic map simultaneously. To achieve this goal, we develop a generative adversarial network (GAN) conditioned on both background images and gene expression profiles, synthesizing the corresponding image. Image and gene features are fused at different scales to ensure the realism and quality of the synthesized image. We tested our method on non-small cell lung cancer (NSCLC) dataset. Results demonstrate that the proposed method produces realistic synthetic images, and provides a promising way to find gene-image relationship in a holistic end-to-end manner.

We propose a 4D convolutional neural network (CNN) for the segmentation of retrospective ECG-gated cardiac CT, a series of single-channel volumetric data over time. While only a small subset of volumes in the temporal sequence is annotated, we define a sparse loss function on available labels to allow the network to leverage unlabeled images during training and generate a fully segmented sequence. We investigate the accuracy of the proposed 4D network to predict temporally consistent segmentations and compare with traditional 3D segmentation approaches. We demonstrate the feasibility of the 4D CNN and establish its performance on cardiac 4D CCTA., Comment: MICCAI, STACOM, 2019

Recent advances in deep learning for medical image segmentation demonstrate expert-level accuracy. However, in clinically realistic environments, such methods have marginal performance due to differences in image domains, including different imaging protocols, device vendors and patient populations. Here we consider the problem of domain generalization, when a model is trained once, and its performance generalizes to unseen domains. Intuitively, within a specific medical imaging modality the domain differences are smaller relative to natural images domain variability. We rethink data augmentation for medical 3D images and propose a deep stacked transformations (DST) approach for domain generalization. Specifically, a series of n stacked transformations are applied to each image in each mini-batch during network training to account for the contribution of domain-specific shifts in medical images. We comprehensively evaluate our method on three tasks: segmentation of whole prostate from 3D MRI, left atrial from 3D MRI, and left ventricle from 3D ultrasound. We demonstrate that when trained on a small source dataset, (i) on average, DST models on unseen datasets degrade only by 11% (Dice score change), compared to the conventional augmentation (degrading 39%) and CycleGAN-based domain adaptation method (degrading 25%); (ii) when evaluation on the same domain, DST is also better albeit only marginally. (iii) When training on large-sized data, DST on unseen domains reaches performance of state-of-the-art fully supervised models. These findings establish a strong benchmark for the study of domain generalization in medical imaging, and can be generalized to the design of robust deep segmentation models for clinical deployment., Comment: 9 pages, 3 figure

Deep learning algorithms, in particular 2D and 3D fully convolutional neural networks (FCNs), have rapidly become the mainstream methodology for volumetric medical image segmentation. However, 2D convolutions cannot fully leverage the rich spatial information along the third axis, while 3D convolutions suffer from the demanding computation and high GPU memory consumption. In this paper, we propose to automatically search the network architecture tailoring to volumetric medical image segmentation problem. Concretely, we formulate the structure learning as differentiable neural architecture search, and let the network itself choose between 2D, 3D or Pseudo-3D (P3D) convolutions at each layer. We evaluate our method on 3 public datasets, i.e., the NIH Pancreas dataset, the Lung and Pancreas dataset from the Medical Segmentation Decathlon (MSD) Challenge. Our method, named V-NAS, consistently outperforms other state-of-the-arts on the segmentation task of both normal organ (NIH Pancreas) and abnormal organs (MSD Lung tumors and MSD Pancreas tumors), which shows the power of chosen architecture. Moreover, the searched architecture on one dataset can be well generalized to other datasets, which demonstrates the robustness and practical use of our proposed method., Comment: Accepted by 3DV, camera ready version. 8 pages, 4 figures and 5 tables

There is an apparent discrepancy between the results of the charged kaon multiplicities off the deuteron target from HERMES and COMPASS experiments. In this article we point out that this discrepancy cannot be explained by different $Q^2$ values. Furthermore we examine the empirical parametrization of the fragmentation functions, DSS2017 carefully and find that the agreement between the theoretical estimate and the HERMES data is less satisfactory as claimed., Comment: 4 pages, 3 figures,will appear in the proceeding of the 8th International conference on Quark and Nuclear physics, Tsukuba, Japan from November 13 to November 17, 2018. arXiv admin note: substantial text overlap with arXiv:1807.06524

It is usually hard for a learning system to predict correctly on rare events that never occur in the training data, and there is no exception for segmentation algorithms. Meanwhile, manual inspection of each case to locate the failures becomes infeasible due to the trend of large data scale and limited human resource. Therefore, we build an alarm system that will set off alerts when the segmentation result is possibly unsatisfactory, assuming no corresponding ground truth mask is provided. One plausible solution is to project the segmentation results into a low dimensional feature space; then learn classifiers/regressors to predict their qualities. Motivated by this, in this paper, we learn a feature space using the shape information which is a strong prior shared among different datasets and robust to the appearance variation of input data.The shape feature is captured using a Variational Auto-Encoder (VAE) network that trained with only the ground truth masks. During testing, the segmentation results with bad shapes shall not fit the shape prior well, resulting in large loss values. Thus, the VAE is able to evaluate the quality of segmentation result on unseen data, without using ground truth. Finally, we learn a regressor in the one-dimensional feature space to predict the qualities of segmentation results. Our alarm system is evaluated on several recent state-of-art segmentation algorithms for 3D medical segmentation tasks. Compared with other standard quality assessment methods, our system consistently provides more reliable prediction on the qualities of segmentation results., Comment: Accepted to ICCV 2019 (10 pages, 4 figures)

Network motifs can capture basic interaction patterns and inform the functional properties of networks. However, real-world complex systems often have multiple types of relationships, which cannot be represented by a monolayer network. The multilayer nature of complex systems demands research on extending the notion of motifs to multilayer networks, thereby exploring the interaction patterns with a higher resolution. In this paper, we propose a formal definition of multilayer motifs, and analyse the occurrence of three-node multilayer motifs in a set of real-world multilayer networks. We find that multilayer motifs in social networks are more homogeneous across layers, indicating that different types of social relationships are reinforcing each other, while those in the transportation network are more complementary across layers. We find that biological networks are often associated with heterogeneous functions. This research sheds light on how multilayer network framework enables the capture of the hidden multi-aspect relationships among the nodes.

While making a tremendous impact in various fields, deep neural networks usually require large amounts of labeled data for training which are expensive to collect in many applications, especially in the medical domain. Unlabeled data, on the other hand, is much more abundant. Semi-supervised learning techniques, such as co-training, could provide a powerful tool to leverage unlabeled data. In this paper, we propose a novel framework, uncertainty-aware multi-view co-training (UMCT), to address semi-supervised learning on 3D data, such as volumetric data from medical imaging. In our work, co-training is achieved by exploiting multi-viewpoint consistency of 3D data. We generate different views by rotating or permuting the 3D data and utilize asymmetrical 3D kernels to encourage diversified features in different sub-networks. In addition, we propose an uncertainty-weighted label fusion mechanism to estimate the reliability of each view's prediction with Bayesian deep learning. As one view requires the supervision from other views in co-training, our self-adaptive approach computes a confidence score for the prediction of each unlabeled sample in order to assign a reliable pseudo label. Thus, our approach can take advantage of unlabeled data during training. We show the effectiveness of our proposed semi-supervised method on several public datasets from medical image segmentation tasks (NIH pancreas & LiTS liver tumor dataset). Meanwhile, a fully-supervised method based on our approach achieved state-of-the-art performances on both the LiTS liver tumor segmentation and the Medical Segmentation Decathlon (MSD) challenge, demonstrating the robustness and value of our framework, even when fully supervised training is feasible., Comment: Accepted to WACV 2020

This short note surveys the constructions of 3-Calabi--Yau triangulated categories with simple-minded collections due to Ginzburg and Kontsevich--Soibelman and the constructions of 2-Calabi--Yau triangulated categories with cluster-tilting objects due to Buan--Marsh--Reineke--Reiten--Todorov and Amiot, and includes a discussion on the normal form of 2-Calabi--Yau triangulated categories with cluster-tilting objects., Comment: 10 pages. The Chinese version of this survey is published in Sci. Sin. Math. with doi: 10.1360/N012018-00001

Given an ST-triple $(\mathcal{C},\mathcal{D},M)$ one can associate a co-$t$-structure on $\mathcal{C}$ and a $t$-structure on $\mathcal{D}$. It is shown that the discreteness of $\mathcal{C}$ with respect to the co-$t$-structure is equivalent to the discreteness of $\mathcal{D}$ with respect to the $t$-structure. As a special case, the discreteness of $\mathcal{D}^b(\mathrm{mod} A)$ in the sense of Vossieck is equivalent to the discreteness of $K^b(\mathrm{proj} A)$ in a dual sense, where $A$ is a finite-dimensional algebra., Comment: 17 pages