Search arXiv⌕ Search

arXiv subjects

Yang Chen

Publications and source records attributed to Yang Chen.

At least 559 records · Page 31Linked to original sources

The Predicted Properties of Helium-Enriched Globular Cluster Progenitors at High Redshift

Globular cluster progenitors may have been detected by \textit{HST}, and are predicted to be observable with \textit{JWST} and ground-based extremely-large telescopes with adaptive optics. This has the potential to elucidate the issue of globular cluster formation and the origins of significantly helium-enriched subpopulations, a problem in Galactic astronomy with no satisfactory theoretical solution. Given this context, we use model stellar tracks and isochrones to investigate the predicted observational properties of helium-enriched stellar populations in globular cluster progenitors. We find that, relative to helium-normal populations, helium-enriched ($ΔY=+0.12$) stellar populations similar to those inferred in the most massive globular clusters, are expected, modulo some rapid fluctuations in the first $\sim$30 Myr, to be brighter and redder in the rest frame. At fixed age, stellar mass, and metallicity, a helium-enriched population is predicted to converge to being $\sim$0.40 mag brighter at $λ\approx 2.0\, μm$, and to be 0.30 mag redder in the \textit{JWST}-NIRCam colour $(F070W-F200W)$, and to actually be fainter for $λ\lesssim 0.50 \, μm$. Separately, we find that the time-integrated shift in ionizing radiation is a negligible $\sim 5\%$, though we show that the Lyman-$α$ escape fraction could end up higher for helium-enriched stars.

astro-ph.SR↗

Self-supervised Light Field View Synthesis Using Cycle Consistency

High angular resolution is advantageous for practical applications of light fields. In order to enhance the angular resolution of light fields, view synthesis methods can be utilized to generate dense intermediate views from sparse light field input. Most successful view synthesis methods are learning-based approaches which require a large amount of training data paired with ground truth. However, collecting such large datasets for light fields is challenging compared to natural images or videos. To tackle this problem, we propose a self-supervised light field view synthesis framework with cycle consistency. The proposed method aims to transfer prior knowledge learned from high quality natural video datasets to the light field view synthesis task, which reduces the need for labeled light field data. A cycle consistency constraint is used to build bidirectional mapping enforcing the generated views to be consistent with the input views. Derived from this key concept, two loss functions, cycle loss and reconstruction loss, are used to fine-tune the pre-trained model of a state-of-the-art video interpolation method. The proposed method is evaluated on various datasets to validate its robustness, and results show it not only achieves competitive performance compared to supervised fine-tuning, but also outperforms state-of-the-art light field view synthesis methods, especially when generating multiple intermediate views. Besides, our generic light field view synthesis framework can be adopted to any pre-trained model for advanced video interpolation.

eess.IV↗

Fast and Accurate Optical Flow based Depth Map Estimation from Light Fields

Depth map estimation is a crucial task in computer vision, and new approaches have recently emerged taking advantage of light fields, as this new imaging modality captures much more information about the angular direction of light rays compared to common approaches based on stereoscopic images or multi-view. In this paper, we propose a novel depth estimation method from light fields based on existing optical flow estimation methods. The optical flow estimator is applied on a sequence of images taken along an angular dimension of the light field, which produces several disparity map estimates. Considering both accuracy and efficiency, we choose the feature flow method as our optical flow estimator. Thanks to its spatio-temporal edge-aware filtering properties, the different disparity map estimates that we obtain are very consistent, which allows a fast and simple aggregation step to create a single disparity map, which can then converted into a depth map. Since the disparity map estimates are consistent, we can also create a depth map from each disparity estimate, and then aggregate the different depth maps in the 3D space to create a single dense depth map.

cs.CV↗

A Study of Efficient Light Field Subsampling and Reconstruction Strategies

Limited angular resolution is one of the main obstacles for practical applications of light fields. Although numerous approaches have been proposed to enhance angular resolution, view selection strategies have not been well explored in this area. In this paper, we study subsampling and reconstruction strategies for light fields. First, different subsampling strategies are studied with a fixed sampling ratio, such as row-wise sampling, column-wise sampling, or their combinations. Second, several strategies are explored to reconstruct intermediate views from four regularly sampled input views. The influence of the angular density of the input is also evaluated. We evaluate these strategies on both real-world and synthetic datasets, and optimal selection strategies are devised from our results. These can be applied in future light field research such as compression, angular super-resolution, and design of camera systems.

cs.CV↗

Modeling the broadest spectral band of the Crab nebula and constraining the ions acceleration efficiency

Although it is widely accepted that the electromagnetic spectrum from radio to very-high-energy $γ$-rays of pulsar wind nebulae (PWNe) originates from leptons, there is still an open question that protons (or more generally, ions) may exist in pulsar wind and are further accelerated in PWN. The broadband spectrum of the prototype PWN Crab, extended recently by the detection of the Tibet AS$γ$ and HAWC experiments above 100 TeV, may be helpful in constraining the acceleration efficiency of ions. Here, we model the broadest energy spectrum of Crab and find that the broadband spectrum can be explained by the one-zone leptonic model in which the electrons/positrons produce the emission from radio to soft $γ$-rays via the synchrotron process, and simultaneously generate the GeV-TeV $γ$-rays through inverse Compton scattering including the synchrotron self-Compton process. In the framework of this leptonic model, the fraction of energy converted into the energetic protons is constrained to be below $0.5\ (n_{\rm t}/10\ {\rm cm}^{-3})^{-1}$ per cent, where $n_{\rm t}$ is the target gas density in the Crab. However, this fraction can be up to $7\ (n_{\rm t}/10\ {\rm cm}^{-3})^{-1}$ per cent if only the $γ$-rays are used.

astro-ph.HE↗

Deep Complementary Joint Model for Complex Scene Registration and Few-shot Segmentation on Medical Images

Deep learning-based medical image registration and segmentation joint models utilize the complementarity (augmentation data or weakly supervised data from registration, region constraints from segmentation) to bring mutual improvement in complex scene and few-shot situation. However, further adoption of the joint models are hindered: 1) the diversity of augmentation data is reduced limiting the further enhancement of segmentation, 2) misaligned regions in weakly supervised data disturb the training process, 3) lack of label-based region constraints in few-shot situation limits the registration performance. We propose a novel Deep Complementary Joint Model (DeepRS) for complex scene registration and few-shot segmentation. We embed a perturbation factor in the registration to increase the activity of deformation thus maintaining the augmentation data diversity. We take a pixel-wise discriminator to extract alignment confidence maps which highlight aligned regions in weakly supervised data so the misaligned regions' disturbance will be suppressed via weighting. The outputs from segmentation model are utilized to implement deep-based region constraints thus relieving the label requirements and bringing fine registration. Extensive experiments on the CT dataset of MM-WHS 2017 Challenge show great advantages of our DeepRS that outperforms the existing state-of-the-art models.

cs.CV↗

Control Interface for Hands-free Navigation of Standing Mobility Vehicles based on Upper-Body Natural Movements

In this paper, we propose and evaluate a novel human-machine interface (HMI) for controlling a standing mobility vehicle or person carrier robot, aiming for a hands-free control through upper-body natural postures derived from gaze tracking while walking. We target users with lower-body impairment with remaining upper-body motion capabilities. The developed HMI bases on a sensing array for capturing body postures; an intent recognition algorithm for continuous mapping of body motions to robot control space; and a personalizing system for multiple body sizes and shapes. We performed two user studies: first, an analysis of the required body muscles involved in navigating with the proposed control; and second, an assessment of the HMI compared with a standard joystick through quantitative and qualitative metrics in a narrow circuit task. We concluded that the main user control contribution comes from Rectus Abdominis and Erector Spinae muscle groups at different levels. Finally, the comparative study showed that a joystick still outperforms the proposed HMI in usability perceptions and controllability metrics, however, the smoothness of user control was similar in jerk and fluency. Moreover, users' perceptions showed that hands-free control made it more anthropomorphic, animated, and even safer.

cs.RO↗

MAGIC: Manifold and Graph Integrative Convolutional Network for Low-Dose CT Reconstruction

Low-dose computed tomography (LDCT) scans, which can effectively alleviate the radiation problem, will degrade the imaging quality. In this paper, we propose a novel LDCT reconstruction network that unrolls the iterative scheme and performs in both image and manifold spaces. Because patch manifolds of medical images have low-dimensional structures, we can build graphs from the manifolds. Then, we simultaneously leverage the spatial convolution to extract the local pixel-level features from the images and incorporate the graph convolution to analyze the nonlocal topological features in manifold space. The experiments show that our proposed method outperforms both the quantitative and qualitative aspects of state-of-the-art methods. In addition, aided by a projection loss component, our proposed method also demonstrates superior performance for semi-supervised learning. The network can remove most noise while maintaining the details of only 10% (40 slices) of the training data labeled.

eess.IV↗

Semi-supervised ASR by End-to-end Self-training

