Searcharxiv⌕ Search

arXiv subjects

Yunpeng Wang

Publications and source records attributed to Yunpeng Wang.

At least 37 records · Page 2Linked to original sources

A Link-Based Flow Model with Turn-Level Queue Transmission and Time-Varying Free-Flow Speed for Urban Road Networks

Macroscopic link-based flow models are efficient for simulating flow propagation in urban road networks. Existing link-based flow models described traffic states of a link with two state variables of link inflow and outflow and assumed homogeneous traffic states within a whole link. Consequently, the turn-level queue length change within the link can not be captured, resulting in underrepresented queue spillback. Moreover, a constant link free-flow speed was assumed to formulate models, restricting their applicability in modeling phenomena involving time-varying free-flow speed. This study proposed a new link-based flow model by introducing an additional state variable of link queue inflow and adapting the link outflow to be free-flow speed-dependent. In our model, the vehicle propagation within each link is described by the link inflow, queue inflow, and outflow, which depends on the link free-flow speed changes. A node model is further defined to capture the presence of signal control and potential queue spillback, which estimates the constrained flow propagation between adjacent road segments. Simulation experiments were conducted on a single intersection and a network with consecutive intersections to verify the proposed model performance. Results demonstrate the predictive power of the proposed model in predicting traffic operations of intersections with multiple turning movements and time-varying free-flow speed. Our model outperforms the baseline link-based flow model and preserves the computational tractability property of link-based flow models.

eess.SY↗

Prediction of turbulent channel flow using Fourier neural operator-based machine-learning strategy

Fast and accurate predictions of turbulent flows are of great importance in the science and engineering field. In this paper, we investigate the implicit U-Net enhanced Fourier neural operator (IUFNO) in the stable prediction of long-time dynamics of three-dimensional (3D) turbulent channel flows. The trained IUFNO models are tested in the large-eddy simulations (LES) at coarse grids for three friction Reynolds numbers: $Re_τ\approx180$, $395$ and $590$. The adopted near-wall mesh grids are tangibly coarser than the general requirements for wall-resolved LES. Compared to the original Fourier neural operator (FNO), the implicit FNO (IFNO) and U-Net enhanced FNO (UFNO), the IUFNO model has a much better long-term predictive ability. The numerical experiments show that the IUFNO framework outperforms the traditional dynamic Smagorinsky model (DSM) and the wall-adapted local eddy-viscosity (WALE) model in the predictions of a variety of flow statistics and structures, including the mean and fluctuating velocities, the probability density functions (PDFs) and joint PDF of velocity fluctuations, the Reynolds stress profile, the kinetic energy spectrum, and the Q-criterion (vortex structures). Meanwhile, the trained IUFNO models are computationally much faster than the traditional LES models. Thus, the IUFNO model is a promising approach for the fast prediction of wall-bounded turbulent flow.

physics.flu-dyn↗

Prediction of three-dimensional chemically reacting compressible turbulence based on implicit U-Net enhanced Fourier neural operator

The accurate and fast prediction of long-term dynamics of turbulence presents a significant challenge for both traditional numerical simulations and machine learning methods. In recent years, the emergence of neural operators has provided a promising approach to address this issue. The implicit U-Net enhanced Fourier neural operator (IU-FNO) has successfully demonstrated long-term stable predictions for three-dimensional incompressible turbulence. In this study, we extend this method to the three-dimensional chemically reacting compressible turbulence. Numerical results show that the IU-FNO model predicts flow dynamics significantly faster than the traditional dynamic Smagorinsky model (DSM) used in large eddy simulation (LES). In terms of prediction accuracy, the IU-FNO framework outperforms the traditional DSM in predicting the energy spectra of velocity, temperature, and density, the probability density functions (PDFs) of vorticity and velocity increments, and instantaneous spatial structures of temperature. Therefore, the IU-FNO represents a highly promising approach for predicting chemically reacting compressible turbulence.

physics.flu-dyn↗

X-Recon: Learning-based Patient-specific High-Resolution CT Reconstruction from Orthogonal X-Ray Images

