arXiv subjects

Li Sun

Publications and source records attributed to Li Sun.

At least 181 records · Page 10Linked to original sources

arXiv2021

Feedback from $γ$~Cassiopeiae: Large Expanding Cavity, Accelerating Cometary Globules, and Peculiar X-ray Emission

We present wide-field multi-wavelength observations of $γ$ Cassiopeiae (or $γ$~Cas for short) in order to study its feedback toward the interstellar environment. A large expanding cavity is discovered toward $γ$~Cas in the neutral hydrogen (HI) images at a systemic velocity of about -10 km/s. The measured dimension of the cavity is roughly 2.0 deg $\times$ 1.4 deg (or 6.0 pc $\times$ 4.2 pc at a distance of 168 pc), while the expansion velocity is about 5.0$\pm$0.5 km/s. The CO observations reveal systematic velocity gradients in IC63 (about 20 km/s/pc) and IC59 (about 30 km/s/pc), two cometary globules illuminated by $γ$~Cas, proving fast acceleration of the globules under stellar radiation pressure. The gas kinematics indicate that the cavity is opened by strong stellar wind, which has high potential to lead to the peculiar X-ray emission observed in $γ$~Cas. Our result favors a recent new scenario that emphasizes the roles of stellar wind and binarity in the X-ray emission of the $γ$~Cas stars.

astro-ph.SR↗

arXiv2021

Artificial Neural Network and Its Application Research Progress in Chemical Process

Most chemical processes, such as distillation, absorption, extraction, and catalytic reactions, are extremely complex processes that are affected by multiple factors. The relationships between their input variables and output variables are non-linear, and it is difficult to optimize or control them using traditional methods. Artificial neural network (ANN) is a systematic structure composed of multiple neuron models. Its main function is to simulate multiple basic functions of the nervous system of living organisms. ANN can achieve nonlinear control without relying on mathematical models, and is especially suitable for more complex control objects. This article will introduce the basic principles and development history of artificial neural networks, and review its application research progress in chemical process control, fault diagnosis, and process optimization.

eess.SY↗

arXiv2021

LSC-GAN: Latent Style Code Modeling for Continuous Image-to-image Translation

Image-to-image (I2I) translation is usually carried out among discrete domains. However, image domains, often corresponding to a physical value, are usually continuous. In other words, images gradually change with the value, and there exists no obvious gap between different domains. This paper intends to build the model for I2I translation among continuous varying domains. We first divide the whole domain coverage into discrete intervals, and explicitly model the latent style code for the center of each interval. To deal with continuous translation, we design the editing modules, changing the latent style code along two directions. These editing modules help to constrain the codes for domain centers during training, so that the model can better understand the relation among them. To have diverse results, the latent style code is further diversified with either the random noise or features from the reference image, giving the individual style code to the decoder for label-based or reference-based synthesis. Extensive experiments on age and viewing angle translation show that the proposed method can achieve high-quality results, and it is also flexible for users.

cs.CV↗

arXiv2021

Bridging the Gap between Label- and Reference-based Synthesis in Multi-attribute Image-to-Image Translation

The image-to-image translation (I2IT) model takes a target label or a reference image as the input, and changes a source into the specified target domain. The two types of synthesis, either label- or reference-based, have substantial differences. Particularly, the label-based synthesis reflects the common characteristics of the target domain, and the reference-based shows the specific style similar to the reference. This paper intends to bridge the gap between them in the task of multi-attribute I2IT. We design the label- and reference-based encoding modules (LEM and REM) to compare the domain differences. They first transfer the source image and target label (or reference) into a common embedding space, by providing the opposite directions through the attribute difference vector. Then the two embeddings are simply fused together to form the latent code S_rand (or S_ref), reflecting the domain style differences, which is injected into each layer of the generator by SPADE. To link LEM and REM, so that two types of results benefit each other, we encourage the two latent codes to be close, and set up the cycle consistency between the forward and backward translations on them. Moreover, the interpolation between the S_rand and S_ref is also used to synthesize an extra image. Experiments show that label- and reference-based synthesis are indeed mutually promoted, so that we can have the diverse results from LEM, and high quality results with the similar style of the reference.

