Qingyun Zhang
Research Subjects
Qingyun Zhang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Guanghui Cao
School of Electronics and Information Engineering, Liaoning University of Technology, Jinzhou, China
1 shared publication - Hai-Rui Xing
School of Metallurgy Engineering, Xi’an University of Architecture and Technology, Xi’an, China
1 shared publication - Haiyang Geng
State Grid Information Telecommunication Branch,Beijing,China,100761
1 shared publication - Huichao Jiang
Shandong Marine Resources and Environment Research Institute, Yantai, 264006, China; Shandong Engineering Research Center of Marine Ecological Disaster Monitoring, Early Warning and Mitigation, 264006, China; Observation and Research Station of Laizhou Bay Marine Ecosystem, MNR, 264006, China
1 shared publication Mingyue Wang
College of Electronics and Information Engineering Liaoning University of Technology Jinzhou China
1 shared publication- Rui Shi
College of Mechanical Engineering, Yanshan University, Qinhuangdao, China
1 shared publication
Latest Publications
- 21 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 40, 660-664
Improved Image Retrieval Technology Based on Singular Value Decomposition
An image retrieval technology combining singular value decomposition, bicubic interpolation and deep learning is proposed. Since the accuracy of image retrieval is affected by the quality of the input image, images with distinct features can accurately match the target image. For image retrieval and feature training that require input images of different scales, traditional image scaling methods will degrade image features. This paper uses singular value decomposition (SVD) and bicubic interpolation algorithm to improve the quality of the zoomed image, so that the deep neural network (DNN) can extract more accurate features. The experimental results show that the proposed algorithm can improve the accuracy of various image retrieval of power grid companies
- 21 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 40, 660-664
Improved Image Retrieval Technology Based on Singular Value Decomposition
An image retrieval technology combining singular value decomposition, bicubic interpolation and deep learning is proposed. Since the accuracy of image retrieval is affected by the quality of the input image, images with distinct features can accurately match the target image. For image retrieval and feature training that require input images of different scales, traditional image scaling methods will degrade image features. This paper uses singular value decomposition (SVD) and bicubic interpolation algorithm to improve the quality of the zoomed image, so that the deep neural network (DNN) can extract more accurate features. The experimental results show that the proposed algorithm can improve the accuracy of various image retrieval of power grid companies
- Open Access
- 20 August 2021
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 15 (6) , 442-456
DPLQ: Location‐based service privacy protection scheme based on differential privacy
The existing privacy protection schemes for Location‐Based Service (LBS) only protect users' location privacy or query privacy, which can not adopt both of the privacy protections simultaneously in the LBS system. Moreover, these schemes cannot take into account the spatial‐temporal correlation and background knowledge. In response to the above mentioned questions, the LBS Privacy Protection Scheme Based on Differential Privacy (DPLQ) is proposed. The method contains two kinds of privacy protection algorithms: users' location privacy protection algorithm and users' query privacy protection algorithm. The users' location privacy protection algorithm divides the map using the Voronoi diagram, choosing l fake location points based on the improved k ‐means algorithm and l ‐diversity idea, and protects users' location privacy with the Laplace mechanism. Based on the k ‐anonymous algorithm, the users' query privacy protection algorithm builds a query k ‐anonymous set according to the neighbour users' query requests at the same time t in the cluster and the historical query probability of the region’s POI and protects users' query privacy with the exponential mechanism. Through setting the privacy protection intensity of the algorithm by the users, the generated location dataset and query k ‐anonymous set can resist a variety of attacks from malicious attackers. Theoretical analysis and experimental results show that the scheme can effectively protect the location privacy and query privacy of users.
- 20 August 2021
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 15 (6) , 442-456
Open AccessDPLQ: Location‐based service privacy protection scheme based on differential privacy
The existing privacy protection schemes for Location‐Based Service (LBS) only protect users' location privacy or query privacy, which can not adopt both of the privacy protections simultaneously in the LBS system. Moreover, these schemes cannot take into account the spatial‐temporal correlation and background knowledge. In response to the above mentioned questions, the LBS Privacy Protection Scheme Based on Differential Privacy (DPLQ) is proposed. The method contains two kinds of privacy protection algorithms: users' location privacy protection algorithm and users' query privacy protection algorithm. The users' location privacy protection algorithm divides the map using the Voronoi diagram, choosing l fake location points based on the improved k ‐means algorithm and l ‐diversity idea, and protects users' location privacy with the Laplace mechanism. Based on the k ‐anonymous algorithm, the users' query privacy protection algorithm builds a query k ‐anonymous set according to the neighbour users' query requests at the same time t in the cluster and the historical query probability of the region’s POI and protects users' query privacy with the exponential mechanism. Through setting the privacy protection intensity of the algorithm by the users, the generated location dataset and query k ‐anonymous set can resist a variety of attacks from malicious attackers. Theoretical analysis and experimental results show that the scheme can effectively protect the location privacy and query privacy of users.
- Open Access
- 5 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 176429-176437
PPDP-PCAO: An Efficient High-Dimensional Data Releasing Method With Differential Privacy Protection
Privacy protection in data publishing is an extremely important issue that has been the focus of extensive research in recent years. However, the existing methods have a host of limitations, especially for high-dimensional data publishing. Aiming at the problem of poor availability of publishing results caused by “the curse of dimensionality” in high-dimensional data publishing, we present PPDP-PCAO (Privacy Preserving Data Publishing with Principal Component Analysis Optimization) method, which can better address the problem of the lower utility of release results because of the high noise introduced by the curse of dimensionality. PPDP-PCAO improves the Principal Component Analysis (PCA) algorithm by employing the attribute importance, and reduces the dimension of the data with the improved PCA, which reduces the time and space cost. PPDP-PCAO introduces the evaluation mechanism based on mutual-information into data release, which evaluates the data generated by setting the different quantities of principal components to determine the optimal quantities. PPDP-PCAO considers the existence of multi-sensitive attributes in high-dimensional data, while the traditional methods of allocating privacy budgets cannot satisfy the personalized privacy protection. PPDP-PCAO introduces the sensitivity preference, combines the optimal matching theory, and designs the sensitive attribute hierarchical protection strategy. Extensive experimental results on different real datasets demonstrate that PPDP-PCAO not only guarantees the privacy of published dataset, but also significantly improves the accuracy and data utility than other high-dimensional data publishing methods.
- 5 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 176429-176437
Open AccessPPDP-PCAO: An Efficient High-Dimensional Data Releasing Method With Differential Privacy Protection
Privacy protection in data publishing is an extremely important issue that has been the focus of extensive research in recent years. However, the existing methods have a host of limitations, especially for high-dimensional data publishing. Aiming at the problem of poor availability of publishing results caused by “the curse of dimensionality” in high-dimensional data publishing, we present PPDP-PCAO (Privacy Preserving Data Publishing with Principal Component Analysis Optimization) method, which can better address the problem of the lower utility of release results because of the high noise introduced by the curse of dimensionality. PPDP-PCAO improves the Principal Component Analysis (PCA) algorithm by employing the attribute importance, and reduces the dimension of the data with the improved PCA, which reduces the time and space cost. PPDP-PCAO introduces the evaluation mechanism based on mutual-information into data release, which evaluates the data generated by setting the different quantities of principal components to determine the optimal quantities. PPDP-PCAO considers the existence of multi-sensitive attributes in high-dimensional data, while the traditional methods of allocating privacy budgets cannot satisfy the personalized privacy protection. PPDP-PCAO introduces the sensitivity preference, combines the optimal matching theory, and designs the sensitive attribute hierarchical protection strategy. Extensive experimental results on different real datasets demonstrate that PPDP-PCAO not only guarantees the privacy of published dataset, but also significantly improves the accuracy and data utility than other high-dimensional data publishing methods.