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

Yuhao Bian

dblp:272/4222 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2024
0000-0001-9916-7377ORCID · corroborated

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

Security and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.

Network and information security
1 paper
Security and privacy of machine learning · 100%
Artificial intelligence
1 paper
3D vision · 100%

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

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning › adversarial attack › backdoor attack
3d point cloud backdoor attacks
0.812024
iBA: Backdoor Attack on 3D Point Cloud via Reconstructing Itself · IEEE Trans. Inf. Forensics Secur. 2024
Security and privacy of machine learning › adversarial attack
backdoor attack
0.812024
iBA: Backdoor Attack on 3D Point Cloud via Reconstructing Itself · IEEE Trans. Inf. Forensics Secur. 2024
Security and privacy of machine learning › adversarial attack › backdoor attack
trigger design
0.812024
iBA: Backdoor Attack on 3D Point Cloud via Reconstructing Itself · IEEE Trans. Inf. Forensics Secur. 2024
Computer vision › 3D vision › point cloud analysis › point cloud learning
point cloud autoencoder
0.212024
iBA: Backdoor Attack on 3D Point Cloud via Reconstructing Itself · IEEE Trans. Inf. Forensics Secur. 2024
Computer vision › 3D vision
point cloud processing
0.212024
iBA: Backdoor Attack on 3D Point Cloud via Reconstructing Itself · IEEE Trans. Inf. Forensics Secur. 2024

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

trigger smoothing · 1.5spherical harmonic transformation · 1.5folding-based auto-encoder · 1.5
YearPublicationVenuePosition
2024 Accelerate rotation invariant sliced Gromov-Wasserstein distance by an alternative optimization method
Jinming Luo, Yuhao Bian, Xianjie Gao, Xiuping Liu
Inf. Sci.2
2024 iBA: Backdoor Attack on 3D Point Cloud via Reconstructing Itself
abstract
The widespread deployment of deep neural networks (DNNs) for 3D point cloud processing contrasts sharply with their vulnerability to security breaches, particularly backdoor attacks. Studying these attacks is crucial for raising security awareness and mitigating potential risks. However, the irregularity of 3D data and the heterogeneity of 3D DNNs pose unique challenges. Existing methods frequently fail against basic point cloud preprocessing or require intricate manual design. Exploring simple, imperceptible, effective, and difficult-to-defend triggers in 3D point clouds remains challenging. To address this issue, we propose iBA, a novel solution utilizing a folding-based auto-encoder (AE). By leveraging united reconstruction losses, iBA enhances both effectiveness and imperceptibility. Its data-driven nature eliminates the need for complex manual design, while the AE core imparts significant nonlinearity and sample specificity to the trigger, rendering traditional preprocessing techniques ineffective. Additionally, a trigger smoothing module based on spherical harmonic transformation (SHT) allows for controllable intensity. We also discuss potential countermeasures and the possibility of physical deployment for iBA as an extensive reference. Both quantitative and qualitative results demonstrate the effectiveness of our method, achieving state-of-the-art attack success rates (ASR) across a variety of victim models, even with defensive measures in place. iBA’s imperceptibility is validated with multiple metrics as well.
Yuhao Bian, Shengjing Tian, Xiuping Liu
IEEE Trans. Inf. Forensics Secur.1
2022 Incomplete Descriptor Mining With Elastic Loss for Person Re-Identification
abstract
In this paper, we propose a novel person Re-ID model, Consecutive Batch DropBlock Network (CBDB-Net), to capture the attentive and robust person descriptor for the person Re-ID task. The CBDB-Net contains two novel designs: the Consecutive Batch DropBlock Module (CBDBM) and the Elastic Loss (EL). In the Consecutive Batch DropBlock Module (CBDBM), we firstly conduct uniform partition on the feature maps. And then, we independently and continuously drop each patch from top to bottom on the feature maps, which can output multiple incomplete feature maps. In the training stage, these multiple incomplete features can better encourage the Re-ID model to capture the robust person descriptor for the Re-ID task. In the Elastic Loss (EL), we design a novel weight control item to help the Re-ID model adaptively balance hard sample pairs and easy sample pairs in the whole training process. Through an extensive set of ablation studies, we verify that the Consecutive Batch DropBlock Module (CBDBM) and the Elastic Loss (EL) each contribute to the performance boosts of CBDB-Net. We demonstrate that our CBDB-Net can achieve the competitive performance on the three standard person Re-ID datasets (the Market-1501, the DukeMTMC-Re-ID, and the CUHK03 dataset), three occluded Person Re-ID datasets (the Occluded DukeMTMC, the Partial-REID, and the Partial iLIDS dataset), and a general image retrieval dataset (In-Shop Clothes Retrieval dataset).
Hongchen Tan, Xiuping Liu, Yuhao Bian, Huasheng Wang
IEEE Trans. Circuits Syst. Video Technol.3