cs.CV↗

arXiv2021

A wide-field CO survey towards the California Molecular Filament

We present the survey of $^{12}$CO/$^{13}$CO/C$^{18}$O (J=1-0) toward the California Molecular Cloud (CMC) within the region of 161.75$^{\circ} \leqslant l \leqslant$ 167.75$^{\circ}$,-9.5$^{\circ} \leqslant b \leqslant $-7.5$^{\circ}$, using the Purple Mountain Observatory (PMO) 13.7 m millimeter telescope. Adopting a distance of 470 pc, the mass of the observed molecular cloud estimated from $^{12}$CO, $^{13}$CO, and C$^{18}$O is about 2.59$\times$10$^{4}$ M$_\odot$, 0.85$\times$10$^{4}$ M$_\odot$, and 0.09$\times$10$^{4}$ M$_\odot$, respectively. A large-scale continuous filament extending about 72 pc is revealed from the $^{13}$CO images. A systematic velocity gradient perpendicular to the major axis appears and is measured to be $\sim$ 0.82 km s$^{-1}$ pc$^{-1}$. The kinematics along the filament shows an oscillation pattern with a fragmentation wavelength of $\sim$ 2.3 pc and velocity amplitude of $\sim$ 0.92 km s$^{-1}$, which may be related with core-forming flows. Furthermore, assuming an inclination angle to the plane of the sky of 45$^{\circ}$, the estimated average accretion rate is $\sim$ 101 M$_\odot$ Myr$^{-1}$ for the cluster LkH$α$ 101 and $\sim$ 21 M$_\odot$ Myr$^{-1}$ for the other regions. In the C$^{18}$O observations, the large-scale filament could be resolved into multiple substructures and their dynamics are consistent with the scenario of filament formation from converging flows. Approximately 225 C$^{18}$O cores are extracted, of which 181 are starless cores. Roughly 37$\%$ (67/181) of the starless cores have $α_{\text{vir}}$ less than 1. Twenty outflow candidates are identified along the filament. Our results indicate active early-phase star formation along the large-scale filament in the CMC region.

astro-ph.GA↗

arXiv2021

Exponential enhancement of quantum metrology using continuous variables

Coherence time is an important resource to generate enhancement in quantum metrology. In this work, based on continuous-variable models, we propose a new design of the signal-probe Hamiltonian which generates an exponential enhancement of measurement sensitivity. The key idea is to include into the system an ancilla that does not couple directly to the signal. An immediate benefit of such design is one can expand quantum Fisher information(QFI) into a power series in time, making it possible to achieve a higher-order time scaling in QFI. Specifically, one can design the interaction for a qubit-oscillator Ramsey interferometer to achieve a quartic time scaling, based on which, one can further design a chain of coupled harmonic oscillators to achieve an exponential time scaling in QFI. Our results show that linear scaling in both time and the number of coupling terms is sufficient to obtain exponential enhancement. Such exponential advantage is closely related to the characteristic commutation relations of quadratures.

quant-ph↗

arXiv2021

DG-Font: Deformable Generative Networks for Unsupervised Font Generation

Font generation is a challenging problem especially for some writing systems that consist of a large number of characters and has attracted a lot of attention in recent years. However, existing methods for font generation are often in supervised learning. They require a large number of paired data, which is labor-intensive and expensive to collect. Besides, common image-to-image translation models often define style as the set of textures and colors, which cannot be directly applied to font generation. To address these problems, we propose novel deformable generative networks for unsupervised font generation (DGFont). We introduce a feature deformation skip connection (FDSC) which predicts pairs of displacement maps and employs the predicted maps to apply deformable convolution to the low-level feature maps from the content encoder. The outputs of FDSC are fed into a mixer to generate the final results. Taking advantage of FDSC, the mixer outputs a high-quality character with a complete structure. To further improve the quality of generated images, we use three deformable convolution layers in the content encoder to learn style-invariant feature representations. Experiments demonstrate that our model generates characters in higher quality than state-of-art methods. The source code is available at https://github.com/ecnuycxie/DG-Font.

