Searcharxiv⌕ Search

arXiv subjects

Cheng Li

Publications and source records attributed to Cheng Li.

At least 289 records · Page 16Linked to original sources

Galaxy populations in groups and clusters: evidence for a characteristic stellar mass scale at $M_\ast\sim 10^{9.5}M_\odot$

We use the most recent data release (DR9) of the DESI legacy imaging survey and SDSS galaxy groups to measure the conditional luminosity function (CLF) for groups with halo mass $M_{\rm h}\ge 10^{12}M_{\odot}$ and redshift $0.01\le z\le 0.08$, down to a limiting $r$-band magnitude of $M_{\rm r}=-10\sim-12$. For a given halo mass we measure the CLF for the total satellite population, as well as separately for the red and blue populations classified using the $(g-z)$ color. We find a clear faint-end upturn in the CLF of red satellites, with a slope $α\approx-1.8$ which is almost independent of halo mass. This faint-end upturn is not seen for blue satellites and for the total population. Our stellar population synthesis modeling shows that the $(g-z)$ color provides a clean red/blue division, and that group galaxies in the red population defined by $(g-z)$ are all dominated by old stellar populations. The fraction of old galaxies as a function of galaxy luminosity shows a minimum at a luminosity $M_{\rm r}\sim-18$, corresponding to a stellar mass $M_\ast\sim10^{9.5}M_\odot$. This mass scale is independent of halo mass and is comparable to the characteristic luminosity at which galaxies show a dichotomy in surface brightness and size, suggesting that the dichotomy in the old fraction and in galaxy structure may have a common origin. The rising of the old fraction at the faint end for Milky Way (MW)-sized halos found here is in good agreement with the quenched fraction measured both for the MW/M31 system and from the ELVES survey. We discuss the implications of our results for the formation and evolution of low-mass galaxies, and for the stellar mass functions of low-mass galaxies to be observed at high redshift.

astro-ph.GA↗

Conditional HI mass functions and the HI-to-halo mass relation in the local Universe

We present a new HI mass estimator which relates the HI-to-stellar mass ratio to four galaxy properties: stellar surface mass density, color index $u-r$, stellar mass and concentration index, with the scatter of individual galaxies around the mean HI mass modeled with a Gaussian distribution. We calibrate the estimator using the xGASS sample, including both HI detection and non-detection, and constrain the model parameters through Bayesian inferences. Tests with mock catalogs demonstrate that our estimator provides unbiased HI masses for optical samples like the SDSS, thus suitable for statistical studies of HI gas contents in galaxies and dark matter halos. We apply our estimator to the SDSS spectroscopic sample to estimate the local HI mass function (HIMF), the conditional HI mass function (CHIMF) in galaxy groups and the HI-halo mass (HIHM) relation. Our HIMF agrees with the ALFALFA measurements at $M_{HI}\gtrsim 5\times 10^9M_{\odot}$, but with higher amplitude and a steeper slope at lower masses. We show that this discrepancy is caused primarily by the cosmic variance which is corrected for the SDSS sample but not for the ALFALFA. The CHIMFs for all halo masses can be described by a single Schechter function, and this is true for red, blue and satellite galaxies. For central galaxies the CHIMFs show a double-Gaussian profile, with the two components contributed by the red and blue galaxies, respectively. The total HI mass in a group increases monotonically with halo mass. The HI mass of central galaxies in galaxy groups increases rapidly with halo mass only at $M_h\lesssim10^{12}M_{\odot}$, while the mass dependence becomes much weaker at higher halo masses. The observed HI-halo mass relation is not reproduced by current hydrodynamic simulations and semi-analytic models of galaxy formation.

astro-ph.GA↗

Energy transfer and third-order law in forced anisotropic MHD turbulence with hyperviscosity

The Kolmogorov-Yaglom (third-order) law, links energy transfer rates in the inertial range of magneto-hydrodynamic (MHD) turbulence with third-order structure functions. Anisotropy, a typical property in the solar wind, largely challenges the applicability of the third-order law with isotropic assumption. To shed light on the energy transfer process in the presence of anisotropy, the present study conducted direct numerical simulations (DNSs) on forced MHD turbulence with normal and hyper-viscosity under various strengths of the external magnetic field ($B_0$), and calculated three forms of third-order structure function with or without averaging azimuthal or polar angles to $B_0$ direction. Correspondingly, three forms of estimated energy transfer rates were studied systematically with various $B_0$. The result shows that the peak of the estimated longitudinal transfer rate occurs at larger scales as closer to the $B_0$ direction, and its maximum shifts away from the $B_0$ direction at larger $B_0$. Compared with normal viscous cases, hyper-viscous cases can attain better separation of the inertial range from the dissipation range, thus facilitating the analyses of the inertial range properties and the estimation of the energy cascade rates. The direction-averaged third-order structure function over a spherical surface proposed in literature predicts the energy transfer rates and inertial range accurately, even at very high $B_0$. With limited statistics, the calculation of the third-order structure function shows a stronger dependence on averaging of azimuthal angles than the time, especially at high $B_0$ cases. These findings provide insights into the anisotropic effect on the estimation of energy transfer rates.

