Search

Your search keyword '"Zhu, Jihong"' showing total 110 results
Start Over Author "Zhu, Jihong" Publisher elsevier bv
110 results on '"Zhu, Jihong"'

8. 3D adversarial attacks beyond point cloud

Author

Zhang, Jinlai, Chen, Lyujie, Liu, Binbin, Ouyang, Bo, Xie, Qizhi, Zhu, Jihong, Li, Weiming, and Meng, Yanmei

Subjects
FOS: Computer and information sciences, Information Systems and Management, Artificial Intelligence, Control and Systems Engineering, Computer Vision and Pattern Recognition (cs.CV), Computer Science - Computer Vision and Pattern Recognition, Software, Computer Science Applications, Theoretical Computer Science
Abstract

Recently, 3D deep learning models have been shown to be susceptible to adversarial attacks like their 2D counterparts. Most of the state-of-the-art (SOTA) 3D adversarial attacks perform perturbation to 3D point clouds. To reproduce these attacks in the physical scenario, a generated adversarial 3D point cloud need to be reconstructed to mesh, which leads to a significant drop in its adversarial effect. In this paper, we propose a strong 3D adversarial attack named Mesh Attack to address this problem by directly performing perturbation on mesh of a 3D object. In order to take advantage of the most effective gradient-based attack, a differentiable sample module that back-propagate the gradient of point cloud to mesh is introduced. To further ensure the adversarial mesh examples without outlier and 3D printable, three mesh losses are adopted. Extensive experiments demonstrate that the proposed scheme outperforms SOTA 3D attacks by a significant margin. We also achieved SOTA performance under various defenses. Our code is available at: https://github.com/cuge1995/Mesh-Attack., Comment: 8 pages, 6 figs

Published
2023

18. PointCutMix: Regularization strategy for point cloud classification

Author

Zhang, Jinlai, Chen, Lyujie, Ouyang, Bo, Liu, Binbin, Zhu, Jihong, Chen, Yujing, Meng, Yanmei, and Wu, Danfeng

Subjects
FOS: Computer and information sciences, Artificial Intelligence, Computer Vision and Pattern Recognition (cs.CV), Cognitive Neuroscience, Computer Science - Computer Vision and Pattern Recognition, Computer Science Applications
Abstract

As 3D point cloud analysis has received increasing attention, the insufficient scale of point cloud datasets and the weak generalization ability of networks become prominent. In this paper, we propose a simple and effective augmentation method for the point cloud data, named PointCutMix, to alleviate those problems. It finds the optimal assignment between two point clouds and generates new training data by replacing the points in one sample with their optimal assigned pairs. Two replacement strategies are proposed to adapt to the accuracy or robustness requirement for different tasks, one of which is to randomly select all replacing points while the other one is to select k nearest neighbors of a single random point. Both strategies consistently and significantly improve the performance of various models on point cloud classification problems. By introducing the saliency maps to guide the selection of replacing points, the performance further improves. Moreover, PointCutMix is validated to enhance the model robustness against the point attack. It is worth noting that when using as a defense method, our method outperforms the state-of-the-art defense algorithms. The code is available at:https://github.com/cuge1995/PointCutMix, Comment: 8 pages,5 figures

Published
2022

36. Expected Constant Time Self-Stabilizing Byzantine Pulse Resynchronization

Author

Yu, Shaolin, Zhu, Jihong, Yang, Jiali, and Lu, Wei

Subjects
FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, TheoryofComputation_GENERAL, Distributed, Parallel, and Cluster Computing (cs.DC)
Abstract

In extending fast digital clock synchronization to the bounded-delay model, the expected constant time Byzantine pulse resynchronization problem is investigated. In this problem, the synchronized state of the system should not only be deterministically maintained but be reached from arbitrary states with expected constant time in the presence of Byzantine faults. An intuitive geometric representation of the problem is introduced, with which the classical approximate agreement, randomized Byzantine agreement, and random walk are integrated with some geometric operations. Efficient realizations are also provided for practical uses. Compared with the state-of-the-art solutions, the assumed common pulses need not be regularly generated, the message complexity can be lowered as approximate agreement, and the expected stabilization time is optimal. With this, the provided solution can efficiently convert irregularly generated common pulses to self-stabilizing Byzantine pulse synchronization., 9 pages, 4 figures, submitted to Elsevier

Published
2022

Catalog

Books, media, physical & digital resources
See catalog results