{"title":"ICSPCC 2022 Proceedings","authors":"","doi":"10.1109/icspcc55723.2022.9984366","DOIUrl":"https://doi.org/10.1109/icspcc55723.2022.9984366","url":null,"abstract":"","PeriodicalId":346917,"journal":{"name":"2022 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121985799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
W. Su, Rugui Yao, Ye Fan, Yi Xie, Nan Qi, Xiaoya Zuo
{"title":"Joint Power Allocation and Relay Selection Scheme in Multiple Untrusted Relay Networks","authors":"W. Su, Rugui Yao, Ye Fan, Yi Xie, Nan Qi, Xiaoya Zuo","doi":"10.1109/ICSPCC55723.2022.9984259","DOIUrl":"https://doi.org/10.1109/ICSPCC55723.2022.9984259","url":null,"abstract":"Untrusted relays might decode the information while forwarding it and lead to threaten the security of the system in some realistic scenarios. The aim of the paper is to maximize the secrecy performance, and therefore on the ground of the cooperative jamming, we propose a novel power allocation-relay selection program in a multi-untrusted relay network where numerous antennas are equipped in the source and the destination simultaneously. Besides, we allow an optimal application of the power allocation factor and the proper selection of the relays, which makes the Ergodic Secrecy Rate (ESR) increased directly. Moreover, the closed-form expressions of the ESR in different scenarios to measure the secrecy performance are acquired. It can be known that the simulation results of the ESR are compliant with the theoretical, especially when Signal-to-Noise Ratio (SNR) is low. Apart from this, the ESR in theoretical values are tested to be approximately equal to the simulation. Compared to other relay selection strategies like partial selection strategy and the Max-Min (MM) selection strategy, the scheme proposed here can get the secrecy performance strengthen better.","PeriodicalId":346917,"journal":{"name":"2022 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125801240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. Chen, Haozheng Li, Guanwei Yan, Zheng Wang, Haojie Peng
{"title":"Target Intent Recognition Method Based on Evidence Fusion in TimeSeries Networks","authors":"R. Chen, Haozheng Li, Guanwei Yan, Zheng Wang, Haojie Peng","doi":"10.1109/ICSPCC55723.2022.9984289","DOIUrl":"https://doi.org/10.1109/ICSPCC55723.2022.9984289","url":null,"abstract":"Target tactical intent identification in beyond-visual-range air combat is investigated by a novel method of target intent recognition based on information fusion, which combines the advantages of Dempster-Shafer evidence theory and deep temporal networks. The first is by constructing a 1DCNN-BiLSTM deep temporal network to extract the target change features in terms of trajectory and situation; the weighting coefficients of the evidence are proposed to be generated using information entropy of both kinds of evidence as the basis of weighted discounting so that the credibility of the proof is improved, and finally a more reasonable intent fusion result is obtained. The method proposed in this paper is applied to the test of the actual antagonistic data, and the result shows that the method has good dynamic performance and classification accuracy.","PeriodicalId":346917,"journal":{"name":"2022 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128339814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Cunle Zhang, Yi Zhang, Chengkai Tang, Haonan Wang, Jiaming Zhang, Haobo Li
{"title":"Clusters 3D Real-time Cooperative Positioning Algorithm in Underground Mines","authors":"Cunle Zhang, Yi Zhang, Chengkai Tang, Haonan Wang, Jiaming Zhang, Haobo Li","doi":"10.1109/ICSPCC55723.2022.9984540","DOIUrl":"https://doi.org/10.1109/ICSPCC55723.2022.9984540","url":null,"abstract":"Location service is becoming more and more important in modern large-scale mines, and its primary demand is large scale, high precision and fast speed. This paper proposes a real-time cooperative location method of three- dimensional factor graph to deal with large-scale user location to solve the problem of cluster target location, including mine height assistance strategy, information transmission criterion, factor graph confidence model and three-dimensional factor graph cooperative location algorithm. Simulation results show that the proposed algorithm is superior to other algorithms in positioning scale, accuracy and real-time performance.","PeriodicalId":346917,"journal":{"name":"2022 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128466088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yifan Yuan, Xiaohong Shen, Yong Wang, Lin Sun, Shilei Ma
{"title":"A survivability opportunistic routing protocol for Secure Underwater Acoustic Sensor Networks","authors":"Yifan Yuan, Xiaohong Shen, Yong Wang, Lin Sun, Shilei Ma","doi":"10.1109/ICSPCC55723.2022.9984462","DOIUrl":"https://doi.org/10.1109/ICSPCC55723.2022.9984462","url":null,"abstract":"Survivability helps ensure that underwater acoustic sensor networks (UASN) provide essential services under conditions of attacks, failures, and accidents. In this paper, a survivable opportunistic routing protocol is presented to improve the security of UASN. Firstly, whole network node’s importance is continuously counted by sink node in the process of node information exchange. Then, by dynamic adjusting the node’s hold-time (HT) based on node’s importance at the opportunistic routing candidate set selection stage, we can improve the survivability of the UASN. Give the packet delivery rate (PDR) and end-to-end delay two measures to define the survivability of UASN. By simulating attacks, failures and accidents, the PDR and end-to-end delay results show that the proposed secure opportunistic routing protocol can greatly improve the survivability of the network.","PeriodicalId":346917,"journal":{"name":"2022 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127043524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Heng Zhang, Haiyan Wang, Yongsheng Yan, Hongwei Zhang, Chao Wang
{"title":"Non-cooperative underwater acoustic communication signal detection method based on sliding cepstrum","authors":"Heng Zhang, Haiyan Wang, Yongsheng Yan, Hongwei Zhang, Chao Wang","doi":"10.1109/ICSPCC55723.2022.9984310","DOIUrl":"https://doi.org/10.1109/ICSPCC55723.2022.9984310","url":null,"abstract":"An underwater acoustic channel is a complicated and variable channel with noise. It is challenging to detect non-cooperative underwater acoustic communication signal under the condition of unknown signal parameters and low SNR. Now, cepstrum has been widely used in communication signal detection. However, it still cannot meet the requirement of non-cooperative underwater acoustic communication signal detection under the condition of low SNR. We propose a piecewise sliding cepstrum method based on the traditional cepstrum theory to improve detection performance further. We analyze the distribution characteristics of piecewise sliding cepstrum of noise data. Then we present Neyman-Pearson criterion-based piecewise sliding cepstrum detector for non-cooperative underwater acoustic communication signal detection. The value of piecewise sliding cepstrum is demonstrated by simulation and applied to actual recorded data. The results show that the piecewise sliding cepstrum method outperforms cepstrum considerably.","PeriodicalId":346917,"journal":{"name":"2022 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116652815","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A three-level QR code sharing scheme based on SLIC and Hamming code","authors":"Wei-Na Wu, Lina Zhang, Jiehui Zhang, Chen-yu Cui, Xiaoyu Zhang, Miao Liu","doi":"10.1109/ICSPCC55723.2022.9984448","DOIUrl":"https://doi.org/10.1109/ICSPCC55723.2022.9984448","url":null,"abstract":"QR code is a typical two-dimensional code tag consisting of square symbols, which is widely used in social life due to the advantages of high readability and large storage capacity. However, its security performance is low, which has caused widespread concern among scholars in various industries. This paper proposes a three-level QR code scheme based on superpixel segmentation in response. Public information can be scanned directly from shares using any standard QR code scanner. Moreover, secret information can only be obtained by the dissimilarity of shares. The reconstructed secret image in this paper retains the main features of the embedded image, and the scheme is resistant to deformation, high load, and robust because it retains the advantages of visual ciphers and QR codes. Experimental results and analysis show this scheme has many advantages over other schemes.","PeriodicalId":346917,"journal":{"name":"2022 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121575357","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhaozhao Zhang, Zhongqi Liu, Xiao Chen, Kangle Sun
{"title":"Research on underground speech enhancement technology based on generative adversarial network","authors":"Zhaozhao Zhang, Zhongqi Liu, Xiao Chen, Kangle Sun","doi":"10.1109/ICSPCC55723.2022.9984342","DOIUrl":"https://doi.org/10.1109/ICSPCC55723.2022.9984342","url":null,"abstract":"Because of the problems such as speech interaction and speech input difficulty caused by high noise intensity and unclear sources in underground mine, this paper proposes a speech enhancement system based on a Time-domain Generative Adversarial network, which is used in the front end of underground communication or speech recognition to improve the quality of speech information transmission and improve work efficiency. Aiming at the problems of ignoring the feature information between channels and training instability when extracting speech information in a time domain generative adversarial network, this paper introduces channel attention and Relativistic Average Generative Adversarial Network to optimize. The experimental results show that compared with other models, the proposed model can more effectively remove the downhole noise.","PeriodicalId":346917,"journal":{"name":"2022 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134129154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distributed Target Tracking Method Based on Variational Bayesian with Systematic Biases","authors":"Yong Jin, Qiancheng Zhang, L. Zhou, Yue Liu","doi":"10.1109/ICSPCC55723.2022.9984349","DOIUrl":"https://doi.org/10.1109/ICSPCC55723.2022.9984349","url":null,"abstract":"The unknown and time-varying systematic biases and measurement noise and abnormal non-Gaussian process noise will result in low target tracking accuracy. Additionally, traditional Kalman filtering based on Gaussian noise is difficult to meet the requirements of the estimation accuracy. In this paper, a variational Bayesian-based adaptive Kalman filter algorithm under distributed fusion framework (DF-VBAKF) is proposed. It first a priori model of probability density is constructed based on the properties of multiple unknown parameters. And then, through variational Bayesian and adaptive Kalman filter, the posterior distribution probabilities of target state, system biases, and noise covariance are jointly updated by using standard variational method. Finally, collecting local state estimation and its covariance from different platform, the control center fuses them according to the covariance intersection fusion strategy, and feeds results back to platform. The simulation results show that the proposed algorithm has higher estimation accuracy for systematic biases, noise and target state, leading to improvement of target tracking accuracy, too.","PeriodicalId":346917,"journal":{"name":"2022 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134176356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Suppress False Alarms by Exploiting Ambiguity Features of Targets with Machine Learning","authors":"Zhifei Wang, Junpeng Yu, Yuhao Yang, Lin Jin","doi":"10.1109/ICSPCC55723.2022.9984300","DOIUrl":"https://doi.org/10.1109/ICSPCC55723.2022.9984300","url":null,"abstract":"False-alarm suppression and ambiguity resolution are two critical issues for pulse-Doppler (PD) radars. Most previous works attempted solving them independently. Besides, the short-dwell time in the real applications of search radars imposes great challenges for the false-alarm suppression methods based on time-frequency features in the previous works. This work proposes, for the first time, to leverage the ambiguity features of targets that are generated from ambiguity resolution to suppress false alarms. A machine learning model, bagged-trees, is utilized to distinguish true targets from false alarms in the feature spaces in a data-driven way. We also present a new detection paradigm of low-threshold detection followed by the proposed ML-based false-alarm suppression. Extensive filed experiments show that the new paradigm can achieve a significant improvement in the detection performance for PD radars.","PeriodicalId":346917,"journal":{"name":"2022 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132460354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}