physics.flu-dyn↗

Flux Variations of Cosmic Ray Air Showers Detected by LHAASO-KM2A During a Thunderstorm on 10 June 2021

The Large High Altitude Air Shower Observatory (LHAASO) has three sub-arrays, KM2A, WCDA and WFCTA. The flux variations of cosmic ray air showers were studied by analyzing the KM2A data during the thunderstorm on 10 June 2021. The number of shower events that meet the trigger conditions increases significantly in atmospheric electric fields, with maximum fractional increase of 20%. The variations of trigger rates (increases or decreases) are found to be strongly dependent on the primary zenith angle. The flux of secondary particles increases significantly, following a similar trend with that of the shower events. To better understand the observed behavior, Monte Carlo simulations are performed with CORSIKA and G4KM2A (a code based on GEANT4). We find that the experimental data (in saturated negative fields) are in good agreement with simulations, assuming the presence of a uniform upward electric field of 700 V/cm with a thickness of 1500 m in the atmosphere above the observation level. Due to the acceleration/deceleration and deflection by the atmospheric electric field, the number of secondary particles with energy above the detector threshold is modified, resulting in the changes in shower detection rate.

astro-ph.HE↗

Iterative Data Refinement for Self-Supervised MR Image Reconstruction

Magnetic Resonance Imaging (MRI) has become an important technique in the clinic for the visualization, detection, and diagnosis of various diseases. However, one bottleneck limitation of MRI is the relatively slow data acquisition process. Fast MRI based on k-space undersampling and high-quality image reconstruction has been widely utilized, and many deep learning-based methods have been developed in recent years. Although promising results have been achieved, most existing methods require fully-sampled reference data for training the deep learning models. Unfortunately, fully-sampled MRI data are difficult if not impossible to obtain in real-world applications. To address this issue, we propose a data refinement framework for self-supervised MR image reconstruction. Specifically, we first analyze the reason of the performance gap between self-supervised and supervised methods and identify that the bias in the training datasets between the two is one major factor. Then, we design an effective self-supervised training data refinement method to reduce this data bias. With the data refinement, an enhanced self-supervised MR image reconstruction framework is developed to prompt accurate MR imaging. We evaluate our method on an in-vivo MRI dataset. Experimental results show that without utilizing any fully sampled MRI data, our self-supervised framework possesses strong capabilities in capturing image details and structures at high acceleration factors.

eess.IV↗

Convergence Analysis of Stochastic Kriging-Assisted Simulation with Random Covariates

We consider performing simulation experiments in the presence of covariates. Here, covariates refer to some input information other than system designs to the simulation model that can also affect the system performance. To make decisions, decision makers need to know the covariate values of the problem. Traditionally in simulation-based decision making, simulation samples are collected after the covariate values are known; in contrast, as a new framework, simulation with covariates starts the simulation before the covariate values are revealed, and collects samples on covariate values that might appear later. Then, when the covariate values are revealed, the collected simulation samples are directly used to predict the desired results. This framework significantly reduces the decision time compared to the traditional way of simulation. In this paper, we follow this framework and suppose there are a finite number of system designs. We adopt the metamodel of stochastic kriging (SK) and use it to predict the system performance of each design and the best design. The goal is to study how fast the prediction errors diminish with the number of covariate points sampled. This is a fundamental problem in simulation with covariates and helps quantify the relationship between the offline simulation efforts and the online prediction accuracy. Particularly, we adopt measures of the maximal integrated mean squared error (IMSE) and integrated probability of false selection (IPFS) for assessing errors of the system performance and the best design predictions. Then, we establish convergence rates for the two measures under mild conditions. Last, these convergence behaviors are illustrated numerically using test examples.

stat.ME↗

A Statistical Approach to Estimating Adsorption-Isotherm Parameters in Gradient-Elution Preparative Liquid Chromatography

Determining the adsorption isotherms is an issue of significant importance in preparative chromatography. A modern technique for estimating adsorption isotherms is to solve an inverse problem so that the simulated batch separation coincides with actual experimental results. However, due to the ill-posedness, the high non-linearity, and the uncertainty quantification of the corresponding physical model, the existing deterministic inversion methods are usually inefficient in real-world applications. To overcome these difficulties and study the uncertainties of the adsorption-isotherm parameters, in this work, based on the Bayesian sampling framework, we propose a statistical approach for estimating the adsorption isotherms in various chromatography systems. Two modified Markov chain Monte Carlo algorithms are developed for a numerical realization of our statistical approach. Numerical experiments with both synthetic and real data are conducted and described to show the efficiency of the proposed new method.

stat.AP↗

Random-LTD: Random and Layerwise Token Dropping Brings Efficient Training for Large-scale Transformers

Large-scale transformer models have become the de-facto architectures for various machine learning applications, e.g., CV and NLP. However, those large models also introduce prohibitive training costs. To mitigate this issue, we propose a novel random and layerwise token dropping method (random-LTD), which skips the computation of a subset of the input tokens at all middle layers. Particularly, random-LTD achieves considerable speedups and comparable accuracy as the standard training baseline. Compared to other token dropping methods, random-LTD does not require (1) any importance score-based metrics, (2) any special token treatment (e.g., [CLS]), and (3) many layers in full sequence length training except the first and the last layers. Besides, a new LayerToken learning rate schedule is proposed for pretraining problems that resolve the heavy tuning requirement for our proposed training mechanism. Finally, we demonstrate that random-LTD can be applied to broader applications, including GPT and BERT pretraining as well as ViT and GPT finetuning tasks. Our results show that random-LTD can save about 33.3% theoretical compute cost and 25.6% wall-clock training time while achieving similar zero-shot evaluations on GPT-31.3B as compared to baseline.

cs.CL↗

Uncertainty-Aware Multi-Parametric Magnetic Resonance Image Information Fusion for 3D Object Segmentation

Multi-parametric magnetic resonance (MR) imaging is an indispensable tool in the clinic. Consequently, automatic volume-of-interest segmentation based on multi-parametric MR imaging is crucial for computer-aided disease diagnosis, treatment planning, and prognosis monitoring. Despite the extensive studies conducted in deep learning-based medical image analysis, further investigations are still required to effectively exploit the information provided by different imaging parameters. How to fuse the information is a key question in this field. Here, we propose an uncertainty-aware multi-parametric MR image feature fusion method to fully exploit the information for enhanced 3D image segmentation. Uncertainties in the independent predictions of individual modalities are utilized to guide the fusion of multi-modal image features. Extensive experiments on two datasets, one for brain tissue segmentation and the other for abdominal multi-organ segmentation, have been conducted, and our proposed method achieves better segmentation performance when compared to existing models.

eess.IV↗

Semi-Supervised and Self-Supervised Collaborative Learning for Prostate 3D MR Image Segmentation

Volumetric magnetic resonance (MR) image segmentation plays an important role in many clinical applications. Deep learning (DL) has recently achieved state-of-the-art or even human-level performance on various image segmentation tasks. Nevertheless, manually annotating volumetric MR images for DL model training is labor-exhaustive and time-consuming. In this work, we aim to train a semi-supervised and self-supervised collaborative learning framework for prostate 3D MR image segmentation while using extremely sparse annotations, for which the ground truth annotations are provided for just the central slice of each volumetric MR image. Specifically, semi-supervised learning and self-supervised learning methods are used to generate two independent sets of pseudo labels. These pseudo labels are then fused by Boolean operation to extract a more confident pseudo label set. The images with either manual or network self-generated labels are then employed to train a segmentation model for target volume extraction. Experimental results on a publicly available prostate MR image dataset demonstrate that, while requiring significantly less annotation effort, our framework generates very encouraging segmentation results. The proposed framework is very useful in clinical applications when training data with dense annotations are difficult to obtain.

cs.CV↗

Adaptive PromptNet For Auxiliary Glioma Diagnosis without Contrast-Enhanced MRI