cs.CV↗

arXiv2021

Hyperbolic Variational Graph Neural Network for Modeling Dynamic Graphs

Learning representations for graphs plays a critical role in a wide spectrum of downstream applications. In this paper, we summarize the limitations of the prior works in three folds: representation space, modeling dynamics and modeling uncertainty. To bridge this gap, we propose to learn dynamic graph representation in hyperbolic space, for the first time, which aims to infer stochastic node representations. Working with hyperbolic space, we present a novel Hyperbolic Variational Graph Neural Network, referred to as HVGNN. In particular, to model the dynamics, we introduce a Temporal GNN (TGNN) based on a theoretically grounded time encoding approach. To model the uncertainty, we devise a hyperbolic graph variational autoencoder built upon the proposed TGNN to generate stochastic node representations of hyperbolic normal distributions. Furthermore, we introduce a reparameterisable sampling algorithm for the hyperbolic normal distribution to enable the gradient-based learning of HVGNN. Extensive experiments show that HVGNN outperforms state-of-the-art baselines on real-world datasets.

cs.LG↗

arXiv2021

NDT-Transformer: Large-Scale 3D Point Cloud Localisation using the Normal Distribution Transform Representation

3D point cloud-based place recognition is highly demanded by autonomous driving in GPS-challenged environments and serves as an essential component (i.e. loop-closure detection) in lidar-based SLAM systems. This paper proposes a novel approach, named NDT-Transformer, for realtime and large-scale place recognition using 3D point clouds. Specifically, a 3D Normal Distribution Transform (NDT) representation is employed to condense the raw, dense 3D point cloud as probabilistic distributions (NDT cells) to provide the geometrical shape description. Then a novel NDT-Transformer network learns a global descriptor from a set of 3D NDT cell representations. Benefiting from the NDT representation and NDT-Transformer network, the learned global descriptors are enriched with both geometrical and contextual information. Finally, descriptor retrieval is achieved using a query-database for place recognition. Compared to the state-of-the-art methods, the proposed approach achieves an improvement of 7.52% on average top 1 recall and 2.73% on average top 1% recall on the Oxford Robotcar benchmark.

cs.RO↗

arXiv2021

Introspective Visuomotor Control: Exploiting Uncertainty in Deep Visuomotor Control for Failure Recovery

End-to-end visuomotor control is emerging as a compelling solution for robot manipulation tasks. However, imitation learning-based visuomotor control approaches tend to suffer from a common limitation, lacking the ability to recover from an out-of-distribution state caused by compounding errors. In this paper, instead of using tactile feedback or explicitly detecting the failure through vision, we investigate using the uncertainty of a policy neural network. We propose a novel uncertainty-based approach to detect and recover from failure cases. Our hypothesis is that policy uncertainties can implicitly indicate the potential failures in the visuomotor control task and that robot states with minimum uncertainty are more likely to lead to task success. To recover from high uncertainty cases, the robot monitors its uncertainty along a trajectory and explores possible actions in the state-action space to bring itself to a more certain state. Our experiments verify this hypothesis and show a significant improvement on task success rate: 12% in pushing, 15% in pick-and-reach and 22% in pick-and-place.

cs.RO↗

arXiv2021

ID-Unet: Iterative Soft and Hard Deformation for View Synthesis

View synthesis is usually done by an autoencoder, in which the encoder maps a source view image into a latent content code, and the decoder transforms it into a target view image according to the condition. However, the source contents are often not well kept in this setting, which leads to unnecessary changes during the view translation. Although adding skipped connections, like Unet, alleviates the problem, but it often causes the failure on the view conformity. This paper proposes a new architecture by performing the source-to-target deformation in an iterative way. Instead of simply incorporating the features from multiple layers of the encoder, we design soft and hard deformation modules, which warp the encoder features to the target view at different resolutions, and give results to the decoder to complement the details. Particularly, the current warping flow is not only used to align the feature of the same resolution, but also as an approximation to coarsely deform the high resolution feature. Then the residual flow is estimated and applied in the high resolution, so that the deformation is built up in the coarse-to-fine fashion. To better constrain the model, we synthesize a rough target view image based on the intermediate flows and their warped features. The extensive ablation studies and the final results on two different data sets show the effectiveness of the proposed model.

