Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Meng Duan

dblp:195/6940 · DBLP profile ↗
← Back
10ranked-venue papers
1as first author
9since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Rendering · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering › global illumination
caustics rendering
0.912025
Sample Space Partitioning and Spatiotemporal Resampling for Specular Manifold Sampling · SIGGRAPH Asia 2025
Rendering
monte carlo rendering
0.912025
Sample Space Partitioning and Spatiotemporal Resampling for Specular Manifold Sampling · SIGGRAPH Asia 2025

Methods — techniques the papers use, named apart from their topics

spatiotemporal resampling · 0.9sample space partitioning · 0.9importance sampling · 0.9
YearPublicationVenuePosition
2026 Real-Time Woven Fabric Rendering Using SGGX Fitting
abstract
Realistic woven fabric rendering plays an important role in film production, video games, etc. The microflake model has recently been introduced for lightweight fabric rendering, which serves as the specular part of the woven fabric appearance. However, it cannot be used directly for real-time rendering due to the low sample count requirements for realtime rendering. The main challenge is a multi-scale representation which allows for efficient range query during rendering. To this end, we propose a multiscale representation of the specular lobes of each yarn segment using SGGX fitting. More specifically, we precompute the normal distribution functions (NDFs) of the yarn segments with different query sizes and then use several SGGX functions to represent the NDFs. During rendering, we aggregate the contribution for each pixel by querying the fitted SGGXs of yarn segments covered by the pixel's footprint. We also propose a bounding box representation for the yarn segments, enabling a practical intersection with the pixel's footprint. As a result, our method is able to render several typical types of woven fabrics in only 1–2 ms at 1080p resolution using an RTX 3090 video card. Our method outperforms existing approaches and shows closer rendering results to reference results.
Meng Duan
Comput. Vis. Media2
2025 Sample Space Partitioning and Spatiotemporal Resampling for Specular Manifold Sampling
abstract
Caustics rendering remains a long-standing challenge in Monte Carlo rendering because high-energy specular paths occupy only a small region of path space, making them difficult to sample effectively. Recent work such as Specular Manifold Sampling (SMS) [Zeltner et al. 2020] can stochastically sample these specular paths and estimate their unbiased weights using Bernoulli trials. However, applying SMS in interactive rendering is non-trivial because it is slow and delivers noisy images given a very limited time budget.
Pengpei Hong, Meng Duan, Beibei Wang 0002, Cem Yuksel, Tizian Zeltner, Daqi Lin
SIGGRAPH Asia2
2025 High-order correlation preserved multi-view unsupervised feature selection
Meng Duan, Peng Song 0002, Shixuan Zhou, Yuanbo Cheng, Jinshuai Mu, Wenming Zheng
Eng. Appl. Artif. Intell.1
2025 Low-rank tensor based smooth representation learning for multi-view unsupervised feature selection
Changjia Wang, Peng Song 0002, Meng Duan, Shixuan Zhou, Yuanbo Cheng
Knowl. Based Syst.3
2024 Clean affinity matrix induced hyper-Laplacian regularization for unsupervised multi-view feature selection
Peng Song 0002, Shixuan Zhou, Jinshuai Mu, Meng Duan, Yanwei Yu, Wenming Zheng
Inf. Sci.4
2024 A Batch Postprocessing Method Based on an Adaptive Data Partitioning Strategy for DEM Differencing From Global Data Products
abstract
The DEM differencing method has been widely used for quantifying land surface change, especially in the field of glacier mass change. However, when the global DEM datasets are used to estimate large-scale glacier changes, the superposition effect of multi-source errors makes it difficult to remove the errors in the differencing maps using the existing method based on manually supervised correction. In this letter, to solve this issue, we propose a new stepwise correction method with an adaptive data partitioning strategy. The first step is to perform global spatial detrending, followed by global coarse co-registration. Subsequently, an initial data partitioning scheme based on the quadtree partitioning technique and relying on terrain slope is proposed. Furthermore, a parameter, i.e., the standardized standard deviation based on elevation changes, is used to further update the partitioning scheme. Finally, for each segmented data block, local spatial detrending is performed, followed by precise local co-registration. The proposed method was tested in the Pamir Plateau and the Tianshan River valley, based on the SRTM C-band and X-band DEMs and the Copernicus DEM. The final results show that the various types of error can be automatically and effectively removed, and that the normalized median absolute deviation and long-range correlation variance in ice-free areas shows an improvement of 10% and 24%, and 37% and 60% for the two study regions, respectively, demonstrating the good performance of the proposed method.
Meng Duan
IEEE Geosci. Remote. Sens. Lett.2
2024 Advanced Tropospheric Delay Mitigation Method Using InSAR-Based Iterative Decomposition by Considering the Statistical Characteristics of Atmospheric Turbulence
abstract
An advanced InSAR-based iterative tropospheric decomposition model for more effectively mitigating both vertically stratified and turbulent delays is proposed in this paper. The novelty of the model lies in two aspects: 1) incorporating turbulence variance, which characterizes the statistical properties of atmospheric turbulence, into a stochastic model when iteratively removing stratified delay, and 2) taking the distance and turbulence variance as the weight factors of samples, simultaneously, in spatially interpolating turbulence. In addition, our model is implemented interferogram by interferogram, so we do not need time-series InSAR datasets. The effectiveness of the proposed method is tested and validated using a set of simulated experiments and an in-site experiment over Hawaii Island, and the experimental results show that our method can mitigate tropospheric delays efficiently and robustly.
Zhiwei Li 0001, Minzheng Mu, Meng Duan, Jian-Chao Wei, Yunmeng Cao
IEEE Trans. Geosci. Remote. Sens.4
2024 Refining Stacking-InSAR by Considering the Statistical Characteristics of Atmospheric Turbulence
abstract
We propose an atmospheric turbulence statistical characteristic-enhanced stacking-interferometry synthetic aperture radar (InSAR) method to more accurately derive the average deformation velocity for slow or linear surface displacements. It can be used to estimate the variance and covariance matrix (VCM) for time-series InSAR observations pixel by pixel. Moreover, a minimum variance linear estimator is used to calculate optimal weights for interferogram stacking. Compared with traditional stacking, our method is an improvement, and its advantages include the following: 1) the relevance between time-series atmospheric delays of interferograms is considered; 2) the atmospheric turbulence is better suppressed; and 3) the performance is not limited by the quantity of interferograms. The effectiveness of the new method is verified through a series of simulated experiments and real Sentinel-1 experiments over Southern California. The results demonstrate that our proposed method is more effective and robust in removing turbulent atmospheres.
Zhiwei Li 0001, Minzheng Mu, Meng Duan, Jian-Chao Wei, Yunmeng Cao
IEEE Trans. Geosci. Remote. Sens.4
2023 ODRL: Reinforcement Learning in Priority Scheduling for Running Cost Optimization
abstract
Due to the heterogeneity of workloads and the randomness and complexity of hybrid scheduling environment, How to address the challenge of minimizing data center running cost while ensuring workloads SLA has emerged as a significant research problem. To address this, we propose an Optimal Deep Reinforcement Learning Model for Running Cost Optimization in Hybrid Environments (ODRL). Firstly, we propose Running Cost Model (RCM) that analyzes data center running costs from two perspectives based on different running patterns of the workload and node affinity constraints, minimizing computing node utilization and resource running costs. Subsequently, we propose a Priority-Aware Scheduling Algorithm based on Deep Reinforcement Learning(PASD) that use AHP-TOPSIS to quantify workload characterization, get real-time feedback for environment and update historical experience through prioritized experience replay. Finally, extensive experimental results validate the effectiveness of the proposed model. In comparison to Kube-Scheduler, ODRL achieves a significant 15% improvement in reducing data center running cost. Additionally, there is a 7.8% increase in CPU utilization and a 16.7% increase in memory utilization.
Cheng Kuang, Meng Duan, Yingjun Wu
ICPADS2
2017 Rapid identification of neuronal structures in electronic microscope image using novel combined multi-scale image features
Meng Duan, Shuohong Wang, Yan Qiu Chen
Neurocomputing3