Rapid and accurate diagnosis of pneumothorax, utilizing chest X-ray and computed tomography (CT), is crucial for assisted diagnosis. Chest X-ray is commonly used for initial localization of pneumothorax, while CT ensures accurate quantification. However, CT scans involve high radiation doses and can be costly. To achieve precise quantitative diagnosis while minimizing radiation exposure, we proposed X-Recon, a CT ultra-sparse reconstruction network based on ortho-lateral chest X-ray images. X-Recon integrates generative adversarial networks (GANs), including a generator with a multi-scale fusion rendering module and a discriminator enhanced by 3D coordinate convolutional layers, designed to facilitate CT reconstruction. To improve precision, a projective spatial transformer is utilized to incorporate multi-angle projection loss. Additionally, we proposed PTX-Seg, a zero-shot pneumothorax segmentation algorithm, combining image processing techniques with deep-learning models for the segmentation of air-accumulated regions and lung structures. Experiments on a large-scale dataset demonstrate its superiority over existing approaches. X-Recon achieved a significantly higher reconstruction resolution with a higher average spatial resolution and a lower average slice thickness. The reconstruction metrics achieved state-of-the-art performance in terms of several metrics including peak signal-to-noise ratio. The zero-shot segmentation algorithm, PTX-Seg, also demonstrated high segmentation precision for the air-accumulated region, the left lung, and the right lung. Moreover, the consistency analysis for the pneumothorax chest occupancy ratio between reconstructed CT and original CT obtained a high correlation coefficient. Code will be available at: https://github.com/wangyunpengbio/X-Recon

cs.CV↗

The discrete direct deconvolution model in the large eddy simulation of turbulence

The discrete direct deconvolution model (D3M) is developed for the large-eddy simulation (LES) of turbulence. The D3M is a discrete approximation of previous direct deconvolution model studied by Chang et al. ["The effect of sub-filter scale dynamics in large eddy simulation of turbulence," Phys. Fluids 34, 095104 (2022)]. For the first type model D3M-1, the original Gaussian filter is approximated by local discrete formulation of different orders, and direct inverse of the discrete filter is applied to reconstruct the unfiltered flow field. The inverse of original Gaussian filter can be also approximated by local discrete formulation, leading to a fully local model D3M-2. Compared to traditional models including the dynamic Smagorinsky model (DSM) and the dynamic mixed model (DMM), the D3M-1 and D3M-2 exhibit much larger correlation coefficients and smaller relative errors in the a priori studies. In the a posteriori validations, both D3M-1 and D3M-2 can accurately predict turbulence statistics, including velocity spectra, probability density functions (PDFs) of sub-filter scale (SFS) stresses and SFS energy flux, as well as time-evolving kinetic energy spectra, momentum thickness, and Reynolds stresses in turbulent mixing layer. Moreover, the proposed model can also well capture spatial structures of the Q-criterion iso surfaces. Thus, the D3M holds potential as an effective SFS modeling approach in turbulence simulations.

physics.flu-dyn↗

AI-Generated Content Enhanced Computer-Aided Diagnosis Model for Thyroid Nodules: A ChatGPT-Style Assistant

An artificial intelligence-generated content-enhanced computer-aided diagnosis (AIGC-CAD) model, designated as ThyGPT, has been developed. This model, inspired by the architecture of ChatGPT, could assist radiologists in assessing the risk of thyroid nodules through semantic-level human-machine interaction. A dataset comprising 19,165 thyroid nodule ultrasound cases from Zhejiang Cancer Hospital was assembled to facilitate the training and validation of the model. After training, ThyGPT could automatically evaluate thyroid nodule and engage in effective communication with physicians through human-computer interaction. The performance of ThyGPT was rigorously quantified using established metrics such as the receiver operating characteristic (ROC) curve, area under the curve (AUC), sensitivity, and specificity. The empirical findings revealed that radiologists, when supplemented with ThyGPT, markedly surpassed the diagnostic acumen of their peers utilizing traditional methods as well as the performance of the model in isolation. These findings suggest that AIGC-CAD systems, exemplified by ThyGPT, hold the promise to fundamentally transform the diagnostic workflows of radiologists in forthcoming years.

cs.CV↗

Towards better traffic volume estimation: Jointly addressing the underdetermination and nonequilibrium problems with correlation-adaptive GNNs

Traffic volume is an indispensable ingredient to provide fine-grained information for traffic management and control. However, due to limited deployment of traffic sensors, obtaining full-scale volume information is far from easy. Existing works on this topic primarily focus on improving the overall estimation accuracy of a particular method and ignore the underlying challenges of volume estimation, thereby having inferior performances on some critical tasks. This paper studies two key problems with regard to traffic volume estimation: (1) underdetermined traffic flows caused by undetected movements, and (2) non-equilibrium traffic flows arise from congestion propagation. Here we demonstrate a graph-based deep learning method that can offer a data-driven, model-free and correlation adaptive approach to tackle the above issues and perform accurate network-wide traffic volume estimation. Particularly, in order to quantify the dynamic and nonlinear relationships between traffic speed and volume for the estimation of underdetermined flows, a speed patternadaptive adjacent matrix based on graph attention is developed and integrated into the graph convolution process, to capture non-local correlations between sensors. To measure the impacts of non-equilibrium flows, a temporal masked and clipped attention combined with a gated temporal convolution layer is customized to capture time-asynchronous correlations between upstream and downstream sensors. We then evaluate our model on a real-world highway traffic volume dataset and compare it with several benchmark models. It is demonstrated that the proposed model achieves high estimation accuracy even under 20% sensor coverage rate and outperforms other baselines significantly, especially on underdetermined and non-equilibrium flow locations. Furthermore, comprehensive quantitative model analysis are also carried out to justify the model designs.

stat.ML↗

Ensemble data assimilation-based mixed subgrid-scale model for large-eddy simulations

An ensemble Kalman filter (EnKF)-based mixed model (EnKF-MM) is proposed for the subgrid-scale (SGS) closure in the large-eddy simulation (LES) of turbulence. The model coefficients are determined through the EnKF-based data assimilation technique. The direct numerical simulation (DNS) results are filtered to obtain the benchmark data for LES. Reconstructing the correct kinetic energy spectrum of the filtered DNS (fDNS) data has been adopted as the target for the EnKF to optimize the coefficient of the functional part in the mixed model. The proposed EnKF-MM framework is subsequently tested in the LES of both the incompressible homogeneous isotropic turbulence (HIT) and turbulent mixing layer (TML). The performance of LES is comprehensively examined through the predictions of the flow statistics including the velocity spectrum, the probability density functions (PDFs) of the SGS stress, the PDF of the strain rate and the PDF of the SGS energy flux. The structure functions, the evolution of turbulent kinetic energy, the mean flow and the Reynolds stress profile, and the iso-surface of the Q-criterion are also examined to evaluate the spatial-temporal predictions by different SGS models. The results of the EnKF-MM framework are consistently more satisfying compared to the traditional SGS models, including the dynamic Smagorinsky model (DSM), the dynamic mixed model (DMM) and the velocity gradient model (VGM), demonstrating its great potential in the optimization of SGS models for LES of turbulence.

physics.flu-dyn↗

Adjoint-based variational optimal mixed models for large-eddy simulation of turbulence

