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

Jiahao Zhu 0005

dblp:256/6598-5 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0003-4228-6900ORCID · conflict

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 · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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.

Network and information security
2 papers
Digital forensics and information hiding · 100%

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

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding › watermarking
robust watermarking
0.912025
GuardSplat: Efficient and Robust Watermarking for 3D Gaussian Splatting · CVPR 2025
Digital forensics and information hiding
watermarking
0.912025
GuardSplat: Efficient and Robust Watermarking for 3D Gaussian Splatting · CVPR 2025
Digital forensics and information hiding › steganography
3d mesh steganography
0.812024
Adaptive 3D Mesh Steganography Based on Feature-Preserving Distortion · IEEE Trans. Vis. Comput. Graph. 2024
Digital forensics and information hiding › steganography
adaptive steganography
0.812024
Adaptive 3D Mesh Steganography Based on Feature-Preserving Distortion · IEEE Trans. Vis. Comput. Graph. 2024
Digital forensics and information hiding
steganography
0.812024
Adaptive 3D Mesh Steganography Based on Feature-Preserving Distortion · IEEE Trans. Vis. Comput. Graph. 2024
Digital forensics and information hiding
steganalysis
0.212024
Adaptive 3D Mesh Steganography Based on Feature-Preserving Distortion · IEEE Trans. Vis. Comput. Graph. 2024

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

spherical harmonics · 0.9CLIP · 0.93d gaussian splatting · 0.9syndrome-trellis code · 0.8feature-preserving distortion · 0.8embedding optimization · 0.8
YearPublicationVenuePosition
2026 Rethinking security of diffusion-based generative steganography
Jiahao Zhu 0005, Lingxiao Yang, Weiqi Luo 0001, Xiaohua Xie
Inf. Sci.1
2025 GuardSplat: Efficient and Robust Watermarking for 3D Gaussian Splatting
abstract
3D Gaussian Splatting (3DGS) has recently created impressive 3D assets for various applications. However, considering security, capacity, invisibility, and training efficiency, the copyright of 3DGS assets is not well protected as existing watermarking methods are unsuited for its rendering pipeline. In this paper, we propose GuardSplat, an innovative and efficient framework for watermarking 3DGS assets. Specifically, 1) We propose a CLIP-guided pipeline for optimizing the message decoder with minimal costs. The key objective is to achieve high-accuracy extraction by leveraging CLIP’s aligning capability and rich representations, demonstrating exceptional capacity and efficiency. 2) We tailor a Spherical-Harmonic-aware (SH-aware) Message Embedding module for 3DGS, seamlessly embedding messages into the SH features of each 3D Gaussian while preserving the original 3D structure. This enables watermarking 3DGS assets with minimal fidelity trade-offs and prevents malicious users from removing the watermarks from the model files, meeting the demands for invisibility and security. 3) We present an Anti-distortion Message Extraction module to improve robustness against various distortions. Experiments demonstrate that GuardSplat outperforms state-of-the-art and achieves fast optimization speed.
Guangcong Wang, Jiahao Zhu 0005, Jian-Huang Lai, Xiaohua Xie
CVPR3
2024 Adaptive 3D Mesh Steganography Based on Feature-Preserving Distortion
abstract
Current 3D mesh steganography algorithms relying on geometric modification are prone to detection by steganalyzers. In traditional steganography, adaptive steganography has proven to be an efficient means of enhancing steganography security. Taking inspiration from this, we propose a highly adaptive embedding algorithm, guided by the principle of minimizing a carefully crafted distortion through efficient steganography codes. Specifically, we tailor a payload-limited embedding optimization problem for 3D settings and devise a feature-preserving distortion (FPD) to measure the impact of message embedding. The distortion takes on an additive form and is defined as a weighted difference of the effective steganalytic subfeatures utilized by the current 3D steganalyzers. With practicality in mind, we refine the distortion to enhance robustness and computational efficiency. By minimizing the FPD, our algorithm can preserve mesh features to a considerable extent, including steganalytic and geometric features, while achieving a high embedding capacity. During the practical embedding phase, we employ the Q-layered syndrome trellis code (STC). However, calculating the bit modification probability (BMP) for each layer of the Q-layered STC, given the variation of Q, can be cumbersome. To address this issue, we design a universal and automatic approach for the BMP calculation. The experimental results demonstrate that our algorithm achieves state-of-the-art performance in countering 3D steganalysis.
Yushu Zhang 0001, Jiahao Zhu 0005, Mingfu Xue, Xinpeng Zhang 0001, Xiaochun Cao
IEEE Trans. Vis. Comput. Graph.2
2021 Gaussian Model for 3D Mesh Steganography
abstract
Currently,mainstream 3D steganographic algorithms embed data through geometric modifications. To enhance the anti-steganalysis ability of such algorithms,we propose an additive Gaussian noise model for 3D mesh steganography. Our work starts with a theoretical analysis for correlations of vertex coordinate components. Based on this analysis,the whole embedding operation is decomposed into three independent tasks that target three vertex coordinate components,respectively. To obtain vertex-changing probabilities,we construct a payload-limited sender (PLS) problem aimed at minimizing the Kullback-Leibler divergence between the cover and stego mesh distributions for a given payload. Next,vertex coordinates are quantified so that the PLS problem can be solved in practice. Finally,a ternary embedding scheme is taken as a typical steganographic case. Although the proposed Gaussian model is simple and idealized,the experimental results demonstrate that our algorithm possesses the adaptivity and can achieve better anti-steganalysis performance at low payloads than most modern high-capacity 3D mesh steganography based on the geometric modification.
Jiahao Zhu 0005, Yushu Zhang 0001, Xinpeng Zhang 0001, Xiaochun Cao
IEEE Signal Process. Lett.1