Multi-contrast magnetic resonance imaging (MRI)-based automatic auxiliary glioma diagnosis plays an important role in the clinic. Contrast-enhanced MRI sequences (e.g., contrast-enhanced T1-weighted imaging) were utilized in most of the existing relevant studies, in which remarkable diagnosis results have been reported. Nevertheless, acquiring contrast-enhanced MRI data is sometimes not feasible due to the patients physiological limitations. Furthermore, it is more time-consuming and costly to collect contrast-enhanced MRI data in the clinic. In this paper, we propose an adaptive PromptNet to address these issues. Specifically, a PromptNet for glioma grading utilizing only non-enhanced MRI data has been constructed. PromptNet receives constraints from features of contrast-enhanced MR data during training through a designed prompt loss. To further boost the performance, an adaptive strategy is designed to dynamically weight the prompt loss in a sample-based manner. As a result, PromptNet is capable of dealing with more difficult samples. The effectiveness of our method is evaluated on a widely-used BraTS2020 dataset, and competitive glioma grading performance on NE-MRI data is achieved.

eess.IV↗

DIGEST: Deeply supervIsed knowledGE tranSfer neTwork learning for brain tumor segmentation with incomplete multi-modal MRI scans

Brain tumor segmentation based on multi-modal magnetic resonance imaging (MRI) plays a pivotal role in assisting brain cancer diagnosis, treatment, and postoperative evaluations. Despite the achieved inspiring performance by existing automatic segmentation methods, multi-modal MRI data are still unavailable in real-world clinical applications due to quite a few uncontrollable factors (e.g. different imaging protocols, data corruption, and patient condition limitations), which lead to a large performance drop during practical applications. In this work, we propose a Deeply supervIsed knowledGE tranSfer neTwork (DIGEST), which achieves accurate brain tumor segmentation under different modality-missing scenarios. Specifically, a knowledge transfer learning frame is constructed, enabling a student model to learn modality-shared semantic information from a teacher model pretrained with the complete multi-modal MRI data. To simulate all the possible modality-missing conditions under the given multi-modal data, we generate incomplete multi-modal MRI samples based on Bernoulli sampling. Finally, a deeply supervised knowledge transfer loss is designed to ensure the consistency of the teacher-student structure at different decoding stages, which helps the extraction of inherent and effective modality representations. Experiments on the BraTS 2020 dataset demonstrate that our method achieves promising results for the incomplete multi-modal MR image segmentation task.

eess.IV↗

PARCEL: Physics-based Unsupervised Contrastive Representation Learning for Multi-coil MR Imaging

With the successful application of deep learning to magnetic resonance (MR) imaging, parallel imaging techniques based on neural networks have attracted wide attention. However, in the absence of high-quality, fully sampled datasets for training, the performance of these methods is limited. And the interpretability of models is not strong enough. To tackle this issue, this paper proposes a Physics-bAsed unsupeRvised Contrastive rEpresentation Learning (PARCEL) method to speed up parallel MR imaging. Specifically, PARCEL has a parallel framework to contrastively learn two branches of model-based unrolling networks from augmented undersampled multi-coil k-space data. A sophisticated co-training loss with three essential components has been designed to guide the two networks in capturing the inherent features and representations for MR images. And the final MR image is reconstructed with the trained contrastive networks. PARCEL was evaluated on two vivo datasets and compared to five state-of-the-art methods. The results show that PARCEL is able to learn essential representations for accurate MR reconstruction without relying on fully sampled datasets.

eess.IV↗

SJ-HD^2R: Selective Joint High Dynamic Range and Denoising Imaging for Dynamic Scenes

Ghosting artifacts, motion blur, and low fidelity in highlight are the main challenges in High Dynamic Range (HDR) imaging from multiple Low Dynamic Range (LDR) images. These issues come from using the medium-exposed image as the reference frame in previous methods. To deal with them, we propose to use the under-exposed image as the reference to avoid these issues. However, the heavy noise in dark regions of the under-exposed image becomes a new problem. Therefore, we propose a joint HDR and denoising pipeline, containing two sub-networks: (i) a pre-denoising network (PreDNNet) to adaptively denoise input LDRs by exploiting exposure priors; (ii) a pyramid cascading fusion network (PCFNet), introducing an attention mechanism and cascading structure in a multi-scale manner. To further leverage these two paradigms, we propose a selective and joint HDR and denoising (SJ-HD$^2$R) imaging framework, utilizing scenario-specific priors to conduct the path selection with an accuracy of more than 93.3$\%$. We create the first joint HDR and denoising benchmark dataset, which contains a variety of challenging HDR and denoising scenes and supports the switching of the reference image. Extensive experiment results show that our method achieves superior performance to previous methods.

eess.IV↗

Performance Analysis of the Full-Duplex Communicating-Radar Convergence System

