Guoyin Zhang

Guoyin Zhang


Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
4 August 2020 in IEEE Access
Verified
Journal Article
Open access
LSLei Song
Lei Song
CMChunguang Ma
Chunguang Ma
GZGuoyin Zhang
Guoyin Zhang
YZYun Zhang
Yun Zhang
The training of deep neural networks relies on massive high-quality labeled data which is expensive in practice. To tackle this problem, domain adaptation is proposed to transfer knowledge from label-rich source domain to unlabeled target domain to learn a classifier that can well classify target data. However, people don't consider privacy issues in domain adaptation. In this paper, we introduce a novel method that builds an effective model without sharing sensitive data between source and target domain. Target domain party can benefit from label-rich source domain without revealing its privacy data. We transfer the traditional domain adaptation into a federated setting, where a global server contains a shared global model. Additionally, homomorphic encryption (HE) algorithm is used to guarantee the computing security. Experiments show that our method performs effectively without reducing the accuracy. Our method can achieve secure knowledge transfer and privacy-preserving domain adaptation.

8 September 2023 in Drones
Verified
Journal Article
Open access
PDF file
WWwenshan wang
wenshan wang
GZGuoyin Zhang
Guoyin Zhang
QDQingan Da
Qingan Da
DLDan Lu
Dan Lu
YZYingnan Zhao
Yingnan Zhao
DLdapeng lang
dapeng lang
In emergency rescue missions, rescue teams can use UAVs and efficient path planning strategies to provide flexible rescue services for trapped people, which can improve rescue efficiency and reduce personnel risks. However, since the task environment of UAVs is usually complex, uncertain, and communication-limited, traditional path planning methods may not be able to meet practical needs. In this paper, we introduce a whale optimization algorithm into a deep Q-network and propose a path planning algorithm based on a whale-inspired deep Q-network, which enables UAVs to search for targets faster and safer in uncertain and complex environments. In particular, we first transform the UAV path planning problem into a Markov decision process. Then, we design a comprehensive reward function considering the three factors of path length, obstacle avoidance, and energy consumption. Next, we use the main framework of the deep Q-network to approximate the Q-value function by training a deep neural network. During the training phase, the whale optimization algorithm is introduced for path exploration to generate a richer action decision experience. Finally, experiments show that the proposed algorithm can enable the UAV to autonomously plan a collision-free feasible path in an uncertain environment. And compared with classic reinforcement learning algorithms, the proposed algorithm has a better performance in learning efficiency, path planning success rate, and path length.

30 October 2018 in EURASIP Journal on Wireless Communications and Networking
Verified
Journal Article
Open access
PDF file
JLJingmei Li
Jingmei Li
QTQiao Tian
Qiao Tian
GZGuoyin Zhang
Guoyin Zhang
WWWeifei Wu
Weifei Wu
DXDi Xue
Di Xue
LCLei Chen
Lei Chen
To give full play to the high efficiency and parallelism of multi-processor systems, the fireworks algorithm (FWA) is improved, and a multi-processor task scheduling algorithm based on improved FWA, named IMFWA, is proposed. IMFWA maps continuous space to discrete space by designing the fireworks location coding method, improves the Gaussian mutation process, and sets adaptive dimensions to accelerate the convergence speed of the algorithm. At the same time, in order to reduce the time complexity of the algorithm and shorten the time finding the optimal task scheduling sequence, the fitness-based tournament selection strategy is used instead of the rule based on Euclidean distance. Finally, IMFWA is compared with the basic fireworks algorithm and the genetic algorithms on the Matlab platform for performance analysis. The results show that the IMFWA has advantages in the convergence speed, and the negative impact of the number of tasks is also lower than the fireworks algorithm and genetic algorithm.

8 November 2023 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
JJJingwei Jiang
Jingwei Jiang
DWDing Wang
Ding Wang
GZGuoyin Zhang
Guoyin Zhang
Cloud storage provides an efficient and convenient way to manage data, but it also poses significant challenges to data security. The central issue with cloud storage is to ensure the ability of the data owner to control and manage the outsourced data. The password-protected secret sharing (PPSS) integrates password authentication and secret sharing to offer a fresh approach to secure private data. Users can share the risk of device corruption with a well-designed PPSS scheme and manage outsourced data with only human-memorizable passwords. To the best of our knowledge, none of the existing PPSS schemes can resist security threats in the post-quantum era, and there is an urgent need to design quantum-resistant solutions. However, post-quantum cryptography varies significantly from traditional cryptography, and it is challenging to design a quantum-resistant password-protected secret-sharing scheme for cloud storage. In this work, we take the first substantial step towards this challenge by proposing QPause, a quantum-resistant password-protected data outsourcing scheme for cloud storage. We first design a basic quantum-resistant PPSS scheme based on the lattice secure against semi-honest adversaries with a secure channel. On this foundation, we propose a quantum-resistant round-optimal password-protected data outsourcing scheme against strong adversaries. In addition, we formally prove that our scheme is secure and robust under various attacks against adversaries with quantum computing capabilities. The comparison results show that our new scheme outperforms its foremost counterparts.

1 August 2017 in Computers and Electrical Engineering
Verified
Journal Article
Closed access
JLJingmei Li
Jingmei Li
ZZZhigao Zheng
Zhigao Zheng
QTQiao Tian
Qiao Tian
GZGuoyin Zhang
Guoyin Zhang
FZFangyuan Zheng
Fangyuan Zheng
YPYuanyuan Pan
Yuanyuan Pan

6 November 2024 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
XZXue Zhang
Xue Zhang
YWYanxia Wu
Yanxia Wu
GZGuoyin Zhang
Guoyin Zhang
YYYe Yuan
Ye Yuan
Guangliang ChengGuangliang Cheng
Guangliang Cheng
YWYulei Wu
Yulei Wu
Oriented remote sensing object detection (ORSOD) has gained increasing significance in both military and civilian applications due to the necessity of accurately identifying objects with varying shapes and orientations in remote sensing data. Traditional ORSOD methods often employ fixed label assignment strategies to differentiate between positive and negative samples. However, most of them frequently overlook the impact of object shape on sample quality, leading to an imbalanced distribution of positive samples and exacerbating the inconsistency between classification and regression tasks, thereby limiting detection performance. To address these challenges, we propose a novel shape-dependent assignment (SDA) method that dynamically differentiates positive and negative samples based on object shape. It introduces a new metric for evaluating sample box quality by considering angular differences relative to ground truth (GT) boxes and adjusts the sample scoring threshold according to the aspect ratio of each GT box. In addition, we present a DIoU-adaptive weighting (DAW) module that enhances the interaction between classification and regression tasks by leveraging the distance-IoU metric. This approach not only balances the quantity of samples but also improves their quality, enabling more effective training schemes for samples of varying qualities. We validate our proposed methods through extensive experiments on three challenging ORSOD datasets: DOTA-1.0, HRSC2016, and UCAS-AOD. The results demonstrate that our approach achieves significant improvements, especially for objects with large aspect ratios.