An adjoint-based variational optimal mixed model (VOMM) is proposed for subgrid-scale (SGS) closure in large-eddy simulation (LES) of turbulence. The stabilized adjoint LES equations are formulated by introducing a minimal regularization to address the numerical instabilities of the long-term gradient evaluations in chaotic turbulent flows. The VOMM model parameters are optimized by minimizing the discrepancy of energy dissipation spectra between LES calculations and a priori knowledge of direct numerical simulation (DNS) using the gradient-based optimization. The a posteriori performance of the VOMM model is comprehensively examined in LES of three turbulent flows, including the forced homogeneous isotropic turbulence, decaying homogenous isotropic turbulence, and temporally evolving turbulent mixing layer. The VOMM model outperforms the dynamic Smagorinsky model (DSM), dynamic mixed model (DMM) and approximate deconvolution model (ADM) in predictions of various turbulence statistics, including the velocity spectrum, structure functions, statistics of velocity increments and vorticity, temporal evolutions of the turbulent kinetic energy, dissipation rate, momentum thickness and Reynolds stress, as well as the instantaneous vortex structures at different grid resolutions and times. In addition, the VOMM model only takes up 30% time of the DMM model for all flow scenarios. These results demonstrate that the proposed VOMM model improves the numerical stability of LES and has high a posteriori accuracy and computational efficiency by incorporating the a priori information of turbulence statistics, highlighting that the VOMM model has a great potential to develop advanced SGS models in the LES of turbulence.

physics.flu-dyn↗

Correlating sparse sensing for large-scale traffic speed estimation: A Laplacian-enhanced low-rank tensor kriging approach

Traffic speed is central to characterizing the fluidity of the road network. Many transportation applications rely on it, such as real-time navigation, dynamic route planning, and congestion management. Rapid advances in sensing and communication techniques make traffic speed detection easier than ever. However, due to sparse deployment of static sensors or low penetration of mobile sensors, speeds detected are incomplete and far from network-wide use. In addition, sensors are prone to error or missing data due to various kinds of reasons, speeds from these sensors can become highly noisy. These drawbacks call for effective techniques to recover credible estimates from the incomplete data. In this work, we first identify the issue as a spatiotemporal kriging problem and propose a Laplacian enhanced low-rank tensor completion (LETC) framework featuring both lowrankness and multi-dimensional correlations for large-scale traffic speed kriging under limited observations. To be specific, three types of speed correlation including temporal continuity, temporal periodicity, and spatial proximity are carefully chosen and simultaneously modeled by three different forms of graph Laplacian, named temporal graph Fourier transform, generalized temporal consistency regularization, and diffusion graph regularization. We then design an efficient solution algorithm via several effective numeric techniques to scale up the proposed model to network-wide kriging. By performing experiments on two public million-level traffic speed datasets, we finally draw the conclusion and find our proposed LETC achieves the state-of-the-art kriging performance even under low observation rates, while at the same time saving more than half computing time compared with baseline methods. Some insights into spatiotemporal traffic data modeling and kriging at the network level are provided as well.

stat.ML↗

Temporally sparse data assimilation for the small-scale reconstruction of turbulence

Previous works have shown that the small-scale information of incompressible homogeneous isotropic turbulence (HIT) is fully recoverable as long as sufficient large-scale structures are continuously enforced through temporally continuous data assimilation (TCDA). In the current work, we show that the assimilation time step can be relaxed to values about 1 $\sim$ 2 orders larger than that for TCDA, using a temporally sparse data assimilation (TSDA) strategy, while the accuracy is still maintained or even slightly better in the presence of non-negligible large-scale errors. The one-step data assimilation (ODA) is examined to unravel the mechanism of TSDA. It is shown that the relaxation effect for errors above the assimilation wavenumber $k_a$ is responsible for the error decay in ODA. Meanwhile, The errors contained in the large scales can propagate into small scales and make the high-wavenumber ($k>k_a$) error noise decay slower with TCDA than TSDA. This mechanism is further confirmed by incorporating different levels of errors in the large scales of the reference flow field. The advantage of TSDA is found to grow with the magnitude of the incorporated errors. Thus, it is potentially more beneficial to adopt TSDA if the reference data contains non-negligible errors. Finally, an outstanding issue raised in previous works regarding the possibility of recovering the dynamics of sub-Kolmogorov scales using direct numerical simulation (DNS) data at Kolmogorov scale resolution is also discussed.

physics.flu-dyn↗

TrajGen: Generating Realistic and Diverse Trajectories with Reactive and Feasible Agent Behaviors for Autonomous Driving

Realistic and diverse simulation scenarios with reactive and feasible agent behaviors can be used for validation and verification of self-driving system performance without relying on expensive and time-consuming real-world testing. Existing simulators rely on heuristic-based behavior models for background vehicles, which cannot capture the complex interactive behaviors in real-world scenarios. To bridge the gap between simulation and the real world, we propose TrajGen, a two-stage trajectory generation framework, which can capture more realistic behaviors directly from human demonstration. In particular, TrajGen consists of the multi-modal trajectory prediction stage and the reinforcement learning based trajectory modification stage. In the first stage, we propose a novel auxiliary RouteLoss for the trajectory prediction model to generate multi-modal diverse trajectories in the drivable area. In the second stage, reinforcement learning is used to track the predicted trajectories while avoiding collisions, which can improve the feasibility of generated trajectories. In addition, we develop a data-driven simulator I-Sim that can be used to train reinforcement learning models in parallel based on naturalistic driving data. The vehicle model in I-Sim can guarantee that the generated trajectories by TrajGen satisfy vehicle kinematic constraints. Finally, we give comprehensive metrics to evaluate generated trajectories for simulation scenarios, which shows that TrajGen outperforms either trajectory prediction or inverse reinforcement learning in terms of fidelity, reactivity, feasibility, and diversity.

cs.RO↗

Example Perplexity

Some examples are easier for humans to classify than others. The same should be true for deep neural networks (DNNs). We use the term example perplexity to refer to the level of difficulty of classifying an example. In this paper, we propose a method to measure the perplexity of an example and investigate what factors contribute to high example perplexity. The related codes and resources are available at https://github.com/vaynexie/Example-Perplexity.

cs.LG↗

Optical Properties of C$-$rich ($^{12}$C, SiC and FeC) Dust Layered Structure of Massive Stars

The composition and structure of interstellar dust are important and complex for the study of the evolution of stars and the \textbf{interstellar medium} (ISM). However, there is a lack of corresponding experimental data and model theories. By theoretical calculations based on ab-initio method, we have predicted and geometry optimized the structures of Carbon-rich (C-rich) dusts, carbon ($^{12}$C), iron carbide (FeC), silicon carbide (SiC), even silicon ($^{28}$Si), iron ($^{56}$Fe), and investigated the optical absorption coefficients and emission coefficients of these materials in 0D (zero$-$dimensional), 1D, and 2D nanostructures. Comparing the \textbf{nebular spectra} of the supernovae (SN) with the coefficient of dust, we find that the optical absorption coefficient of the 2D $^{12}$C, $^{28}$Si, $^{56}$Fe, SiC and FeC structure corresponds to the absorption peak displayed in the infrared band (5$-$8) $μ$$m$ of the spectrum at 7554 days after the SN1987A explosion. And it also corresponds to the spectrum of 535 days after the explosion of SN2018bsz, when the wavelength in the range of (0.2$-$0.8) and (3$-$10) $μ$$m$. Nevertheless, 2D SiC and FeC corresponds to the spectrum of 844 days after the explosion of SN2010jl, when the wavelength is within (0.08$-$10) $μ$$m$. Therefore, FeC and SiC may be the second type of dust in SN1987A corresponding to infrared band (5$-$8) $μ$$m$ of dust and may be in the ejecta of SN2010jl and SN2018bsz.

astro-ph.GA↗

AbdomenCT-1K: Is Abdominal Organ Segmentation A Solved Problem?

