Pub Date : 2024-07-22DOI: 10.23919/cje.2023.00.023
Leifu Gao;Zheng Liu
It is an interesting research direction to develop new multi-objective optimization algorithms based on meta-heuristics. Both the convergence accuracy and population diversity of existing methods are not satisfactory. This paper proposes an integrated external archive local disturbance mechanism for multi-objective snake optimizer (IMOSO) to overcome the above shortcomings. There are two improved strategies. The adaptive mating between subpopulations strategy introduces the special mating behavior of snakes with multiple husbands and wives into the original snake optimizer. Some positions are updated according to the dominated relationships between the newly created individuals and the original individuals. The external archive local disturbance mechanism is used to re-search partial non-inferior solutions with poor diversities. The perturbed solutions are non-dominated sorting with the generated solutions by the next iteration to update the next external archive. The main purpose of this mechanism is to make full use of the non-inferior solution information to better guide the population evolution. The comparison results of the IMOSO and 7 state-of-the-art algorithms on WFG benchmark functions show that IMOSO has better convergence and population diversity.
{"title":"An Integrated External Archive Local Disturbance Mechanism for Multi-Objective Snake Optimizer","authors":"Leifu Gao;Zheng Liu","doi":"10.23919/cje.2023.00.023","DOIUrl":"10.23919/cje.2023.00.023","url":null,"abstract":"It is an interesting research direction to develop new multi-objective optimization algorithms based on meta-heuristics. Both the convergence accuracy and population diversity of existing methods are not satisfactory. This paper proposes an integrated external archive local disturbance mechanism for multi-objective snake optimizer (IMOSO) to overcome the above shortcomings. There are two improved strategies. The adaptive mating between subpopulations strategy introduces the special mating behavior of snakes with multiple husbands and wives into the original snake optimizer. Some positions are updated according to the dominated relationships between the newly created individuals and the original individuals. The external archive local disturbance mechanism is used to re-search partial non-inferior solutions with poor diversities. The perturbed solutions are non-dominated sorting with the generated solutions by the next iteration to update the next external archive. The main purpose of this mechanism is to make full use of the non-inferior solution information to better guide the population evolution. The comparison results of the IMOSO and 7 state-of-the-art algorithms on WFG benchmark functions show that IMOSO has better convergence and population diversity.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606200","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141843844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-22DOI: 10.23919/cje.2023.00.111
Liang Yao;Xiaolong Xu;Wanchun Dou;Muhammad Bilal
As a pivotal enabler of intelligent transportation system (ITS), Internet of vehicles (IoV) has aroused extensive attention from academia and industry. The exponential growth of computation-intensive, latency-sensitive, and privacy-aware vehicular applications in IoV result in the transformation from cloud computing to edge computing, which enables tasks to be offloaded to edge nodes (ENs) closer to vehicles for efficient execution. In ITS environment, however, due to dynamic and stochastic computation offloading requests, it is challenging to efficiently orchestrate offloading decisions for application requirements. How to accomplish complex computation offloading of vehicles while ensuring data privacy remains challenging. In this paper, we propose an intelligent computation offloading with privacy protection scheme, named COPP. In particular, an Advanced Encryption Standard-based encryption method is utilized to implement privacy protection. Furthermore, an online offloading scheme is proposed to find optimal offloading policies. Finally, experimental results demonstrate that COPP significantly outperforms benchmark schemes in the performance of both delay and energy consumption.
{"title":"An Intelligent Privacy Protection Scheme for Efficient Edge Computation Offloading in IoV","authors":"Liang Yao;Xiaolong Xu;Wanchun Dou;Muhammad Bilal","doi":"10.23919/cje.2023.00.111","DOIUrl":"10.23919/cje.2023.00.111","url":null,"abstract":"As a pivotal enabler of intelligent transportation system (ITS), Internet of vehicles (IoV) has aroused extensive attention from academia and industry. The exponential growth of computation-intensive, latency-sensitive, and privacy-aware vehicular applications in IoV result in the transformation from cloud computing to edge computing, which enables tasks to be offloaded to edge nodes (ENs) closer to vehicles for efficient execution. In ITS environment, however, due to dynamic and stochastic computation offloading requests, it is challenging to efficiently orchestrate offloading decisions for application requirements. How to accomplish complex computation offloading of vehicles while ensuring data privacy remains challenging. In this paper, we propose an intelligent computation offloading with privacy protection scheme, named COPP. In particular, an Advanced Encryption Standard-based encryption method is utilized to implement privacy protection. Furthermore, an online offloading scheme is proposed to find optimal offloading policies. Finally, experimental results demonstrate that COPP significantly outperforms benchmark schemes in the performance of both delay and energy consumption.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606211","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141841005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Complex networks are becoming more complex because of the use of many components with diverse technologies. In fact, manual configuration that makes each component interoperable has breed latent danger to system security. There is still no comprehensive review of these studies and prospects for further research. According to the complexity of component configuration and difficulty of security assurance in typical complex networks, this paper systematically reviews the abstract models and formal analysis methods required for intelligent configuration of complex networks, specifically analyzes, and compares the current key technologies such as configuration semantic awareness, automatic generation of security configuration, dynamic deployment, and verification evaluation. These technologies can effectively improve the security of complex networks intelligent configuration and reduce the complexity of operation and maintenance. This paper also summarizes the mainstream construction methods of complex networks configuration and its security test environment and detection index system, which lays a theoretical foundation for the formation of the comprehensive effectiveness verification capability of configuration security. The whole lifecycle management system of configuration security process proposed in this paper provides an important technical reference for reducing the complexity of network operation and maintenance and improving network security.
{"title":"A Review of Intelligent Configuration and Its Security for Complex Networks","authors":"Yue Zhao;Bin Yang;Fei Teng;Xianhua Niu;Ning Hu;Bo Tian","doi":"10.23919/cje.2023.00.001","DOIUrl":"10.23919/cje.2023.00.001","url":null,"abstract":"Complex networks are becoming more complex because of the use of many components with diverse technologies. In fact, manual configuration that makes each component interoperable has breed latent danger to system security. There is still no comprehensive review of these studies and prospects for further research. According to the complexity of component configuration and difficulty of security assurance in typical complex networks, this paper systematically reviews the abstract models and formal analysis methods required for intelligent configuration of complex networks, specifically analyzes, and compares the current key technologies such as configuration semantic awareness, automatic generation of security configuration, dynamic deployment, and verification evaluation. These technologies can effectively improve the security of complex networks intelligent configuration and reduce the complexity of operation and maintenance. This paper also summarizes the mainstream construction methods of complex networks configuration and its security test environment and detection index system, which lays a theoretical foundation for the formation of the comprehensive effectiveness verification capability of configuration security. The whole lifecycle management system of configuration security process proposed in this paper provides an important technical reference for reducing the complexity of network operation and maintenance and improving network security.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606212","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141842655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-22DOI: 10.23919/cje.2023.00.382
Yuanlong Cao;Junjie Li;Kailin Chao;Jianmao Xiao;Gang Lei
The rapid development of Internet of things (IoT) and edge computing technologies has brought forth numerous possibilities for the intelligent and digital future. The frequent communication and interaction between devices inevitably generate a large amount of sensitive information. Deploying a blockchain network to store sensitive data is crucial for ensuring privacy and security. The openness and synchronicity of blockchain networks give rise to challenges such as transaction privacy and storage capacity issues, significantly impeding their development in the context of edge computing and IoT. This paper proposes a reliable fog computing service solution based on a blockchain fog architecture. This paper stores data files in the inter planetary file system (IPFS) and encrypts the file hash values used for retrieving data files with stream cipher encryption. It employs a steganographic transmission technique leveraging AlphaZero's Gomoku algorithm to discretely transmit the stream cipher key across the blockchain network without a carrier, thus achieving dual encryption. This approach aims to mitigate the storage burden on the blockchain network while ensuring the security of transaction data. Experimental results demonstrate that the model enhances the transmission capacity of confidential information from kilobytes (KB) to megabytes (MB) and exhibits high levels of covert and security features.
{"title":"Blockchain Meets Generative Behavior Steganography: A Novel Covert Communication Framework for Secure IoT Edge Computing","authors":"Yuanlong Cao;Junjie Li;Kailin Chao;Jianmao Xiao;Gang Lei","doi":"10.23919/cje.2023.00.382","DOIUrl":"10.23919/cje.2023.00.382","url":null,"abstract":"The rapid development of Internet of things (IoT) and edge computing technologies has brought forth numerous possibilities for the intelligent and digital future. The frequent communication and interaction between devices inevitably generate a large amount of sensitive information. Deploying a blockchain network to store sensitive data is crucial for ensuring privacy and security. The openness and synchronicity of blockchain networks give rise to challenges such as transaction privacy and storage capacity issues, significantly impeding their development in the context of edge computing and IoT. This paper proposes a reliable fog computing service solution based on a blockchain fog architecture. This paper stores data files in the inter planetary file system (IPFS) and encrypts the file hash values used for retrieving data files with stream cipher encryption. It employs a steganographic transmission technique leveraging AlphaZero's Gomoku algorithm to discretely transmit the stream cipher key across the blockchain network without a carrier, thus achieving dual encryption. This approach aims to mitigate the storage burden on the blockchain network while ensuring the security of transaction data. Experimental results demonstrate that the model enhances the transmission capacity of confidential information from kilobytes (KB) to megabytes (MB) and exhibits high levels of covert and security features.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606209","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141841731","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In modern industrial control systems (ICSs), when user retrieving the data stored in field device like smart sensor, there exists two main problems: one is lack of the verification for identification of user and field device; the other is that user and field device need exchange a key to encrypt sensitive data transmitted over the network. We propose a comprehensive authentication and key agreement framework that enables all connected devices in an ICS to mutually authenticate each other and establish a peer-to-peer session key. The framework combines two types of protocols for authentication and session key agreement: The first one is an asymmetric cryptographic key agreement protocol based on transport layer security handshake protocol used for Internet access, while the second one is a newly designed lightweight symmetric cryptographic key agreement protocol specifically for field devices. This proposed lightweight protocol imposes very light computational load and merely employs simple operations like one-way hash function and exclusive-or (XOR) operation. In comparison to other lightweight protocols, our protocol requires the field device to perform fewer computational operations during the authentication phase. The simulation results obtained using OpenSSL demonstrates that each authentication and key agreement process in the lightweight protocol requires only 0.005 ms. Our lightweight key agreement protocol satisfies several essential security features, including session key secrecy, identity anonymity, untraceability, integrity, forward secrecy, and mutual authentication. It is capable of resisting impersonation, man-in-the-middle, and replay attacks. We have employed the Gong-Needham-Yahalom (GNY) logic and automated validation of Internet security protocols and application tool to verify the security of our symmetric cryptographic key agreement protocol.
{"title":"A General Authentication and Key Agreement Framework for Industrial Control System","authors":"Shan Gao;Junjie Chen;Bingsheng Zhang;Kui Ren;Xiaohua Ye;Yongsheng Shen","doi":"10.23919/cje.2023.00.192","DOIUrl":"10.23919/cje.2023.00.192","url":null,"abstract":"In modern industrial control systems (ICSs), when user retrieving the data stored in field device like smart sensor, there exists two main problems: one is lack of the verification for identification of user and field device; the other is that user and field device need exchange a key to encrypt sensitive data transmitted over the network. We propose a comprehensive authentication and key agreement framework that enables all connected devices in an ICS to mutually authenticate each other and establish a peer-to-peer session key. The framework combines two types of protocols for authentication and session key agreement: The first one is an asymmetric cryptographic key agreement protocol based on transport layer security handshake protocol used for Internet access, while the second one is a newly designed lightweight symmetric cryptographic key agreement protocol specifically for field devices. This proposed lightweight protocol imposes very light computational load and merely employs simple operations like one-way hash function and exclusive-or (XOR) operation. In comparison to other lightweight protocols, our protocol requires the field device to perform fewer computational operations during the authentication phase. The simulation results obtained using OpenSSL demonstrates that each authentication and key agreement process in the lightweight protocol requires only 0.005 ms. Our lightweight key agreement protocol satisfies several essential security features, including session key secrecy, identity anonymity, untraceability, integrity, forward secrecy, and mutual authentication. It is capable of resisting impersonation, man-in-the-middle, and replay attacks. We have employed the Gong-Needham-Yahalom (GNY) logic and automated validation of Internet security protocols and application tool to verify the security of our symmetric cryptographic key agreement protocol.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606205","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141845045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-22DOI: 10.23919/cje.2023.00.081
Ruru Zhang;Haihong E;Lifei Yuan;Yanhui Wang;Lifei Wang;Meina Song
The current intelligent auxiliary diagnosis models all follow the closed-set recognition setting. After the model is deployed online, the input data is often not completely controlled. Diagnosing an untrained disease as a known category would lead to serious medical malpractice. Therefore, realizing the open-set recognition is significant to the safe operation of the intelligent auxiliary diagnosis model. Currently, most open-set recognition models are studied for natural images, and it is very challenging to obtain clear and concise decision boundaries between known and unknown classes when applied to fine-grained medical images. We propose an open-set recognition network for medical images based on fine-grained data mixture and spatial position constraint loss (FGM-SPCL) in this work. Considering the fine graininess of medical images and the diversity of unknown samples, we propose a fine-grained data mixture (FGM) method to simulate unknown data by performing a mixing operation on known data to expand the coverage of unknown data difficulty levels. In order to obtain a concise and clear decision boundary, we propose a spatial position constraint loss (SPCL) to control the position distribution of prototypes and samples in the feature space and maximize the distance between known classes and unknown classes. We validate on a private ophthalmic OCT dataset, and extensive experiments and analyses demonstrate that FGM-SPCL outperforms state-of-the-art models.
目前的智能辅助诊断模型都遵循封闭集识别设置。模型在线部署后，输入数据往往不完全可控。将未经训练的疾病诊断为已知类别会导致严重的医疗事故。因此，实现开放集识别对智能辅助诊断模型的安全运行意义重大。目前，大多数开放集识别模型都是针对自然图像进行研究的，而当应用于细粒度医学图像时，要在已知类别和未知类别之间获得清晰简明的决策边界是非常具有挑战性的。在这项工作中，我们提出了一种基于细粒度数据混合和空间位置约束损失（FGM-SPCL）的医学图像开集识别网络。考虑到医学图像的细粒度和未知样本的多样性，我们提出了一种细粒度数据混合（FGM）方法，通过对已知数据进行混合运算来模拟未知数据，从而扩大未知数据难度等级的覆盖范围。为了获得简洁明了的决策边界，我们提出了空间位置约束损失（SPCL）来控制原型和样本在特征空间中的位置分布，并最大化已知类别和未知类别之间的距离。我们在一个私人眼科 OCT 数据集上进行了验证，大量的实验和分析表明 FGM-SPCL 优于最先进的模型。
{"title":"FGM-SPCL: Open-Set Recognition Network for Medical Images Based on Fine-Grained Data Mixture and Spatial Position Constraint Loss","authors":"Ruru Zhang;Haihong E;Lifei Yuan;Yanhui Wang;Lifei Wang;Meina Song","doi":"10.23919/cje.2023.00.081","DOIUrl":"10.23919/cje.2023.00.081","url":null,"abstract":"The current intelligent auxiliary diagnosis models all follow the closed-set recognition setting. After the model is deployed online, the input data is often not completely controlled. Diagnosing an untrained disease as a known category would lead to serious medical malpractice. Therefore, realizing the open-set recognition is significant to the safe operation of the intelligent auxiliary diagnosis model. Currently, most open-set recognition models are studied for natural images, and it is very challenging to obtain clear and concise decision boundaries between known and unknown classes when applied to fine-grained medical images. We propose an open-set recognition network for medical images based on fine-grained data mixture and spatial position constraint loss (FGM-SPCL) in this work. Considering the fine graininess of medical images and the diversity of unknown samples, we propose a fine-grained data mixture (FGM) method to simulate unknown data by performing a mixing operation on known data to expand the coverage of unknown data difficulty levels. In order to obtain a concise and clear decision boundary, we propose a spatial position constraint loss (SPCL) to control the position distribution of prototypes and samples in the feature space and maximize the distance between known classes and unknown classes. We validate on a private ophthalmic OCT dataset, and extensive experiments and analyses demonstrate that FGM-SPCL outperforms state-of-the-art models.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606206","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141840577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-22DOI: 10.23919/cje.2023.00.233
Jingyu Yao;Bo Yang;Tao Wang;Wenzheng Zhang
For electronic voting (e-voting) with a trusted authority, the ballots may be discarded or tampered, so it is attractive to eliminate the dependence on the trusted party. An e-voting protocol, where the final voting result can be calculated by any entity, is known as self-tallying e-voting protocol. To the best of our knowledge, addressing both abortive issue and adaptive issue simultaneously is still an open problem in self-tallying e-voting protocols. Combining Ethereum blockchain with cryptographic technologies, we present a decentralized self-tallying e-voting protocol. We solve the above problem efficiently by utilizing optimized Group Encryption Scheme and standard Exponential ElGamal Cryptosystem. We use zero-knowledge proof and homomorphic encryption to protect votes' secrecy and achieve self-tallying. All ballots can be verified by anyone and the final voting result can be calculated by any entity. In addition, using the paradigm of score voting and “1-out-of- $k$ ” proof, our e-voting system is suitable for a wide range of application scenarios. Experiments show that our protocol is more competitive and more suitable for large-scale voting.
{"title":"A Distributed Self-Tallying Electronic Voting System Using the Smart Contract","authors":"Jingyu Yao;Bo Yang;Tao Wang;Wenzheng Zhang","doi":"10.23919/cje.2023.00.233","DOIUrl":"10.23919/cje.2023.00.233","url":null,"abstract":"For electronic voting (e-voting) with a trusted authority, the ballots may be discarded or tampered, so it is attractive to eliminate the dependence on the trusted party. An e-voting protocol, where the final voting result can be calculated by any entity, is known as self-tallying e-voting protocol. To the best of our knowledge, addressing both abortive issue and adaptive issue simultaneously is still an open problem in self-tallying e-voting protocols. Combining Ethereum blockchain with cryptographic technologies, we present a decentralized self-tallying e-voting protocol. We solve the above problem efficiently by utilizing optimized Group Encryption Scheme and standard Exponential ElGamal Cryptosystem. We use zero-knowledge proof and homomorphic encryption to protect votes' secrecy and achieve self-tallying. All ballots can be verified by anyone and the final voting result can be calculated by any entity. In addition, using the paradigm of score voting and “1-out-of-\u0000<tex>$k$</tex>\u0000” proof, our e-voting system is suitable for a wide range of application scenarios. Experiments show that our protocol is more competitive and more suitable for large-scale voting.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606192","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141849463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-22DOI: 10.23919/cje.2022.00.338
Jin Zheng;Botao Jiang;Wei Peng;Qiaohui Zhang
Aiming at the low accuracy of existing binocular stereo matching and depth estimation methods, this paper proposes a multi-scale binocular stereo matching network based on semantic association. A semantic association module is designed to construct the contextual semantic association relationship among the pixels through semantic category and attention mechanism. The disparity of those regions where the disparity is easily estimated can be used to assist the disparity estimation of relatively difficult regions, so as to improve the accuracy of disparity estimation of the whole image. Simultaneously, a multi-scale cost volume computation module is proposed. Unlike the existing methods, which use a single cost volume, the proposed multi-scale cost volume computation module designs multiple cost volumes for features of different scales. The semantic association feature and multi-scale cost volume are aggregated, which fuses the high-level semantic information and the low-level local detailed information to enhance the feature representation for accurate stereo matching. We demonstrate the effectiveness of the proposed solutions on the KITTI2015 binocular stereo matching dataset, and our model achieves comparable or higher matching performance, compared to other seven classic binocular stereo matching algorithms.
{"title":"Multi-Scale Binocular Stereo Matching Based on Semantic Association","authors":"Jin Zheng;Botao Jiang;Wei Peng;Qiaohui Zhang","doi":"10.23919/cje.2022.00.338","DOIUrl":"10.23919/cje.2022.00.338","url":null,"abstract":"Aiming at the low accuracy of existing binocular stereo matching and depth estimation methods, this paper proposes a multi-scale binocular stereo matching network based on semantic association. A semantic association module is designed to construct the contextual semantic association relationship among the pixels through semantic category and attention mechanism. The disparity of those regions where the disparity is easily estimated can be used to assist the disparity estimation of relatively difficult regions, so as to improve the accuracy of disparity estimation of the whole image. Simultaneously, a multi-scale cost volume computation module is proposed. Unlike the existing methods, which use a single cost volume, the proposed multi-scale cost volume computation module designs multiple cost volumes for features of different scales. The semantic association feature and multi-scale cost volume are aggregated, which fuses the high-level semantic information and the low-level local detailed information to enhance the feature representation for accurate stereo matching. We demonstrate the effectiveness of the proposed solutions on the KITTI2015 binocular stereo matching dataset, and our model achieves comparable or higher matching performance, compared to other seven classic binocular stereo matching algorithms.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606203","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141840234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Adversarial examples (AEs) are an additive amalgamation of clean examples and artificially malicious perturbations. Attackers often leverage random noise and multiple random restarts to initialize perturbation starting points, thereby increasing the diversity of AEs. Given the non-convex nature of the loss function, employing randomness to augment the attack's success rate may lead to considerable computational overhead. To overcome this challenge, we introduce the one-hot mean square error loss to guide the initialization. This loss is combined with the strongest first-order attack, the projected gradient descent, alongside a dynamic attack step size adjustment strategy to form a comprehensive attack process. Through experimental validation, we demonstrate that our method outperforms baseline attacks in constrained attack budget scenarios and regular experimental settings. This establishes it as a reliable measure for assessing the robustness of deep learning models. We explore the broader application of this initialization strategy in enhancing the defense impact of few-shot classification models. We aspire to provide valuable insights for the community in designing attack and defense mechanisms.
{"title":"Efficient Untargeted White-Box Adversarial Attacks Based on Simple Initialization","authors":"Yunyi Zhou;Haichang Gao;Jianping He;Shudong Zhang;Zihui Wu","doi":"10.23919/cje.2022.00.449","DOIUrl":"10.23919/cje.2022.00.449","url":null,"abstract":"Adversarial examples (AEs) are an additive amalgamation of clean examples and artificially malicious perturbations. Attackers often leverage random noise and multiple random restarts to initialize perturbation starting points, thereby increasing the diversity of AEs. Given the non-convex nature of the loss function, employing randomness to augment the attack's success rate may lead to considerable computational overhead. To overcome this challenge, we introduce the one-hot mean square error loss to guide the initialization. This loss is combined with the strongest first-order attack, the projected gradient descent, alongside a dynamic attack step size adjustment strategy to form a comprehensive attack process. Through experimental validation, we demonstrate that our method outperforms baseline attacks in constrained attack budget scenarios and regular experimental settings. This establishes it as a reliable measure for assessing the robustness of deep learning models. We explore the broader application of this initialization strategy in enhancing the defense impact of few-shot classification models. We aspire to provide valuable insights for the community in designing attack and defense mechanisms.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606202","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141839697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-22DOI: 10.23919/cje.2023.00.089
Yangzhe Liao;Lin Liu;Yuanyan Song;Ning Xu
Joint communication-caching-computing resource allocation in wireless inland waterway communications enables resource-constrained unmanned surface vehicles (USVs) to provision computation-intensive and latencysensitive tasks forward beyond fifth-generation (B5G) and sixth-generation (6G) era. The power of such resource allocation cannot be fully studied unless bidirectional data computation is properly managed. A novel intelligent reflecting surface (IRS)-assisted hybrid UAV-terrestrial network architecture is proposed with bidirectional tasks. The sum of uplink and downlink bandwidth minimization problem is formulated by jointly considering link quality, task execution mode selection, UAVs trajectory, and task execution latency constraints. A heuristic algorithm is proposed to solve the formulated challenging problem. We divide the original challenging problem into two subproblems, i.e., the joint optimization problem of USVs offloading decision, caching decision and task execution mode selection, and the joint optimization problem of UAVs trajectory and IRS phase shift-vector design. The Karush-Kuhn-Tucker conditions are utilized to solve the first subproblem and the enhanced differential evolution algorithm is proposed to solve the latter one. The results show that the proposed solution can significantly decrease bandwidth consumption in comparison with the selected advanced algorithms. The results also prove that the sum of bandwidth can be remarkably decreased by implementing a higher number of IRS elements.
{"title":"Joint Communication-Caching-Computing Resource Allocation for Bidirectional Data Computation in IRS-Assisted Hybrid UAV-Terrestrial Network","authors":"Yangzhe Liao;Lin Liu;Yuanyan Song;Ning Xu","doi":"10.23919/cje.2023.00.089","DOIUrl":"10.23919/cje.2023.00.089","url":null,"abstract":"Joint communication-caching-computing resource allocation in wireless inland waterway communications enables resource-constrained unmanned surface vehicles (USVs) to provision computation-intensive and latencysensitive tasks forward beyond fifth-generation (B5G) and sixth-generation (6G) era. The power of such resource allocation cannot be fully studied unless bidirectional data computation is properly managed. A novel intelligent reflecting surface (IRS)-assisted hybrid UAV-terrestrial network architecture is proposed with bidirectional tasks. The sum of uplink and downlink bandwidth minimization problem is formulated by jointly considering link quality, task execution mode selection, UAVs trajectory, and task execution latency constraints. A heuristic algorithm is proposed to solve the formulated challenging problem. We divide the original challenging problem into two subproblems, i.e., the joint optimization problem of USVs offloading decision, caching decision and task execution mode selection, and the joint optimization problem of UAVs trajectory and IRS phase shift-vector design. The Karush-Kuhn-Tucker conditions are utilized to solve the first subproblem and the enhanced differential evolution algorithm is proposed to solve the latter one. The results show that the proposed solution can significantly decrease bandwidth consumption in comparison with the selected advanced algorithms. The results also prove that the sum of bandwidth can be remarkably decreased by implementing a higher number of IRS elements.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606215","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141851665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：