While deep learning based end-to-end automatic speech recognition (ASR) systems have greatly simplified modeling pipelines, they suffer from the data sparsity issue. In this work, we propose a self-training method with an end-to-end system for semi-supervised ASR. Starting from a Connectionist Temporal Classification (CTC) system trained on the supervised data, we iteratively generate pseudo-labels on a mini-batch of unsupervised utterances with the current model, and use the pseudo-labels to augment the supervised data for immediate model update. Our method retains the simplicity of end-to-end ASR systems, and can be seen as performing alternating optimization over a well-defined learning objective. We also perform empirical investigations of our method, regarding the effect of data augmentation, decoding beamsize for pseudo-label generation, and freshness of pseudo-labels. On a commonly used semi-supervised ASR setting with the WSJ corpus, our method gives 14.4% relative WER improvement over a carefully-trained base system with data augmentation, reducing the performance gap between the base system and the oracle system by 50%.

eess.AS↗

SMAP: A Joint Dimensionality Reduction Scheme for Secure Multi-Party Visualization

Nowadays, as data becomes increasingly complex and distributed, data analyses often involve several related datasets that are stored on different servers and probably owned by different stakeholders. While there is an emerging need to provide these stakeholders with a full picture of their data under a global context, conventional visual analytical methods, such as dimensionality reduction, could expose data privacy when multi-party datasets are fused into a single site to build point-level relationships. In this paper, we reformulate the conventional t-SNE method from the single-site mode into a secure distributed infrastructure. We present a secure multi-party scheme for joint t-SNE computation, which can minimize the risk of data leakage. Aggregated visualization can be optionally employed to hide disclosure of point-level relationships. We build a prototype system based on our method, SMAP, to support the organization, computation, and exploration of secure joint embedding. We demonstrate the effectiveness of our approach with three case studies, one of which is based on the deployment of our system in real-world applications.

cs.CR↗

Data Techniques For Online End-to-end Speech Recognition

Practitioners often need to build ASR systems for new use cases in a short amount of time, given limited in-domain data. While recently developed end-to-end methods largely simplify the modeling pipelines, they still suffer from the data sparsity issue. In this work, we explore a few simple-to-implement techniques for building online ASR systems in an end-to-end fashion, with a small amount of transcribed data in the target domain. These techniques include data augmentation in the target domain, domain adaptation using models previously trained on a large source domain, and knowledge distillation on non-transcribed target domain data, using an adapted bi-directional model as the teacher; they are applicable in real scenarios with different types of resources. Our experiments demonstrate that each technique is independently useful in the improvement of the online ASR performance in the target domain.

eess.AS↗

Molecular Clouds Surrounding Supernova Remnant G43.9+1.6: Associated and Non-associated

Many supernova remnants (SNRs) are considered to evolve in molecular environments, but the associations between SNRs and molecular clouds (MCs) are often unclear. Being aware of such ambiguous case, we report our study on the molecular environment towards the SNR G43.9+1.6 by CO line observations. We investigated the correlations between the SNR and MCs at different velocities, and found two velocity components, i.e. $\sim$5 km s$^{-1}$ and $\sim$50 km s$^{-1}$ velocity components, showing spatial correlations with the remnant. However, no dynamical evidence of disturbance was found for the $\sim$5 km s$^{-1}$ velocity component. At the distance of the $\sim$5 km s$^{-1}$ velocity component, either near or far distance, the derived physical parameters are unreasonable too. We conclude that the SNR is not associated with the $\sim$5 km s$^{-1}$ velocity component, and their spatial correlation is just a chance correlation. For the $\sim$50 km s$^{-1}$ velocity component, dynamical evidence of disturbances, as well as the spatial correlation, indicate that it is associated with the SNR. We found that all the CO spectra extracted from the molecular clumps distributed along the border of the remnant are with broadened components presented, which can be fitted by Gaussian functions. By further analysis, we suggest that the SNR is at a near kinematic distance of about 3.1 kpc.

astro-ph.HE↗

Non-adiabatic transitions in parabolic and super-parabolic $\mathcal{PT}$-symmetric non-Hermitian systems

Exceptional points, the spectral degeneracy points in the complex parameter space, are fundamental to non-Hermitian quantum systems. The dynamics of non-Hermitian systems in the presence of exceptional points differ significantly from those of Hermitian ones. Here we investigate non-adiabatic transitions in non-Hermitian $\mathcal{P}\mathcal{T}$-symmetric systems, in which the exceptional points are driven through at finite speed which are quadratic or cubic functions of time. We identity different transmission dynamics separated by exceptional points, and derive analytical approximate formulas for the non-adiabatic transmission probabilities. We discuss possible experimental realizations with a $\mathcal{P}\mathcal{T}$-symmetric non-Hermitian one-dimensional tight-binding optical waveguide lattice.