cs.CV↗

arXiv2021

Adaptive Random Bandwidth for Inference in CAViaR Models

This paper investigates the size performance of Wald tests for CAViaR models (Engle and Manganelli, 2004). We find that the usual estimation strategy on test statistics yields inaccuracies. Indeed, we show that existing density estimation methods cannot adapt to the time-variation in the conditional probability densities of CAViaR models. Consequently, we develop a method called adaptive random bandwidth which can approximate time-varying conditional probability densities robustly for inference testing on CAViaR models based on the asymptotic normality of the model parameter estimator. This proposed method also avoids the problem of choosing an optimal bandwidth in estimating probability densities, and can be extended to multivariate quantile regressions straightforward.

econ.EM↗

arXiv2020

Context Matters: Graph-based Self-supervised Representation Learning for Medical Images

Supervised learning method requires a large volume of annotated datasets. Collecting such datasets is time-consuming and expensive. Until now, very few annotated COVID-19 imaging datasets are available. Although self-supervised learning enables us to bootstrap the training by exploiting unlabeled data, the generic self-supervised methods for natural images do not sufficiently incorporate the context. For medical images, a desirable method should be sensitive enough to detect deviation from normal-appearing tissue of each anatomical region; here, anatomy is the context. We introduce a novel approach with two levels of self-supervised representation learning objectives: one on the regional anatomical level and another on the patient-level. We use graph neural networks to incorporate the relationship between different anatomical regions. The structure of the graph is informed by anatomical correspondences between each patient and an anatomical atlas. In addition, the graph representation has the advantage of handling any arbitrarily sized image in full resolution. Experiments on large-scale Computer Tomography (CT) datasets of lung images show that our approach compares favorably to baseline methods that do not account for the context. We use the learnt embedding to quantify the clinical progression of COVID-19 and show that our method generalizes well to COVID-19 patients from different hospitals. Qualitative results suggest that our model can identify clinically relevant regions in the images.

eess.IV↗

arXiv2020

Content-based Analysis of the Cultural Differences between TikTok and Douyin

Short-form video social media shifts away from the traditional media paradigm by telling the audience a dynamic story to attract their attention. In particular, different combinations of everyday objects can be employed to represent a unique scene that is both interesting and understandable. Offered by the same company, TikTok and Douyin are popular examples of such new media that has become popular in recent years, while being tailored for different markets (e.g. the United States and China). The hypothesis that they express cultural differences together with media fashion and social idiosyncrasy is the primary target of our research. To that end, we first employ the Faster Regional Convolutional Neural Network (Faster R-CNN) pre-trained with the Microsoft Common Objects in COntext (MS-COCO) dataset to perform object detection. Based on a suite of objects detected from videos, we perform statistical analysis including label statistics, label similarity, and label-person distribution. We further use the Two-Stream Inflated 3D ConvNet (I3D) pre-trained with the Kinetics dataset to categorize and analyze human actions. By comparing the distributional results of TikTok and Douyin, we uncover a wealth of similarity and contrast between the two closely related video social media platforms along the content dimensions of object quantity, object categories, and human action categories.

cs.CV↗

arXiv2020

Progressive Multi-stage Feature Mix for Person Re-Identification

