Qinghua Xing

Qinghua Xing

Auto-generated profile, based on publicly available information

Qinghua Xing

Air and Missile Defense College, Air Force Engineering University, Xi’an 710051, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
6 February 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
HXHuaixi Xing
Huaixi Xing
QXQinghua Xing
Qinghua Xing
KWKun Wang
Kun Wang
This paper studies the resource allocation problem when multiple jammers follow the aircraft formation to support ground penetration. A joint optimization allocation method of multi-jammer beam-power based on the improved artificial bee colony (IABC) algorithm is proposed. The air-to-ground “many-to-many” assault of the multi-jammer cooperative suppression jamming model is given. The constant false alarm probability detection model of the networked radar is used to evaluate the suppression effect, and a coordinated control model of multi-jammer jamming beams and emitting power is established. The optimal allocation scheme under different combat scenarios is solved by using the IABC algorithm. The search efficiency of the ABC algorithm is improved by cross mutation operation and the replacement of the worst nectar source, and the search performance of the algorithm is enhanced by the random key encoding. Due to the infeasible solution generated by the special random key encoding method, the feasible adjustment strategy is adopted. By changing the jamming parameters, the effect on the detection probability of the radar network is analyzed. Compared to the GWO, SCA, BBO and ABC algorithms, the jamming resource allocation scheme obtained by the proposed IABC algorithm makes the radar detection probability lower. The IABC algorithm has better global search capability and robustness.

27 February 2023 in Aerospace
Verified
Journal Article
Open access
PDF file
HXHuaixi Xing
Huaixi Xing
QXQinghua Xing
Qinghua Xing
KWKun Wang
Kun Wang
Current electronic warfare jammers and radar countermeasures are characterized by dynamism and uncertainty. This paper focuses on a decision-making framework of radar anti-jamming countermeasures. The characteristics and implementation process of radar intelligent anti-jamming systems are analyzed, and a scheduling method for radar anti-jamming action based on the Partially Observable Markov Process (POMDP) is proposed. The sample-based belief distribution is used to reflect the radar’s cognition of the environment and describes the uncertainty of the recognition of jamming patterns in the belief state space. The belief state of jamming patterns is updated with Bayesian rules. The reward function is used as the evaluation criterion to select the best anti-jamming strategy, so that the radar is in a low threat state as often as possible. Numerical simulation combines the behavioral prior knowledge base of radars and jammers and obtains the behavioral confrontation benefit matrix from the past experience of experts. The radar controls the output according to the POMDP policy, and dynamically performs the best anti-jamming action according to the change of jamming state. The results show that the POMDP anti-jamming policy is better than the conventional policy. The POMDP approach improves the adaptive anti-jamming capability of the radar and can quickly realize the anti-jamming decision to jammers. This work provides some design ideas for the subsequent development of an intelligent radar.

16 October 2022 in Electronics
Verified
Journal Article
Open access
PDF file
HZHan Zhang
Han Zhang
ZSZhihua Song
Zhihua Song
QXQinghua Xing
Qinghua Xing
BFBoyu Feng
Boyu Feng
XLXiangyang Lin
Xiangyang Lin
In recent years, several steganalysis neural networks have been proposed and achieved satisfactory performances. However, these deep learning methods all encounter the problem of Training-Images-Shortage (TIS). In most cases, it is difficult for steganalyses to obtain enough signals about steganography from a game opponent. In order to solve the problem of TIS for steganalysis, we propose a novel steganalysis method based on generative learning and deep residual convolutional neural networks. Comparative experiments show that the proposed architecture can achieve promising performance in response to spatial domain steganalysis despite a lack of training images.

27 October 2021 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Open access
FCFeng Chen
Feng Chen
QXQinghua Xing
Qinghua Xing
CFChengli Fan
Chengli Fan
Image data play an important role in the network information, however, some images containing sensitive or confidential information are easy to attract the attention of malicious attackers. On the basis of deep learning and data hiding technology, in this article, a novel hiding–revealing network is designed to protect these secret images. The sender uses the hiding network to conceal the secret image into an ordinary cover image and the receiver uses the revealing network to recover the secret image. Symmetrical shortcut connection is designed to improve both the hiding and the revealing performances without adding any parameters. Consider that some secret images may have complex spatial features, a multilevel strong auxiliary module is designed to enhance feature representation and boost the restoration quality of the secret image. Then, a lifeline is proposed to transform the image hiding task into a residual identity mapping, which reduces the difficulty of network learning and obviously improves the hiding performance. In addition, a mixed loss function is designed to further improve the perceptual quality of both the hidden image and the revealed image, which further completely eliminates the secret content in the residual image and ensures the hiding security. Experimental results demonstrate that compared with the state-of-the-art methods, our proposed method achieves the best performance in both hidden image synthesis and secret image restoration.

28 August 2022 in Entropy
Verified
Journal Article
Open access
PDF file
FCFeng Chen
Feng Chen
QXQinghua Xing
Qinghua Xing
BSBing Sun
Bing Sun
XYXuehu Yan
Xuehu Yan
JCJingwen Cheng
Jingwen Cheng
The development of Internet technology has provided great convenience for data transmission and sharing, but it also brings serious security problems that are related to data protection. As is detailed in this paper, an enhanced steganography network was designed to protect secret image data that contains private or confidential information; this network consists of a concealing network and a revealing network in order to achieve image embedding and recovery separately. To reduce the system’s computation complexity, we constructed the network’s framework using a down–up structure in order to compress the intermediate feature maps. In order to mitigate the input’s information loss caused by a sequence of convolution blocks, the long skip concatenation method was designed to pass the raw information to the top layer, thus synthesizing high-quality hidden images with fine texture details. In addition, we propose a novel strategy called non-activated feature fusion (NAFF), which is designed to provide stronger supervision for synthetizing higher-quality hidden images and recovered images. In order to further boost the hidden image’s visual quality and enhance its imperceptibility, an attention mechanism-based enhanced module was designed to reconstruct and enhance the salient target, thus covering up and obscuring the embedded secret content. Furthermore, a hybrid loss function that is composed of pixel domain loss and structure domain loss was designed to boost the hidden image’s structural quality and visual security. Our experimental results demonstrate that, due to the elaborate design of the network structure and loss function, our proposed method achieves high levels of imperceptibility and security.

19 April 2025 in Electronics
Verified
Journal Article
Open access
PDF file
BCBo Cao
Bo Cao
QXQinghua Xing
Qinghua Xing
KYKe Yang
Ke Yang
XWXuan Wu
Xuan Wu
LLLongyue Li
Longyue Li
Aiming at the problems of existing time series data clustering methods, such as the lack of similarity metric universality, the influence of dimensional catastrophe, and the limitation of feature expression ability, a time series data clustering method based on unsupervised contrasting learning (UCL-TSC) is proposed. The method first utilizes Residual, TCN, and CNN-TCN to construct multi-view representations of spatial, temporal, and spatial–temporal features of time series data, and adaptively fuses complementary information to enhance feature extraction capabilities. Subsequently, positive and negative sample pairs are constructed based on nearest neighbor and pseudo-clustering label information. Finally, a contrast loss function consisting of feature loss, clustering loss, and a regularization term is designed to facilitate the model in achieving compact intra-cluster and sparse inter-cluster clustering effects in the clustering process. The experimental results on the UCR dataset show that UCL-TSC performs well with respect to several evaluation indexes, such as clustering accuracy, normalized information degree, and purity, and is more effective in learning time series data features and achieving accurate clustering compared to traditional clustering and deep clustering methods.