This paper aims to explore the feasibility of the spectrum sharing between the communication and radar system. We investigate the full-duplex (FD) joint radar and communication multi-antenna system in which a node labeled ComRad with a dual communication and radar capability is communicating with a downlink and an uplink users, as well as detecting the target of interest simultaneously. Considering a full interference scenario and imperfect channel state information (CSI), the fundamental performance limits of the FD JRC system are analyzed. In particular, we first obtain the downlink rate when the radar signals act as interference. Then, viewing the uplink channel and radar return channel as a multiple access channel, we propose an alternative successive interference cancellation scheme, based on which the achievable uplink communication rate is obtained. For the radar operation, we first derive the general expression of the estimation rate, which quantifies how much information is obtained about the target in terms of the direction, the range and the velocity. Considering the uniform linear antenna array and linear frequency modulated radar signals, we further obtain the exact closed-form estimation rate. Numerical simulations reveal that the joint manner of the communication and radar operations achieves larger rate regions compared to that of working independently.

cs.IT↗

Reversed Image Signal Processing and RAW Reconstruction. AIM 2022 Challenge Report

Cameras capture sensor RAW images and transform them into pleasant RGB images, suitable for the human eyes, using their integrated Image Signal Processor (ISP). Numerous low-level vision tasks operate in the RAW domain (e.g. image denoising, white balance) due to its linear relationship with the scene irradiance, wide-range of information at 12bits, and sensor designs. Despite this, RAW image datasets are scarce and more expensive to collect than the already large and public RGB datasets. This paper introduces the AIM 2022 Challenge on Reversed Image Signal Processing and RAW Reconstruction. We aim to recover raw sensor images from the corresponding RGBs without metadata and, by doing this, "reverse" the ISP transformation. The proposed methods and benchmark establish the state-of-the-art for this low-level vision inverse problem, and generating realistic raw sensor readings can potentially benefit other tasks such as denoising and super-resolution.

eess.IV↗

Bayesian Fixed-domain Asymptotics for Covariance Parameters in a Gaussian Process Model

Gaussian process models typically contain finite dimensional parameters in the covariance function that need to be estimated from the data. We study the Bayesian fixed-domain asymptotics for the covariance parameters in a universal kriging model with an isotropic Matern covariance function, which has many applications in spatial statistics. We show that when the dimension of domain is less than or equal to three, the joint posterior distribution of the microergodic parameter and the range parameter can be factored independently into the product of their marginal posteriors under fixed-domain asymptotics. The posterior of the microergodic parameter is asymptotically close in total variation distance to a normal distribution with shrinking variance, while the posterior distribution of the range parameter does not converge to any point mass distribution in general. Our theory allows an unbounded prior support for the range parameter and flexible designs of sampling points. We further study the asymptotic efficiency and convergence rates in posterior prediction for the Bayesian kriging predictor with covariance parameters randomly drawn from their posterior distribution. In the special case of one-dimensional Ornstein-Uhlenbeck process, we derive explicitly the limiting posterior of the range parameter and the posterior convergence rate for asymptotic efficiency in posterior prediction. We verify these asymptotic results in numerical experiments.

math.ST↗

From WSI-level to Patch-level: Structure Prior Guided Binuclear Cell Fine-grained Detection

Accurately and quickly binuclear cell (BC) detection plays a significant role in predicting the risk of leukemia and other malignant tumors. However, manual microscopy counting is time-consuming and lacks objectivity. Moreover, with the limitation of staining quality and diversity of morphology features in BC microscopy whole slide images (WSIs), traditional image processing approaches are helpless. To overcome this challenge, we propose a two-stage detection method inspired by the structure prior of BC based on deep learning, which cascades to implement BCs coarse detection at the WSI-level and fine-grained classification in patch-level. The coarse detection network is a multi-task detection framework based on circular bounding boxes for cells detection, and central key points for nucleus detection. The circle representation reduces the degrees of freedom, mitigates the effect of surrounding impurities compared to usual rectangular boxes and can be rotation invariant in WSI. Detecting key points in the nucleus can assist network perception and be used for unsupervised color layer segmentation in later fine-grained classification. The fine classification network consists of a background region suppression module based on color layer mask supervision and a key region selection module based on a transformer due to its global modeling capability. Additionally, an unsupervised and unpaired cytoplasm generator network is firstly proposed to expand the long-tailed distribution dataset. Finally, experiments are performed on BC multicenter datasets. The proposed BC fine detection method outperforms other benchmarks in almost all the evaluation criteria, providing clarification and support for tasks such as cancer screenings.

cs.CV↗