quant-ph↗

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↗

Carbon star formation as seen through the non-monotonic initial-final mass relation

The initial-final mass relation (IFMR) links the birth mass of a star to the mass of the compact remnant left at its death. While the relevance of the IFMR across astrophysics is universally acknowledged, not all of its fine details have yet been resolved. A new analysis of a few carbon-oxygen white dwarfs in old open clusters of the Milky Way led us to identify a kink in the IFMR, located over a range of initial masses, $1.65 \lesssim M_{\rm i}/M_{\odot} \lesssim 2.10$. The kink's peak in WD mass of $\approx 0.70-0.75 \, M_{\odot}$ is produced by stars with $M_{\rm i} \simeq 1.8 - 1.9 \, M_{\odot}$, corresponding to ages of about $1.8 - 1.7 $ Gyr. Interestingly, this peak coincides with the initial mass limit between low-mass stars that develop a degenerate helium core after central hydrogen exhaustion, and intermediate-mass stars that avoid electron degeneracy. We interpret the IFMR kink as the signature of carbon star formation in the Milky Way. This finding is critical to constraining the evolution and chemical enrichment of low-mass stars, and their impact on the spectrophotometric properties of galaxies.

astro-ph.SR↗

PoPE: A population-based approach to model spatial structure of astronomical systems

We present a novel population-based Bayesian inference approach to model the average and population variance of spatial distribution of a set of observables from ensemble analysis of low signal-to-noise ratio measurements. The method consists of (1) inferring the average profile using Gaussian Processes and (2) computing the covariance of the profile observables given a set of independent variables. Our model is computationally efficient and capable of inferring average profiles of a large population size from noisy measurements, without stacking and binning data nor parameterizing the shape of the mean profile. We demonstrate the performance of our method using dark matter, gas and stellar profiles extracted from hydrodynamical cosmological simulations of galaxy formation. Population Profile Estimator (PoPE) is publicly available in a GitHub repository. Our new method should be useful for measuring the spatial distribution and internal structure of a variety of astrophysical systems using large astronomical surveys.

astro-ph.CO↗

Painlevé V and the Hankel Determinant for a Singularly Perturbed Jacobi Weight

We study the Hankel determinant generated by a singularly perturbed Jacobi weight $$ w(x,t):=(1-x^2)^α\mathrm{e}^{-\frac{t}{x^{2}}},\;\;\;\;\;\;x\in[-1,1],\;\;α>0,\;\;t\geq 0. $$ If $t=0$, it is reduced to the classical symmetric Jacobi weight. For $t>0$, the factor $\mathrm{e}^{-\frac{t}{x^{2}}}$ induces an infinitely strong zero at the origin. This Hankel determinant is related to the Wigner time-delay distribution in chaotic cavities. In the finite $n$ dimensional case, we obtain two auxiliary quantities $R_n(t)$ and $r_n(t)$ by using the ladder operator approach. We show that the Hankel determinant has an integral representation in terms of $R_n(t)$, where $R_n(t)$ is closely related to a particular Painlevé V transcendent. Furthermore, we derive a second-order nonlinear differential equation and also a second-order difference equation for the logarithmic derivative of the Hankel determinant. This quantity can be expressed in terms of the Jimbo-Miwa-Okamoto $σ$-function of a particular Painlevé V. Then we consider the asymptotics of the Hankel determinant under a suitable double scaling, i.e. $n\rightarrow\infty$ and $t\rightarrow 0$ such that $s=2n^2 t$ is fixed. Based on previous results by using the Coulomb fluid method, we obtain the large $s$ and small $s$ asymptotic behaviors of the scaled Hankel determinant, including the constant term in the asymptotic expansion.

math-ph↗

Progressively Unfreezing Perceptual GAN

Generative adversarial networks (GANs) are widely used in image generation tasks, yet the generated images are usually lack of texture details. In this paper, we propose a general framework, called Progressively Unfreezing Perceptual GAN (PUPGAN), which can generate images with fine texture details. Particularly, we propose an adaptive perceptual discriminator with a pre-trained perceptual feature extractor, which can efficiently measure the discrepancy between multi-level features of the generated and real images. In addition, we propose a progressively unfreezing scheme for the adaptive perceptual discriminator, which ensures a smooth transfer process from a large scale classification task to a specified image generation task. The qualitative and quantitative experiments with comparison to the classical baselines on three image generation tasks, i.e. single image super-resolution, paired image-to-image translation and unpaired image-to-image translation demonstrate the superiority of PUPGAN over the compared approaches.

cs.CV↗