用图神经网络分析压缩语音隐写,精度超98%且检测快至0.016秒。
Hierarchical Graph Neural Network for Compressed Speech Steganalysis
- 构建语音流图结构,用GraphSAGE捕捉多层次隐写特征。
- 0.5秒样本下准确率超98%,低嵌入率下达95.17%,提升2.8%。
- 适合实时隐写检测,兼顾高精度与低延迟,尤其适用于短时语音。
基于深度学习的隐写分析方法常面临计算复杂度高及跨数据集泛化能力差的问题。将图神经网络(GNN)引入隐写分析可利用关系数据提升检测精度与适应性。本文首次将图神经网络(特别是GraphSAGE架构)应用于压缩语音通信(VoIP)流的隐写分析。该方法从VoIP流中直接构建图结构,利用GraphSAGE捕获细粒度特征与高层模式的层次化信息,实现高精度检测。实验表明,该方法在识别基于量化索引调制(QIM)的隐写信号方面表现优异:即使在0.5秒短样本下,检测准确率仍超过98%;在低嵌入率等挑战条件下,准确率达95.17%,相比最优现有方法提升2.8个百分点。此外,模型效率显著,0.5秒样本平均检测时间仅0.016秒,比现有最优方法快0.003秒,适用于在线实时隐写分析任务,在短样本、低嵌入率场景下实现了精度与效率的优越平衡。
原文摘要 · Abstract (English)
Steganalysis methods based on deep learning (DL) often struggle with computational complexity and challenges in generalizing across different datasets. Incorporating a graph neural network (GNN) into steganalysis schemes enables the leveraging of relational data for improved detection accuracy and adaptability. This paper presents the first application of a Graph Neural Network (GNN), specifically the GraphSAGE architecture, for steganalysis of compressed voice over IP (VoIP) speech streams. The method involves straightforward graph construction from VoIP streams and employs GraphSAGE to capture hierarchical steganalysis information, including both fine grained details and high level patterns, thereby achieving high detection accuracy. Experimental results demonstrate that the developed approach performs well in uncovering quantization index modulation (QIM)-based steganographic patterns in VoIP signals. It achieves detection accuracy exceeding 98 percent even for short 0.5 second samples, and 95.17 percent accuracy under challenging conditions with low embedding rates, representing an improvement of 2.8 percent over the best performing state of the art methods. Furthermore, the model exhibits superior efficiency, with an average detection time as low as 0.016 seconds for 0.5-second samples an improvement of 0.003 seconds. This makes it efficient for online steganalysis tasks, providing a superior balance between detection accuracy and efficiency under the constraint of short samples with low embedding rates.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。