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

Xingyu Zhu 0016

dblp:352/5408 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2025
0000-0002-0300-4782ORCID · verified

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-author · 4 since 2021Artificial intelligence and machine learning · 3 · 3 first-author · 3 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
4 papers
Digital forensics and information hiding · 86% Security and privacy of machine learning · 14%
Artificial intelligence
1 paper
Generative modeling · 100%
Computer graphics and multimedia
2 papers
Geometric modeling and processing · 100%

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

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding
watermarking
3.342025
Mesh Watermark Removal Attack and Mitigation: A Novel Perspective of Function Space · AAAI 2025
DreaMark: Rooting Watermark in Score Distillation Sampling Generated Neural Radiance Fields · AAAI 2025
Achieving Resolution-Agnostic DNN-based Image Watermarking: A Novel Perspective of Implicit Neural Representation · ACM Multimedia 2024
Digital forensics and information hiding › watermarking
3d mesh watermarking
1.622025
Mesh Watermark Removal Attack and Mitigation: A Novel Perspective of Function Space · AAAI 2025
Rethinking Mesh Watermark: Towards Highly Robust and Adaptable Deep 3D Mesh Watermarking · AAAI 2024
Machine learning › Generative modeling › diffusion model
score distillation sampling
0.912025
DreaMark: Rooting Watermark in Score Distillation Sampling Generated Neural Radiance Fields · AAAI 2025
Machine learning › Generative modeling › diffusion model › 3d shape generation
text-to-3d generation
0.912025
DreaMark: Rooting Watermark in Score Distillation Sampling Generated Neural Radiance Fields · AAAI 2025
Digital forensics and information hiding › watermarking
neural radiance field watermarking
0.912025
DreaMark: Rooting Watermark in Score Distillation Sampling Generated Neural Radiance Fields · AAAI 2025
Security and privacy of machine learning
watermark removal attack
0.912025
Mesh Watermark Removal Attack and Mitigation: A Novel Perspective of Function Space · AAAI 2025
Digital forensics and information hiding › watermarking
image watermarking
0.812024
Achieving Resolution-Agnostic DNN-based Image Watermarking: A Novel Perspective of Implicit Neural Representation · ACM Multimedia 2024
Digital forensics and information hiding › watermarking
robust watermarking
0.812024
Rethinking Mesh Watermark: Towards Highly Robust and Adaptable Deep 3D Mesh Watermarking · AAAI 2024
Geometric modeling and processing › shape representation
mesh representation
0.312025
Mesh Watermark Removal Attack and Mitigation: A Novel Perspective of Function Space · AAAI 2025
Security and privacy of machine learning › model intellectual property protection
model watermarking
0.312025
DreaMark: Rooting Watermark in Score Distillation Sampling Generated Neural Radiance Fields · AAAI 2025
Geometric modeling and processing › mesh processing
mesh simplification
0.212024
Rethinking Mesh Watermark: Towards Highly Robust and Adaptable Deep 3D Mesh Watermarking · AAAI 2024

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

