Open cjyryc opened 11 months ago
Thanks for your questions.
1 - You're right that for dodging attacks, the focus is on maximizing the distance between the original and generated identities. Our method, following "Towards Face Encryption by Generating Adversarial Identity Masks (ICCV21)," is flexible for both impersonation and dodging, but you can set the first term to zero if your goal is solely dodging. 2- In our approach, PSR is viewed from the user's perspective, where the aim is to successfully impersonate a different identity, as outlined in "Towards Face Encryption by Generating Adversarial Identity Masks." So, a higher cosine similarity between the generated (protected) portrait and the target identity, surpassing the system threshold τ, is interpreted as high PSR. 3. We have observed that 50 iterations are generally sufficient for this purpose, especially considering that we start from a latent code corresponding to the original image rather than generating from scratch. This method aligns with the one used in the ICCV21 paper, where a similar optimization was effective for a noise-based attack in 20 iterations. Our results show reasonable performance within these constraints.
please let us know, if anything is not clear.
I am very grateful for your quick and detailed response. However, I still have some questions:
"if cosine distance ≤ τ, they are the same identity."
However, the cosine distance and cosine similarity add up to 1, which means that if we want to protect successfully (with high PSR), the cosine similarity should be greater than (1-τ).
If I have understood something wrong, please tell me. Thank you!
Your work is excellent, but I have a few questions: