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

Yina Guo

dblp:32/10246 · DBLP profile ↗
← Back
15ranked-venue papers
4as first author
11since 2021 · last 2026
0000-0002-0998-2448ORCID · verified

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

Graphics, computer vision, multimedia, augmented reality and games · 7 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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%
Computer graphics and multimedia
1 paper
Image and video processing · 100%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
0.912025
Defense Against Poisoning Attacks on Federated Learning With Neighborhood Coulomb Force · IEEE Trans. Inf. Forensics Secur. 2025
Security and privacy of machine learning › poisoning attack
federated learning poisoning defense
0.912025
Defense Against Poisoning Attacks on Federated Learning With Neighborhood Coulomb Force · IEEE Trans. Inf. Forensics Secur. 2025
Security and privacy of machine learning
poisoning attack
0.912025
Defense Against Poisoning Attacks on Federated Learning With Neighborhood Coulomb Force · IEEE Trans. Inf. Forensics Secur. 2025
Image and video processing › image restoration
image dehazing
0.412020
Joint Raindrop and Haze Removal From a Single Image · IEEE Trans. Image Process. 2020
Image and video processing › image restoration
image deraining
0.412020
Joint Raindrop and Haze Removal From a Single Image · IEEE Trans. Image Process. 2020
Image and video processing
image restoration
0.412020
Joint Raindrop and Haze Removal From a Single Image · IEEE Trans. Image Process. 2020
Data mining
anomaly detection
0.312025
Defense Against Poisoning Attacks on Federated Learning With Neighborhood Coulomb Force · IEEE Trans. Inf. Forensics Secur. 2025
Data mining › anomaly detection
outlier detection
0.312025
Defense Against Poisoning Attacks on Federated Learning With Neighborhood Coulomb Force · IEEE Trans. Inf. Forensics Secur. 2025

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