watermark decoder · 2.5signed distance function · 1.7score distillation sampling · 1.7message-guided deformation · 1.7isosurfacing · 1.7backdooring · 1.7offset vector · 1.5neural network · 1.5attention-based convolution · 1.5fine-tuning · 0.8
YearPublicationVenuePosition
2025 DreaMark: Rooting Watermark in Score Distillation Sampling Generated Neural Radiance Fields
abstract
Recent advancements in text-to-3D generation can generate neural radiance fields (NeRFs) with score distillation sampling, enabling 3D asset creation without real-world data capture. With the rapid advancement in NeRF generation quality, protecting the copyright of the generated NeRF has become increasingly important. While prior works can watermark NeRFs in a post-generation way, they suffer from two vulnerabilities. First, a delay lies between NeRF generation and watermarking because the secret message is embedded into the NeRF model post-generation through fine-tuning. Second, generating a non-watermarked NeRF as an intermediate creates a potential vulnerability for theft. To address both issues, we propose Dreamark to embed a secret message by backdooring the NeRF during NeRF generation. In detail, we first pre-train a watermark decoder. Then, Dreamark generates backdoored NeRFs in a way that the target secret message can be verified by the pre-trained watermark decoder on an arbitrary trigger viewport. We evaluate the generation quality and watermark robustness against image- and model-level attacks. Extensive experiments show that the watermarking process will not degrade the generation quality, and the watermark achieves 90+% accuracy among both image-level attacks (e.g., Gaussian noise) and model-level attacks (e.g., pruning attack).
Xingyu Zhu 0016, Xiapu Luo, Xuetao Wei
AAAI1
2025 Mesh Watermark Removal Attack and Mitigation: A Novel Perspective of Function Space
abstract
Mesh watermark embeds secret messages in 3D meshes and decodes the message from watermarked meshes for ownership verification. Current watermarking methods directly hide secret messages in vertex and face sets of meshes. However, mesh is a discrete representation that uses vertex and face sets to describe a continuous signal, which can be discretized in other discrete representations with different vertex and face sets. This raises the question of whether the watermark can still be verified on the different discrete representations of the watermarked mesh. We conduct this research in an attack-then-defense manner by proposing a novel function space mesh watermark removal attack FuncEvade and then mitigating it through function space mesh watermarking FuncMark. In detail, FuncEvade generates a different discrete representation of a watermarked mesh by extracting it from the signed distance function of the watermarked mesh. We observe that the generated mesh can evade ALL previous watermarking methods. FuncMark mitigates FuncEvade by watermarking signed distance function through message-guided deformation. Such deformation can survive isosurfacing and thus be inherited by the extracted meshes for further watermark decoding. Extensive experiments demonstrate that FuncEvade achieves 100% evasion rate among all previous watermarking methods while achieving only 0.3% evasion rate on FuncMark. Besides, our FuncMark performs similarly on other metrics compared to state-of-the-art mesh watermarking methods.
Xingyu Zhu 0016, Guanhui Ye, Chengdong Dong, Xiapu Luo, Shiyao Zhang 0001, Xuetao Wei
AAAI1
2024 Rethinking Mesh Watermark: Towards Highly Robust and Adaptable Deep 3D Mesh Watermarking
abstract
The goal of 3D mesh watermarking is to embed the message in 3D meshes that can withstand various attacks imperceptibly and reconstruct the message accurately from watermarked meshes. The watermarking algorithm is supposed to withstand multiple attacks, and the complexity should not grow significantly with the mesh size. Unfortunately, previous methods are less robust against attacks and lack of adaptability. In this paper, we propose a robust and adaptable deep 3D mesh watermarking Deep3DMark that leverages attention-based convolutions in watermarking tasks to embed binary messages in vertex distributions without texture assistance. Furthermore, our Deep3DMark exploits the property that simplified meshes inherit similar relations from the original ones, where the relation is the offset vector directed from one vertex to its neighbor. By doing so, our method can be trained on simplified meshes but remains effective on large size meshes (size adaptable) and unseen categories of meshes (geometry adaptable). Extensive experiments demonstrate our method remains efficient and effective even if the mesh size is 190× increased. Under mesh attacks, Deep3DMark achieves 10%∼50% higher accuracy than traditional methods, and 2× higher SNR and 8% higher accuracy than previous DNN-based methods.
Xingyu Zhu 0016, Guanhui Ye, Xiapu Luo, Xuetao Wei
AAAI1
2024 Achieving Resolution-Agnostic DNN-based Image Watermarking: A Novel Perspective of Implicit Neural Representation
abstract
DNN-based watermarking methods are rapidly developing and delivering impressive performances. Recent advances achieve resolution-agnostic image watermarking by reducing the variant resolution watermarking problem to a fixed resolution watermarking problem. However, such a reduction process can potentially introduce artifacts and low robustness. To address this issue, we propose the first, to the best of our knowledge, Resolution-Agnostic Image WaterMarking (RAIMark) framework by watermarking the implicit neural representation (INR) of image. Unlike previous methods, our method does not rely on the previous reduction process by directly watermarking the continuous signal instead of image pixels, thus achieving resolution-agnostic watermarking. Precisely, given an arbitrary-resolution image, we fit an INR for the target image. As a continuous signal, such an INR can be sampled to obtain images with variant resolutions. Then, we quickly fine-tune the fitted INR to get a watermarked INR conditioned on a binary secret message. A pre-trained watermark decoder extracts the hidden message from any sampled images with arbitrary resolutions. By directly watermarking INR, we achieve resolution-agnostic watermarking with increased robustness. Extensive experiments show that our method outperforms previous methods with significant improvements: averagely improved bit accuracy by 7%~29%. Notably, we observe that previous methods are vulnerable to at least one watermarking attack (e.g. JPEG, Crop, or Resize), while ours are robust against all watermarking attacks.
Xingyu Zhu 0016, Guanhui Ye, Shiyao Zhang 0001, Xuetao Wei
ACM Multimedia2