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

Jiacheng Hao

dblp:347/5743 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
6since 2021 · last 2026
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 4 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 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.

Artificial intelligence
2 papers
Generative modeling · 75% Graph learning · 25%
Computer graphics and multimedia
2 papers
Geometric modeling and processing · 50% Visual content generation and editing · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
1.722025
MamTiff-CAD: Multi-Scale Latent Diffusion with Mamba+ for Complex Parametric Sequence · ICCV 2025
BrepGiff: Lightweight Generation of Complex B-rep with 3D GAT Diffusion · CVPR 2025
Machine learning › Graph learning
graph diffusion
0.912025
BrepGiff: Lightweight Generation of Complex B-rep with 3D GAT Diffusion · CVPR 2025
Machine learning › Generative modeling › diffusion model
latent diffusion model
0.912025
MamTiff-CAD: Multi-Scale Latent Diffusion with Mamba+ for Complex Parametric Sequence · ICCV 2025
Visual content generation and editing
3d shape generation
0.912025
MamTiff-CAD: Multi-Scale Latent Diffusion with Mamba+ for Complex Parametric Sequence · ICCV 2025
Geometric modeling and processing › solid modeling
boundary representation generation
0.912025
BrepGiff: Lightweight Generation of Complex B-rep with 3D GAT Diffusion · CVPR 2025

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

multi-scale latent diffusion · 1.7mamba · 1.7graph attention network · 1.7degree-guided diffusion · 1.7
YearPublicationVenuePosition
2026 Non-contrast CT esophageal varices grading through clinical prior-enhanced multi-organ analysis
Xiaoming Zhang 0008, Chunli Li, Jiacheng Hao, Yuan Gao 0017, Danyang Tu, Jianyi Qiao, Xiaoli Yin, Le Lu 0001, Ling Zhang 0002, Ke Yan 0006
Medical Image Anal.3
2025 BrepGiff: Lightweight Generation of Complex B-rep with 3D GAT Diffusion
abstract
Despite advancements in Computer-Aided-Design (CAD) generation, direct generation of complex Boundary Representation (B-rep) CAD models remains challenging. The difficulty arises from the parametric nature of B-rep data, complicating the encoding and generation of its geometric and topological information. In this paper, we introduce BrepGiff, a lightweight generation approach for high-quality and complex B-rep based on 3D Graph Diffusion. First, we transfer B-rep models into 3D graphs representation. Specifically, BrepGiff extracts and integrates topological and geometric features to construct a 3D graph where nodes correspond to face centroids in 3D space, preserving adjacency and degree information. Geometric features are derived by sampling points in the UV domain and extracting face and edge features. BrepGiff then applies Graph Attention Network (GAT) to enforce topological constraints from local to global during the degree-guided diffusion process. With the 3D graph representation and diffusion process, BrepGiff significantly reduces the computational cost and improves the quality, thus achieving lightweight generation of complex models. Experiments show that BrepGiff can generate complex B-rep models (>100 faces) using only 2 RTX4090 GPUs, achieving state-of-the-art performance in B-rep generation.
Xiaoshui Huang, Jiacheng Hao, Yunpeng Bai, Hongping Gan, Yilei Shi
CVPR3
2025 MamTiff-CAD: Multi-Scale Latent Diffusion with Mamba+ for Complex Parametric Sequence
Liyuan Deng, Yunpeng Bai, Yongkang Dai, Xiaoshui Huang, Hongping Gan, Dongshuo Huang, Jiacheng Hao, Yilei Shi
ICCV7
2025 PLUS: Plug-and-Play Enhanced Liver Lesion Diagnosis Model on Non-contrast CT Scans
Jiacheng Hao, Xiaoming Zhang 0008, Wei Liu 0127, Xiaoli Yin, Yuan Gao 0017, Chunli Li, Ling Zhang 0002, Le Lu 0001, Xu Han 0023, Ke Yan 0006
MICCAI (15)1
2024 SSR-GPCsT: Deep Learning Models Based on Functional Connectivity Maps in Autism Research
abstract
Autism is a neurodevelopmental disorder characterized by difficulties in social interaction, communication, and sensory sensitivity. Functional magnetic resonance imaging (fMRI) is a commonly used brain imaging technique to obtain functional connectivity information in individuals with autism. However, the heterogeneity of functional MRI data from different imaging centers poses a modeling challenge, and the lack of interpretability in the models hinders the identification of biomarkers. To address these issues, this study proposes a deep learning model based on a dynamic functional connectivity matrix that extracts shared features across multiple centers, mitigates the multicentre problem, enhances the representation of the data, and combines features from multiple pathways to capture a comprehensive view of brain connectivity patterns. In addition, two complementary approaches are designed to enhance the interpretability of the model and further explore the presence of biomarkers by analyzing changes in important features of the model. The code will be released soon.
Jiacheng Hao, Junhai Xu, Jianguo Wei
ICASSP1
2023 A Subthreshold-Inverter-Based Strong PUF with High Reliability and Energy Efficiency
abstract
In this paper, we present an energy-efficient strong physical unclonable function (PUF) based on subthreshold inverters (STIs) that are regulated by a native NMOS transistor. Two groups of STIs can be dynamically regrouped to 4 stages according to the provided challenge, with each stage having different number of STIs connected in parallel. By adopting the first two stages as the entropy source and the last two stages for generating the PUF bits, the equivalent 4-stage STI chain can exhibit high reliability under largely varied temperature and supply voltage. Moreover, the proposed strong PUF implementation is validated using a standard 65-nm 1.2 V CMOS process. With the temperature and supply voltage changing from 0°C to 120°C and 0.7 V to 1.5 V, respectively, the worst-case bit error rate (BER) is reported to be 5.025%. Meanwhile, the energy consumption is simulated to be 0.26 pJ/bit at the maximum throughput of 10 Mb/s. Moreover, the proposed strong PUF shows high resilience to various machine learning (ML) attacks, including logistic regression, support vector machine and covariance matrix adaptation evolution strategy.
Qiaozhou Peng, Haibiao Zuo, Jiacheng Hao, Xiaojin Zhao
ISCAS3