首页> 外文会议>2012 IEEE International Workshop on Information Forensics and Security. >How to find relevant training data: A paired bootstrapping approach to blind steganalysis
【24h】

How to find relevant training data: A paired bootstrapping approach to blind steganalysis

机译:如何找到相关的训练数据:盲法隐写分析的配对自举方法

获取原文
获取原文并翻译 | 示例

摘要

Today, support vector machines (SVMs) seem to be the classifier of choice in blind steganalysis. This approach needs two steps: first, a training phase determines a separating hyperplane that distinguishes between cover and stego images; second, in a test phase the class membership of an unknown input image is detected using this hyperplane. As in all statistical classifiers, the number of training images is a critical factor: the more images that are used in the training phase, the better the steganalysis performance will be in the test phase, however at the price of a greatly increased training time of the SVM algorithm. Interestingly, only a few training data, the support vectors, determine the separating hyperplane of the SVM. In this paper, we introduce a paired bootstrapping approach specifically developed for the steganalysis scenario that selects likely candidates for support vectors. The resulting training set is considerably smaller, without a significant loss of steganalysis performance.
机译:如今,支持向量机(SVM)似乎已成为盲隐匿分析中的首选分类器。这种方法需要两个步骤:首先,训练阶段确定一个区分掩盖图像和隐身图像的超平面。第二,在测试阶段,使用此超平面检测未知输入图像的类成员资格。与所有统计分类器一样,训练图像的数量是一个关键因素:训练阶段使用的图像越多,测试阶段的隐写分析性能越好,但是代价是训练时间大大增加了SVM算法。有趣的是,只有少数训练数据,支持向量确定了SVM的分离超平面。在本文中,我们介绍了一种专门针对隐写分析方案开发的配对自举方法,该方法选择了可能的支持向量候选对象。所得的训练集要小得多,而隐写分析性能不会显着下降。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号