Image features from a small local region often give strong evidence in person re-identification task. However, CNN suffers from paying too much attention on the most salient local areas, thus ignoring other discriminative clues, e.g., hair, shoes or logos on clothes. %BDB proposes to randomly drop one block in a batch to enlarge the high response areas. Although BDB has achieved remarkable results, there still room for improvement. In this work, we propose a Progressive Multi-stage feature Mix network (PMM), which enables the model to find out the more precise and diverse features in a progressive manner. Specifically, 1. to enforce the model to look for different clues in the image, we adopt a multi-stage classifier and expect that the model is able to focus on a complementary region in each stage. 2. we propose an Attentive feature Hard-Mix (A-Hard-Mix) to replace the salient feature blocks by the negative example in the current batch, whose label is different from the current sample. 3. extensive experiments have been carried out on reID datasets such as the Market-1501, DukeMTMC-reID and CUHK03, showing that the proposed method can boost the re-identification performance significantly.

cs.CV↗

arXiv2020

Imagine That! Leveraging Emergent Affordances for 3D Tool Synthesis

In this paper we explore the richness of information captured by the latent space of a vision-based generative model. The model combines unsupervised generative learning with a task-based performance predictor to learn and to exploit task-relevant object affordances given visual observations from a reaching task, involving a scenario and a stick-like tool. While the learned embedding of the generative model captures factors of variation in 3D tool geometry (e.g. length, width, and shape), the performance predictor identifies sub-manifolds of the embedding that correlate with task success. Within a variety of scenarios, we demonstrate that traversing the latent space via backpropagation from the performance predictor allows us to imagine tools appropriate for the task at hand. Our results indicate that affordances-like the utility for reaching-are encoded along smooth trajectories in latent space. Accessing these emergent affordances by considering only high-level performance criteria (such as task success) enables an agent to manipulate tool geometries in a targeted and deliberate way.

cs.LG↗

arXiv2020

End-to-end Recurrent Multi-Object Tracking and Trajectory Prediction with Relational Reasoning

The majority of contemporary object-tracking approaches do not model interactions between objects. This contrasts with the fact that objects' paths are not independent: a cyclist might abruptly deviate from a previously planned trajectory in order to avoid colliding with a car. Building upon HART, a neural class-agnostic single-object tracker, we introduce a multi-object tracking method MOHART capable of relational reasoning. Importantly, the entire system, including the understanding of interactions and relations between objects, is class-agnostic and learned simultaneously in an end-to-end fashion. We explore a number of relational reasoning architectures and show that permutation-invariant models outperform non-permutation-invariant alternatives. We also find that architectures using a single permutation invariant operation like DeepSets, despite, in theory, being universal function approximators, are nonetheless outperformed by a more complex architecture based on multi-headed attention. The latter better accounts for complex physical interactions in a challenging toy experiment. Further, we find that modelling interactions leads to consistent performance gains in tracking as well as future trajectory prediction on three real-world datasets (MOTChallenge, UA-DETRAC, and Stanford Drone dataset), particularly in the presence of ego-motion, occlusions, crowded scenes, and faulty sensor inputs.

cs.CV↗

arXiv2020

Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters

Graph Neural Networks (GNNs) have been widely applied to fraud detection problems in recent years, revealing the suspiciousness of nodes by aggregating their neighborhood information via different relations. However, few prior works have noticed the camouflage behavior of fraudsters, which could hamper the performance of GNN-based fraud detectors during the aggregation process. In this paper, we introduce two types of camouflages based on recent empirical studies, i.e., the feature camouflage and the relation camouflage. Existing GNNs have not addressed these two camouflages, which results in their poor performance in fraud detection problems. Alternatively, we propose a new model named CAmouflage-REsistant GNN (CARE-GNN), to enhance the GNN aggregation process with three unique modules against camouflages. Concretely, we first devise a label-aware similarity measure to find informative neighboring nodes. Then, we leverage reinforcement learning (RL) to find the optimal amounts of neighbors to be selected. Finally, the selected neighbors across different relations are aggregated together. Comprehensive experiments on two real-world fraud datasets demonstrate the effectiveness of the RL algorithm. The proposed CARE-GNN also outperforms state-of-the-art GNNs and GNN-based fraud detectors. We integrate all GNN-based fraud detectors as an opensource toolbox: https://github.com/safe-graph/DGFraud. The CARE-GNN code and datasets are available at https://github.com/YingtongDou/CARE-GNN.

cs.SI↗