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

Longling Zhang

dblp:291/4657 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
0000-0002-4911-4813ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 4 since 2021Artificial intelligence and machine learning · 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.

Artificial intelligence
2 papers
Efficient and distributed learning · 46% Trustworthy machine learning · 46% Image recognition and object detection · 9%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning
poisoning attack defense
0.912025
Detecting and Corrupting Convolution-based Unlearnable Examples · AAAI 2025
Security and privacy of machine learning › poisoning attack
unlearnable examples
0.912025
Detecting and Corrupting Convolution-based Unlearnable Examples · AAAI 2025
Machine learning › Trustworthy machine learning › robustness › byzantine robustness
byzantine attack defense
0.712023
A Four-Pronged Defense Against Byzantine Attacks in Federated Learning · ACM Multimedia 2023
Machine learning › Efficient and distributed learning › federated learning › robust federated learning
byzantine-robust federated learning
0.712023
A Four-Pronged Defense Against Byzantine Attacks in Federated Learning · ACM Multimedia 2023
Machine learning › Efficient and distributed learning
federated learning
0.712023
A Four-Pronged Defense Against Byzantine Attacks in Federated Learning · ACM Multimedia 2023
Machine learning › Trustworthy machine learning
robustness
0.712023
A Four-Pronged Defense Against Byzantine Attacks in Federated Learning · ACM Multimedia 2023
Computer vision › Image recognition and object detection
image classification
0.312025
Detecting and Corrupting Convolution-based Unlearnable Examples · AAAI 2025

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

random matrix multiplication · 1.7edge pixel detection · 1.7bilinear interpolation · 1.7
YearPublicationVenuePosition
2025 Detecting and Corrupting Convolution-based Unlearnable Examples
abstract
Convolution-based unlearnable examples (UEs) employ class-wise multiplicative convolutional noise to training samples, severely compromising model performance. This fire-new type of UEs have successfully countered all defense mechanisms against UEs. The failure of such defenses can be attributed to the absence of norm constraints on convolutional noise, leading to severe blurring of image features. To address this, we first design an Edge Pixel-based Detector (EPD) to identify convolution-based UEs. Upon detection of them, we propose the first defense scheme against convolution-based UEs, COrrupting these samples via random matrix multiplication by employing bilinear INterpolation (COIN) such that disrupting the distribution of class-wise multiplicative noise. To evaluate the generalization of our proposed COIN, we newly design two convolution-based UEs called VUDA and HUDA to expand the scope of convolution-based UEs. Extensive experiments demonstrate the effectiveness of detection scheme EPD and that our defense COIN outperforms 11 state-of-the-art (SOTA) defenses, achieving a significant improvement on the CIFAR and ImageNet datasets.
Xianlong Wang 0001, Zhifei Yu, Shengshan Hu, Ziqi Zhou 0001, Longling Zhang, Leo Yu Zhang
AAAI6
2025 An Efficient Residual-based Low-dose PET Reconstruction with Spatial-Frequency Integration
abstract
Positron emission tomography (PET) is a nuclear medical imaging technique where image quality depends on the dose of radionuclides administered to the patient. While standard-dose PET (SPET) offers high-quality imaging, it also poses radiation risks. If reconstructing low-dose PET (LPET) images can guarantee the same level of imaging quality, LPET could serve as a safer alternative by reducing patient radiation exposure. Recent approaches using convolutional neural networks (CNNs) struggle to capture complex features of LPET images due to the fixed convolutional kernels and local receptive fields. Generative adversarial network (GAN)-based methods may suffer from mode collapse and unstable training. Diffusion model-based works can ensure stability and high-quality sample generation but come with high computational costs. Furthermore, all these methods focus solely on spatial domain information, neglecting crucial frequency domain information.To address these issues, we propose an efficient residual-based LPET reconstruction framework combining CNN and diffusion model. Our framework includes a multi-scale dynamic convolution network with a wavelet reconstruction module (MN-WR) to leverage multi-scale spatial and frequency domain information. We also introduce a residual-based diffusion model (ReD) to enhance local detail reconstruction while reducing computational costs. Finally, we design a wavelet-based frequency domain fusion (WFF) module to combine low-frequency edge information from MN-WR with high-frequency details from ReD. Experimental results on public LPET datasets show that our method outperforms state-of-the-art techniques and significantly reduces computational costs. Code is available at https://github.com/TAI-Medical-Lab/LPET-Reconstruction.
Hewen Pan, Shengqing Hu, Longling Zhang, Shengshan Hu, Peijin Guo
ICASSP5
2024 Stealthy Backdoor Attack Towards Federated Automatic Speaker Verification
abstract
Automatic speech verification (ASV) authenticates individuals based on distinct vocal patterns, playing a pivotal role in many applications such as voice-based unlocking systems for devices. The ASV system comprises three stages: training, registration, and validation. The model refines using voice data in training, extracts vocal features in registration, and contrasts these with speech patterns in validation. Modern ASV models, primarily grounded in DNN architectures, require extensive data for training. Federated learning (FL) fosters model-sharing across multiple clients while ensuring data privacy. Due to its open architecture, FL is vulnerable to backdoor attacks. However, training a stealthy backdoor attack in FL presents challenges, including diminished attack generalization owing to data heterogeneity, and conspicuous triggers that render them easily detectable. In this paper, we propose a Federated Stealthy Backdoor Attack method ($FedSBA$). FedSBA aims to improve the attack model’s generalization, enhance its persistence, and elude anomaly detection under the heterogeneous data distribution. FedSBA constructs an attack model based on a personalized transformer and encompasses a stealthy trigger. Moreover, we also propose a defensive strategy that utilizes an adaptive weight aggregation scheme. The stealthiness and effectiveness of FedSBA are demonstrated by exhibiting superior performance in comparison to previous works.
Longling Zhang, Lyqi Liu, Shengshan Hu
ICASSP1
2023 A Four-Pronged Defense Against Byzantine Attacks in Federated Learning
abstract
Federated learning (FL) is a nascent distributed learning paradigm to train a shared global model without violating users' privacy. FL has been shown to be vulnerable to various Byzantine attacks, where malicious participants could independently or collusively upload well-crafted updates to deteriorate the performance of the global model. However, existing defenses could only mitigate part of Byzantine attacks, without providing an all-sided shield for FL. It is difficult to simply combine them as they rely on totally contradictory assumptions.
Shengshan Hu, Jianrong Lu, Longling Zhang, Leo Yu Zhang, Hai Jin 0001
ACM Multimedia5