With the unprecedented developments in deep learning, automatic segmentation of main abdominal organs seems to be a solved problem as state-of-the-art (SOTA) methods have achieved comparable results with inter-rater variability on many benchmark datasets. However, most of the existing abdominal datasets only contain single-center, single-phase, single-vendor, or single-disease cases, and it is unclear whether the excellent performance can generalize on diverse datasets. This paper presents a large and diverse abdominal CT organ segmentation dataset, termed AbdomenCT-1K, with more than 1000 (1K) CT scans from 12 medical centers, including multi-phase, multi-vendor, and multi-disease cases. Furthermore, we conduct a large-scale study for liver, kidney, spleen, and pancreas segmentation and reveal the unsolved segmentation problems of the SOTA methods, such as the limited generalization ability on distinct medical centers, phases, and unseen diseases. To advance the unsolved problems, we further build four organ segmentation benchmarks for fully supervised, semi-supervised, weakly supervised, and continual learning, which are currently challenging and active research topics. Accordingly, we develop a simple and effective method for each benchmark, which can be used as out-of-the-box methods and strong baselines. We believe the AbdomenCT-1K dataset will promote future in-depth research towards clinical applicable abdominal organ segmentation methods. The datasets, codes, and trained models are publicly available at https://github.com/JunMa11/AbdomenCT-1K.

cs.CV↗

SFE-GACN: A Novel Unknown Attack Detection Method Using Intra Categories Generation in Embedding Space

In the encrypted network traffic intrusion detection, deep learning based schemes have attracted lots of attention. However, in real-world scenarios, data is often insufficient (few-shot), which leads to various deviations between the models prediction and the ground truth. Consequently, downstream tasks such as unknown attack detection based on few-shot will be limited by insufficient data. In this paper, we propose a novel unknown attack detection method based on Intra Categories Generation in Embedding Space, namely SFE-GACN, which might be the solution of few-shot problem. Concretely, we first proposed Session Feature Embedding (SFE) to summarize the context of sessions (session is the basic granularity of network traffic), bring the insufficient data to the pre-trained embedding space. In this way, we achieve the goal of preliminary information extension in the few-shot case. Second, we further propose the Generative Adversarial Cooperative Network (GACN), which improves the conventional Generative Adversarial Network by supervising the generated sample to avoid falling into similar categories, and thus enables samples to generate intra categories. Our proposed SFE-GACN can accurately generate session samples in the case of few-shot, and ensure the difference between categories during data augmentation. The detection results show that, compared to the state-of-the-art method, the average TPR is 8.38% higher, and the average FPR is 12.77% lower. In addition, we evaluated the graphics generation capabilities of GACN on the graphics dataset, the result shows our proposed GACN can be popularized for generating easy-confused multi-categories graphics.

cs.CR↗

Metastatic Cancer Image Classification Based On Deep Learning Method

Using histopathological images to automatically classify cancer is a difficult task for accurately detecting cancer, especially to identify metastatic cancer in small image patches obtained from larger digital pathology scans. Computer diagnosis technology has attracted wide attention from researchers. In this paper, we propose a noval method which combines the deep learning algorithm in image classification, the DenseNet169 framework and Rectified Adam optimization algorithm. The connectivity pattern of DenseNet is direct connections from any layer to all consecutive layers, which can effectively improve the information flow between different layers. With the fact that RAdam is not easy to fall into a local optimal solution, and it can converge quickly in model training. The experimental results shows that our model achieves superior performance over the other classical convolutional neural networks approaches, such as Vgg19, Resnet34, Resnet50. In particular, the Auc-Roc score of our DenseNet169 model is 1.77% higher than Vgg19 model, and the Accuracy score is 1.50% higher. Moreover, we also study the relationship between loss value and batches processed during the training stage and validation stage, and obtain some important and interesting findings.

eess.IV↗

Microscopic observation of carrier-transport dynamics in quantum-structure solar cells using a time-of-flight technique

In this study, we propose a carrier time-of-flight technique to evaluate the carrier transport time across a quantum structure in an active region of solar cells. By observing the time-resolved photoluminescence signal with a quantum-well probe inserted under the quantum structure at forward bias, the carrier transport time can be efficiently determined at room temperature. The averaged drift velocity shows linear dependence on the internal field, allowing us to estimate the quantum structure as a quasi-bulk material with low effective mobility containing the information of carrier dynamics. We show that this direct and real-time observation is more sensitive to carrier transport than other conventional techniques, providing better insights into microscopic carrier transport dynamics to overcome a device design difficulty.

physics.app-ph↗