Javascript must be enabled to continue!
Domain Adaptational Steganographic Text Detection Using Few-Shot Adversary-Refinement Framework
View through CrossRef
Text steganography involves discreetly concealing sensitive messages within natural text, while text steganalysis serves as its counterpart by aiming to detect suspicious text that may contain embedded secret information. Detecting steganographic text has become increasingly difficult because evolving steganographic algorithms produce ever-changing text distributions. Consequently, few-shot text steganalysis, which identifies steganographic text with scarce examples regardless of its distribution has become a research hotspot. The state-of-the-art few-shot text steganalysis relies on the inter-class variance between classes, i.e., they behave satisfactorily in detecting large-variance classes while being incompetent in distinguishing confusable samples from similar steganographic settings. In this paper, we propose an Adversary-Refinement Framework for Text Steganalysis, namely ARTS, which employs a task-invariant extractor and a task-relevant projector to implement an “attract and repel” process. Specifically, in the “attract” stage, we align task-invariant features through adversarial training to shorten the intra-class distance. Afterward, the refined prototypes are projected to a new space in the “repel” stage, and then a refined penalty item is applied to enlarge the inter-class distance. Extensive experiments conducted in six datasets with different inter-class variances demonstrate the superiority of the proposed model over the SOTA models.
Title: Domain Adaptational Steganographic Text Detection Using Few-Shot Adversary-Refinement Framework
Description:
Text steganography involves discreetly concealing sensitive messages within natural text, while text steganalysis serves as its counterpart by aiming to detect suspicious text that may contain embedded secret information.
Detecting steganographic text has become increasingly difficult because evolving steganographic algorithms produce ever-changing text distributions.
Consequently, few-shot text steganalysis, which identifies steganographic text with scarce examples regardless of its distribution has become a research hotspot.
The state-of-the-art few-shot text steganalysis relies on the inter-class variance between classes, i.
e.
, they behave satisfactorily in detecting large-variance classes while being incompetent in distinguishing confusable samples from similar steganographic settings.
In this paper, we propose an Adversary-Refinement Framework for Text Steganalysis, namely ARTS, which employs a task-invariant extractor and a task-relevant projector to implement an “attract and repel” process.
Specifically, in the “attract” stage, we align task-invariant features through adversarial training to shorten the intra-class distance.
Afterward, the refined prototypes are projected to a new space in the “repel” stage, and then a refined penalty item is applied to enlarge the inter-class distance.
Extensive experiments conducted in six datasets with different inter-class variances demonstrate the superiority of the proposed model over the SOTA models.
Related Results
Sleep Habits and Occurrence of Lowback Pain among Craftsmen
Sleep Habits and Occurrence of Lowback Pain among Craftsmen
<span style="color: #000000; font-family: Verdana, Arial, Helvetica, sans-serif; font-size: 10px; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; ...
Sleep Habits and Occurrence of Lowback Pain among Craftsmen
Sleep Habits and Occurrence of Lowback Pain among Craftsmen
<span style="color: #000000; font-family: Verdana, Arial, Helvetica, sans-serif; font-size: 10px; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; ...
Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Let [Formula: see text] be a connected graph of order at least two with vertex set [Formula: see text]. For [Formula: see text], let [Formula: see text] denote the length of an [Fo...
ANALYSIS OF READING MATERIALS IN TEXTBOOK FOR GRADE XI SENIOR HIGH SCHOOL
ANALYSIS OF READING MATERIALS IN TEXTBOOK FOR GRADE XI SENIOR HIGH SCHOOL
This study aims to find out the GI and LD level, the text which has the highest GI and LD and what make the text has the highest GI and LD of Advanced Learning English 2 textbook. ...
Birecognition of prime graphs, and minimal prime graphs
Birecognition of prime graphs, and minimal prime graphs
Given a graph [Formula: see text], a subset [Formula: see text] of [Formula: see text] is a module of [Formula: see text] if for each [Formula: see text], [Formula: see text] is ad...
A saturation problem in meshes
A saturation problem in meshes
Let [Formula: see text] and [Formula: see text] be graphs, where we view [Formula: see text] as the “host” graph and [Formula: see text] as a “forbidden” graph. A spanning subgraph...
Structural, elastic, magnetic and electronic properties of Ti-based Heusler alloys
Structural, elastic, magnetic and electronic properties of Ti-based Heusler alloys
The structural, elastic, magnetic and electronic properties of titanium-based alloys [Formula: see text] [Formula: see text], [Formula: see text] and [Formula: see text] are invest...
When is R[θ] integrally closed?
When is R[θ] integrally closed?
Let [Formula: see text] be an integrally closed domain with quotient field [Formula: see text] and [Formula: see text] be an element of an integral domain containing [Formula: see ...