coulomb force model · 2.6anomaly detection · 2.6k-nearest neighbors · 1.7k-nearest neighbor · 0.9visual attention network · 0.4generative adversarial network · 0.4
YearPublicationVenuePosition
2026 Feature disentanglement in speech separation with channel-temporal fusion attention and dual-domain prototypes
Meng Zhang 0031, Yina Guo, Hong Shangguan
Inf. Sci.2
2026 Towards lightweight single-channel blind image separation: A global-local dual-path parallel graph neural network
Yina Guo
Signal Process.3
2025 AODGCN: Adaptive object detection with attention-guided dynamic graph convolutional network
Meng Zhang 0031, Yina Guo, Hong Shangguan
Comput. Vis. Image Underst.2
2025 Fully end-to-end EEG to speech translation using multi-scale optimized dual generative adversarial network with cycle-consistency loss
Yue Zhang 0105, Yina Guo, Hong Shangguan, Luqing Zhao
Neurocomputing3
2025 Dynamic graph learning with gated convolutions for single-channel speech separation
Meng Zhang 0031, Yina Guo
Speech Commun.3
2025 Defense Against Poisoning Attacks on Federated Learning With Neighborhood Coulomb Force
abstract
Federated Learning (FL) enables collaborative model training across untrusted devices while preserving data privacy. However, malicious participants can still launch attacks, especially poisoning attacks, during model aggregation. To defend against poisoning attacks, we propose a Coulomb Force-based Federated Learning (CFFL), a physics-inspired defense framework that integrates neighborhood Coulomb force into FL security mechanisms. CFFL effectively addresses detection failures in poisoning attacks arising from the “distance concentration” among high-dimensional data. Specifically, firstly, we establishes a local update model for clients, where the similarity between model updates is quantified through local Coulomb resultant force (LCRF), effectively distinguishing malicious and benign updates; Secondly, we develop ak-nearest neighbor (KNN)-based Coulomb resultant force anomaly detection (NCFAD) model that identifies malicious updates by isolating top-koutliers with largest neighborhood factor; Finally, experiment results validate that CFFL outperforms state-of-the-art (SOTA) baselines in defense performance and achieves model accuracy equivalent to the baseline FedAvg on NCI-1, PROTEINS_full, and MNIST datasets (90.82%, 92.23%, and 96.49%, respectively). This indicates that CFFL effectively mitigates the impact of poisoning attacks without compromising the benign performance of the aggregation model.
Bo Wang 0155, Youliang Tian, Yina Guo, Hongtao Li 0002
IEEE Trans. Inf. Forensics Secur.3
2024 FRAD: Free-Rider Attacks Detection Mechanism for Federated Learning in AIoT
abstract
The rapid development of the Artificial Intelligence of Things (AIoT) opens up a new perspective for emerging service-based applications and becomes a major driver of diverse federated learning (FL) applications. However, due to the heterogeneity of nodes and the existence of free-rider attacks, some device nodes may launch free-rider attacks to obtain the global model without any contribution, which not only dampens the enthusiasm of legitimate participants but also undermines the fairness of node contributions. In this article, we propose a free-rider attack detection (FRAD) mechanism for FL with deep autoencoding Gaussian mixture model (DAGMM) based on contribution and reputation. Specifically, we first model the contribution values based on the computing resource, communication cost, and data quality of each device node. Then, based on PageRank algorithms, we design an optimal reputation-based model to fairly and precisely choose benign nodes to participate in federated training under information asymmetry. Furthermore, we develop the FRAD mechanism via DAGMM that combines historical contribution with reputation scores. Simulation results validate that the proposed mechanism in this article outperforms the state-of-the-art baselines$(\sim \!\! 2.14\times $and$\sim \!\! 1.1\times $on MNIST and CIFAR, respectively) in defending against free-rider attacks, and when the main clients are free-riders, i.e., 50% or even up to 80% of the free-riders, FRAD can still maintain a high defense performance against free-rider attacks.
Bo Wang 0155, Hongtao Li 0002, Ximeng Liu, Yina Guo
IEEE Internet Things J.4
2024 YUVDR: A residual network for image deblurring in YUV color space
Meng Zhang 0031, Yina Guo
Multim. Tools Appl.3
2024 Three-Direction Fusion for Accurate Volumetric Liver and Tumor Segmentation
abstract
Biomedical image segmentation of organs, tissues and lesions has gained increasing attention in clinical treatment planning and navigation, which involves the exploration of two-dimensional (2D) and three-dimensional (3D) contexts in the biomedical image. Compared to 2D methods, 3D methods pay more attention to inter-slice correlations, which offer additional spatial information for image segmentation. An organ or tumor has a 3D structure that can be observed from three directions. Previous studies focus only on the vertical axis, limiting the understanding of the relationship between a tumor and its surrounding tissues. Important information can also be obtained from sagittal and coronal axes. Therefore, spatial information of organs and tumors can be obtained from three directions, i.e. the sagittal, coronal and vertical axes, to understand better the invasion depth of tumor and its relationship with the surrounding tissues. Moreover, the edges of organs and tumors in biomedical image may be blurred. To address these problems, we propose a three-direction fusion volumetric segmentation (TFVS) model for segmenting 3D biomedical images from three perspectives in sagittal, coronal and transverse planes, respectively. We use the dataset of the liver task provided by the Medical Segmentation Decathlon challenge to train our model. The TFVS method demonstrates a competitive performance on the 3D-IRCADB dataset. In addition, the t-test and Wilcoxon signed-rank test are also performed to show the statistical significance of the improvement by the proposed method as compared with the baseline methods. The proposed method is expected to be beneficial in guiding and facilitating clinical diagnosis and treatment.
Feng Zhan, Wenwu Wang 0001, Yina Guo, Lidan He
IEEE J. Biomed. Health Informatics4
2023 k-anonymity based location privacy protection method for location-based services in Internet of Thing
abstract
Abstract The wide application of Internet of Things technology has promoted the application of location‐based services (LBS). Users can enjoy various conveniences brought by LBS. However, mobile users should submit their location information to LBS which may lead to privacy disclosure. Therefore, users need to protect their privacy while enjoying the service. If the privacy protection problem cannot be solved, the development of mobile internet business will be greatly affected. The existing location privacy protection methods take little account of real‐time road conditions and are unable to resist link attacks. In this article, a k‐anonymous location privacy protection method based on Voronoi map was proposed. First, the Voronoi diagram was divided according to road network structure and real‐time road network data, and Voronoi unit was established with the intersection as the base point. Then, the base point is sent as an anchor instead of the user's actual location to the third‐party server. The Voronoi diagram generated by the k‐anonymity constituted an anonymous space to resist multi‐query attacks and protected the location. k‐1 user location points that are communicating were selected to form k‐anonymous set with the current user, and send the anonymous set to LBS. Theoretical analysis and experimental results show that the proposed method not only efficiently protected location privacy, but also provided high‐quality service.
Bo Wang 0155, Yina Guo, Hongtao Li 0002
Concurr. Comput. Pract. Exp.2
2023 End-to-end translation of human neural activity to speech with a dual-dual generative adversarial network
Yina Guo, Anhong Wang, Wenwu Wang 0001
Knowl. Based Syst.1
2020 Joint Raindrop and Haze Removal From a Single Image
abstract
In a recent study, it was shown that, with adversarial training of an attentive generative network, it is possible to convert a raindrop degraded image into a relatively clean one. However, in real world, raindrop appearance is not only formed by individual raindrops, but also by the distant raindrops accumulation and the atmospheric veiling, namely haze. Current methods are limited in extracting accurate features from a raindrop degraded image with background scene, the blurred raindrop regions, and the haze. In this paper, we propose a new model for an image corrupted by the raindrops and the haze, and introduce an integrated multi-task algorithm to address the joint raindrop and haze removal (JRHR) problem by combining an improved estimate of the atmospheric light, a modified transmission map, a generative adversarial network (GAN) and an optimized visual attention network. The proposed algorithm can extract more accurate features for both sky and non-sky regions. Experimental evaluation has been conducted to show that the proposed algorithm significantly outperforms state-of-the-art algorithms on both synthetic and real-world images in terms of both qualitative and quantitative measures.
Yina Guo, Xiaowen Ren, Anhong Wang, Wenwu Wang 0001
IEEE Trans. Image Process.1
2018 Multi-source phase retrieval from multi-channel phaseless STFT measurements
Yina Guo, Anhong Wang, Wenwu Wang 0001
Signal Process.1
2017 Optimized phase-space reconstruction for accurate musical-instrument signal classification
Yina Guo, Qijia Liu, Anhong Wang, Chao-Li Sun, Wenyan Tian, Ganesh R. Naik, Ajith Abraham
Multim. Tools Appl.1
2015 Blind separation of convolutive sEMG mixtures based on independent vector analysis
abstract
An independent vector analysis (IVA) method base on variable-step gradient algorithm is proposed in this paper. According to the sEMG physiological properties, the IVA model is applied to the frequency-domain separation of convolutive sEMG mixtures to extract motor unit action potentials information of sEMG signals. The decomposition capability of proposed method is compared to the one of independent component analysis (ICA), and experimental results show the variable-step gradient IVA method outperforms ICA in blind separation of convolutive sEMG mixtures.
Yina Guo, Wenyan Tian
ICMV2