Demo Data from VLDB 2026 / reviewers in the wild / expert
Penghui Sun
dblp:193/0922
· DBLP profile ↗
5ranked-venue papers
3as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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 · 67% Geometric modeling and processing · 33% | |
| Artificial intelligence
1 paper |
Face, body and person analysis · 50% Trustworthy machine learning · 50% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › 3d reconstruction › 3d scene reconstruction
dynamic scene reconstruction |
0.8 | 1 | 2024 | PaReNeRF: Toward Fast Large-Scale Dynamic NeRF with Patch-Based Reference · CVPR 2024 |
Rendering
large-scale scene rendering |
0.8 | 1 | 2024 | PaReNeRF: Toward Fast Large-Scale Dynamic NeRF with Patch-Based Reference · CVPR 2024 |
Rendering
neural radiance fields |
0.8 | 1 | 2024 | PaReNeRF: Toward Fast Large-Scale Dynamic NeRF with Patch-Based Reference · CVPR 2024 |
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training |
0.4 | 1 | 2020 | Similarity-Aware and Variational Deep Adversarial Learning for Robust Facial Age Estimation · IEEE Trans. Multim. 2020 |
Computer vision › Face, body and person analysis
facial age estimation |
0.4 | 1 | 2020 | Similarity-Aware and Variational Deep Adversarial Learning for Robust Facial Age Estimation · IEEE Trans. Multim. 2020 |
Methods — techniques the papers use, named apart from their topics
structural similarity · 0.8patch-based reference · 0.8optical flow · 0.8variational inference · 0.4hard negative sampling · 0.4adversarial learning · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | PaReNeRF: Toward Fast Large-Scale Dynamic NeRF with Patch-Based ReferenceabstractWith photo-realistic image generation, Neural Radiance Field (NeRF) is widely used for large-scale dynamic scene reconstruction as autonomous driving simulator. However, large-scale scene reconstruction still suffers from extremely long training time and rendering time. Low-resolution (L-R) rendering combined with upsampling can alleviate this problem but it degrades image quality. In this paper, we design a lightweight reference decoder which exploits prior information from known views to improve image reconstruction quality of new views. In addition, to speed up prior information search, we propose an optical flow and structural similarity based prior information search method. Results on KITTI and VKITTI2 datasets show that our method significantly outperforms the baseline method in terms of training speed, rendering speed and rendering quality. Penghui Sun, Yuchao Dai, Hojae Lee |
CVPR | 3 |
| 2020 | Similarity-Aware and Variational Deep Adversarial Learning for Robust Facial Age EstimationabstractIn this paper, we propose a similarity-aware deep adversarial learning (SADAL) approach for facial age estimation. Instead of making full access to the limited training samples which likely leads to bias age prediction, our SADAL aims to seek batches of unobserved hard-negative samples based on existing training samples, which typically reinforces the discriminativeness of the learned feature representation for facial ages. Motivated by the fact that age labels are usually correlated in real-world scenarios, we carefully develop a similarity-aware function to well measure the distance of each face pair based on the age value gaps. Consequently, the age-difference information is exploited in the synthetic feature space for robust age estimation. During the learning process, we jointly optimize both procedures of generating hard negatives and learning discriminative age ranker via a sequence of adversarial-game iterations. Another major issue lies on that existing methods only enforce the indiscriminativeness within each class, which is probably trapped into model overfitting and thus the generation capacity is limited particularly on unseen age classes with many individuals. To circumvent this problem, we propose a variational deep adversarial learning (VDAL) paradigm, which learns to encode each face sample in two factorized parts, i.e., the intra-class variance distribution and the intra-class invariant class center. Moreover, our VDAL principally optimizes the variational confidence lower bound on the variational factorized feature representation. To better enhance the discriminativeness of the age representation, our VDAL further learns to encode the ordinal relationship among age labels in the reconstructed subspace. Experimental results on folds of widely-evaluated benchmarking datasets demonstrate that our approach achieves promising performance in contrast to most state-of-the-art age estimation methods. Hao Liu 0019, Penghui Sun, Suping Wu, Zhenhua Yu 0002, Xuehong Sun |
IEEE Trans. Multim. | 2 |
| 2019 | Similarity-Aware Deep Adversarial Learning for Facial Age EstimationabstractIn this paper, we propose a similarity-aware deep adversarial learning (SADAL) approach for facial age estimation. Instead of making access to limited training samples which likely leads to sub-optima, our SADAL seeks sets of unobserved and plausible hard-examples based on existing training samples, which typically reinforces the discriminativeness of the learned feature descriptor for ages. Motivated by the fact that age labels are usually correlated in the real-world applications, we carefully develop a similarity-aware function in our approach, which dynamically measures each face pair with different weights based on different age value gaps. During the learning process, we jointly optimize both procedures of generating hard-examples and learning age estimator via a sequence of adversarial-game iterations. As a result, the smoothing aging pattern is exploited in the reconstructed hard-example space for robust age estimation. Experimental results on two standard benchmarking datasets show that our approach achieves superior performance compared with most state-of-the-art age estimation methods. Penghui Sun, Hao Liu 0019, Zhenhua Yu 0002, Suping Wu |
ICME | 1 |
| 2018 | Understanding Markush Structures in Chemistry Documents With Deep Learning
Penghui Sun, Xiaoqing Lyu, Bei Wang 0004, Xiaohan Yi, Zhi Tang 0001 |
BIBM | 1 |
| 2018 | A Free-Sketch Recognition Method for Chemical Structural FormulaabstractChemical Structural Formula(CSF) recognition plays an important role in the molecular design and component retrieval. However, sketch-based CSF recognition remains an obstacle in current retrieval systems. This paper introduces a system for sketch CSF recognition on smart mobile devices. A dual-mode-based method is proposed to distinguish the gestures for character inputs and non-character inputs instead of the ordinary segmentation approaches. An attribute graph model is established to describe effectively all necessary information of a sketched CSF. Chemical knowledge is adopted to refine the candidates of structure relationship among elements. The experiments results demonstrate that the proposed method outperforms the existing methods for free-sketch CSFs on effectiveness and flexibility. Penghui Sun, Xiaoqing Lyu, Bei Wang 0004, Jingwei Qu, Zhi Tang 0001 |
DAS | 1 |