Image Hiding with High Robustness Based on Dynamic Region Attention in the Wavelet Domain

Hidden capacity,concealment,security,and robustness are essential indicators of hiding algorithms.Currently,hiding algorithms tend to focus on algorithmic capacity,concealment,and security but often overlook the robustness of the algorithms.In practical applications,the container can suffer from damage caused by noise,cropping,and other attacks during transmission,resulting in challenging or even impossible complete recovery of the secret image.An image hiding algorithm based on dynamic region attention in the multi-scale wavelet domain is proposed to address this issue and enhance the robustness of hiding algorithms.In this proposed algorithm,a secret image of size 256×256 is first decomposed using an eight-level Haar wavelet transform.The wavelet transform generates one coefficient in the approximation component and twenty-four detail bands,which are then embedded into the carrier image via a hiding network.During the recovery process,the container image is divided into four non-overlapping parts,each employed to reconstruct a low-resolution secret image.These lowresolution secret images are combined using densemodules to obtain a high-quality secret image.The experimental results showed that even under destructive attacks on the container image,the proposed algorithm is successful in recovering a high-quality secret image,indicating that the algorithm exhibits a high degree of robustness against various attacks.The proposed algorithm effectively addresses the robustness issue by incorporating both spatial and channel attention mechanisms in the multi-scale wavelet domain,making it suitable for practical applications.In conclusion,the image hiding algorithm introduced in this study offers significant improvements in robustness compared to existing algorithms.Its ability to recover high-quality secret images even in the presence of destructive attacksmakes it an attractive option for various applications.Further research and experimentation can explore the algorithm’s performance under different scenarios and expand its potential applications.

Graph Convolutional Networks Embedding Textual Structure Information for Relation Extraction

Deep neural network-based relational extraction research has made significant progress in recent years,andit provides data support for many natural language processing downstream tasks such as building knowledgegraph,sentiment analysis and question-answering systems.However,previous studies ignored much unusedstructural information in sentences that could enhance the performance of the relation extraction task.Moreover,most existing dependency-based models utilize self-attention to distinguish the importance of context,whichhardly deals withmultiple-structure information.To efficiently leverage multiple structure information,this paperproposes a dynamic structure attention mechanism model based on textual structure information,which deeplyintegrates word embedding,named entity recognition labels,part of speech,dependency tree and dependency typeinto a graph convolutional network.Specifically,our model extracts text features of different structures from theinput sentence.Textual Structure information Graph Convolutional Networks employs the dynamic structureattention mechanism to learn multi-structure attention,effectively distinguishing important contextual features invarious structural information.In addition,multi-structure weights are carefully designed as amergingmechanismin the different structure attention to dynamically adjust the final attention.This paper combines these featuresand trains a graph convolutional network for relation extraction.We experiment on supervised relation extractiondatasets including SemEval 2010 Task 8,TACRED,TACREV,and Re-TACED,the result significantly outperformsthe previous.

Adversarial Active Learning for Named Entity Recognition in Cybersecurity

Owing to the continuous barrage of cyber threats,there is a massive amount of cyber threat intelligence.However,a great deal of cyber threat intelligence come from textual sources.For analysis of cyber threat intelligence,many security analysts rely on cumbersome and time-consuming manual efforts.Cybersecurity knowledge graph plays a significant role in automatics analysis of cyber threat intelligence.As the foundation for constructing cybersecurity knowledge graph,named entity recognition(NER)is required for identifying critical threat-related elements from textual cyber threat intelligence.Recently,deep neural network-based models have attained very good results in NER.However,the performance of these models relies heavily on the amount of labeled data.Since labeled data in cybersecurity is scarce,in this paper,we propose an adversarial active learning framework to effectively select the informative samples for further annotation.In addition,leveraging the long short-term memory(LSTM)network and the bidirectional LSTM(BiLSTM)network,we propose a novel NER model by introducing a dynamic attention mechanism into the BiLSTM-LSTM encoderdecoder.With the selected informative samples annotated,the proposed NER model is retrained.As a result,the performance of the NER model is incrementally enhanced with low labeling cost.Experimental results show the effectiveness of the proposed method.