Yina Guo

Yina Guo


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 February 2013 in Circuits, Systems, and Signal Processing
Verified
Journal Article
Closed access
PDF file
YGYina Guo
Yina Guo
SHShuhua Huang
Shuhua Huang
YLYongtang Li
Yongtang Li
Ganesh R NaikGanesh R Naik
Ganesh R Naik

1 November 2015 in Applied Soft Computing
Verified
Journal Article
Closed access
YGYina Guo
Yina Guo
Ganesh R NaikGanesh R Naik
Ganesh R Naik
SHShuhua Huang
Shuhua Huang
AAAjith Abraham
Ajith Abraham
HNHung Nguyen
Hung Nguyen

25 July 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
BWBo Wang
Bo Wang
HLHongtao LI
Hongtao LI
Ximeng LiuXimeng Liu
Ximeng Liu
YGYina Guo
Yina Guo
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.


13 October 2020 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
YGYina Guo
Yina Guo
JCJianguo Chen
Jianguo Chen
XRXiaowen Ren
Xiaowen Ren
AWAnhong Wang
Anhong Wang
WWWenwu Wang
Wenwu Wang
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.

31 May 2023 in Sensors
Verified
Journal Article
Open access
PDF file
BWBo Wang
Bo Wang
HLHongtao LI
Hongtao LI
XRXiaoyu Ren
Xiaoyu Ren
YGYina Guo
Yina Guo
Location-based services (LBS) are widely used due to the rapid development of mobile devices and location technology. Users usually provide precise location information to LBS to access the corresponding services. However, this convenience comes with the risk of location privacy disclosure, which can infringe upon personal privacy and security. In this paper, a location privacy protection method based on differential privacy is proposed, which efficiently protects users’ locations, without degrading the performance of LBS. First, a location-clustering (L-clustering) algorithm is proposed to divide the continuous locations into different clusters based on the distance and density relationships among multiple groups. Then, a differential privacy-based location privacy protection algorithm (DPLPA) is proposed to protect users’ location privacy, where Laplace noise is added to the resident points and centroids within the cluster. The experimental results show that the DPLPA achieves a high level of data utility, with minimal time consumption, while effectively protecting the privacy of location information.