VLDB 2026 Research / reviewers in the wild / expert
Linruize Tang
dblp:332/4772
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2025
0009-0007-0253-729XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Applied, interdisciplinary, general and emerging 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 |
Image and video processing · 100% | |
| Artificial intelligence
1 paper |
Generative modeling · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
0.9 | 1 | 2025 | URDM: Hyperspectral Unmixing Regularized by Diffusion Models · IEEE Trans. Image Process. 2025 |
Image and video processing
hyperspectral image analysis |
0.9 | 1 | 2025 | URDM: Hyperspectral Unmixing Regularized by Diffusion Models · IEEE Trans. Image Process. 2025 |
Image and video processing › hyperspectral image analysis
spectral unmixing |
0.9 | 1 | 2025 | URDM: Hyperspectral Unmixing Regularized by Diffusion Models · IEEE Trans. Image Process. 2025 |
Mathematical optimization › continuous optimization
convex optimization |
0.3 | 1 | 2025 | URDM: Hyperspectral Unmixing Regularized by Diffusion Models · IEEE Trans. Image Process. 2025 |
Mathematical optimization › continuous optimization
variational optimization |
0.3 | 1 | 2025 | URDM: Hyperspectral Unmixing Regularized by Diffusion Models · IEEE Trans. Image Process. 2025 |
Methods — techniques the papers use, named apart from their topics
splitting-based optimization · 2.6diffusion model · 2.6denoising diffusion probabilistic model · 2.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Exploring Spectral Signatures of Chinese liquor using Machine Learning and SHapley Additive exPlanationsabstractChinese liquor holds great cultural and economic significance globally. The accurate classification of aroma types and alcohol content is crucial for quality control in Chinese liquor production. To address limitations such as subjectivity and sensor drift in current methods, this study introduces a noninvasive, efficient, and objective approach using Near-Infrared Hyperspectral Imaging (NIR-HSI) to identify alcohol content and aroma types in Chinese liquor. Specifically, we create a comprehensive NIR hyperspectral dataset of Chinese liquor samples and train various machine learning algorithms to classify liquor samples based on their spectral features. Results show that the XGBoost model achieves the optimal performance in most of the experiments. The spectral signatures of various Chinese liquors are explored using SHapley Additive exPlanations (SHAP). We find that spectral bands, such as the band in the range of 1140-1160 nm, make important contributions to the aroma type classification, which are associated with C-H and CO bond stretching vibrations, providing valuable insights into the molecular basis of Chinese liquor analysis. Our dataset is publicly available at https://github.com/wangyunjeff/Chinese-Liquor-NIR-HSI-Dataset. Danlei Chen, Linruize Tang, Zhengqiao Zhao, Jingdong Chen |
ICASSP | 3 |
| 2025 | Unrolling Plug-and-Play Network for Hyperspectral UnmixingabstractDeep learning-based unmixing methods have received great attention in recent years and achieved remarkable performance. These methods employ a data-driven approach to extract structure features from hyperspectral images; however, they tend to be less physically interpretable. Conventional unmixing methods have much more interpretability, whereas they require manually designing regularization and choosing penalty parameters. To overcome these limitations, we propose a novel unmixing method by unrolling the plug-and-play unmixing algorithm to conduct the deep architecture. Our method integrates both inner and outer priors. The carefully designed unfolding deep architecture is used to learn the spectral and spatial information from the hyperspectral image, which we refer to as inner priors. Additionally, our approach incorporates deep denoisers that have been pretrained on a large volume of image data to leverage the outer priors. Second, we design a dynamic convolution to model the multiscale information. Different scales are fused with an attention module. Experimental results of both synthetic and real datasets demonstrate that our method outperforms compared methods. Min Zhao 0014, Linruize Tang, Jie Chen 0022 |
IEEE Trans. Geosci. Remote. Sens. | 2 |
| 2025 | URDM: Hyperspectral Unmixing Regularized by Diffusion ModelsabstractHyperspectral unmixing aims to decompose the mixed pixels into pure spectra and calculate their corresponding fractional abundances. It holds a critical position in hyperspectral image processing. Traditional model-based unmixing methods use convex optimization to iteratively solve the unmixing problem with hand-crafted regularizers. While their performance is limited by these manually designed constraints, which may not fully capture the structural information of the data. Recently, deep learning-based unmixing methods have shown remarkable capability for this task. However, they have limited generalizability and lack interpretability. In this paper, we propose a novel hyperspectral unmixing method regularized by a diffusion model (URDM) to overcome these shortcomings. Our method leverages the advantages of both conventional optimization algorithms and deep generative models. Specifically, we formulate the unmixing objective function from a variational perspective and integrate it into a diffusion sampling process to introduce generative priors from a denoising diffusion probabilistic model (DDPM). Since the original objective function is challenging to optimize, we introduce a splitting-based strategy to decouple it into simpler subproblems. Extensive experiment results conducted on both synthetic and real datasets demonstrate the efficiency and superior performance of our proposed method. Min Zhao 0014, Linruize Tang, Jie Chen 0022, Bo Huang 0001 |
IEEE Trans. Image Process. | 2 |