A study on Subtractive Pixel Adjacency Matrix features

被引:7
|
作者
Gu, Xiangyuan [1 ]
Guo, Jichang [1 ]
机构
[1] Tianjin Univ, Sch Elect & Informat Engn, Tianjin 300072, Peoples R China
基金
中国国家自然科学基金;
关键词
SPAM features; Steganalysis; Feature selection; Spatial-domain; MUTUAL INFORMATION; STEGANALYSIS; SELECTION; STEGANOGRAPHY;
D O I
10.1007/s11042-019-7285-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Subtractive Pixel Adjacency Matrix (SPAM) features perform well in detecting spatial-domain steganographic algorithm. Further, some methods of SPAM features can be applied to rich models and steganalysis based on deep learning. Therefore, this paper presents a study on SPAM features and it is divided into two parts: in the first part, impact of spatial-domain steganographic on difference between adjacent pixels is first analyzed. Then, three SPAM features are proposed with the same range of differences and different orders of Markov chain. Following that, the influences of order of Markov chain and range of differences on SPAM features are analyzed, and we find that detection accuracy of SPAM features increases with the range of differences increasing; in the second part, SPAM feature is first divided into several modules according to the conclusion. Then, taking detection accuracy of support vector machine (SVM) classifier and mutual information as metrics and module as a unit, a Novel Feature Selection (NFS) algorithm and an Improved Feature Selection algorithm are proposed. Experimental results show that the NFS algorithm can achieve higher detection accuracy than several existing algorithms.
引用
收藏
页码:19681 / 19695
页数:15
相关论文
共 50 条
  • [41] TRANSFORMING AN ADJACENCY MATRIX INTO A PLANAR GRAPH
    HASHIMSHONY, R
    SHAVIV, E
    WACHMAN, A
    BUILDING AND ENVIRONMENT, 1980, 15 (04) : 205 - 217
  • [42] Adjacency and Incidence Matrix of a Soft Graph
    Thange, J. D.
    Reddy, B. Surendranath
    Jain, R. C.
    COMMUNICATIONS IN MATHEMATICS AND APPLICATIONS, 2020, 11 (01): : 23 - 30
  • [43] CLUSTERING BASED ON EIGENVECTORS OF THE ADJACENCY MATRIX
    Lucinska, Malgorzata
    Wierzchon, Slawomir T.
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2018, 28 (04) : 771 - 786
  • [44] Vertex colouring using the adjacency matrix
    Santoso, K. A.
    Dafik
    Agustin, I. H.
    Prihandini, R. M.
    Alfarisi, R.
    2ND INTERNATIONAL CONFERENCE OF COMBINATORICS, GRAPH THEORY, AND NETWORK TOPOLOGY, 2019,
  • [45] The kernel of the adjacency matrix of a rectangular mesh
    Tomei, C
    Vieira, T
    DISCRETE & COMPUTATIONAL GEOMETRY, 2002, 28 (03) : 411 - 425
  • [46] On the mixed adjacency matrix of a mixed graph
    Adiga, Chandrashekar
    Rakshith, B. R.
    So, Wasin
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2016, 495 : 223 - 241
  • [47] DETERMINANT OF ADJACENCY MATRIX AND KEKULE STRUCTURES
    KIANG, YS
    INTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, 1980, 17 : 541 - 547
  • [48] Study of a DEPJFET pixel matrix with continuous clear mechanism
    Klein, P
    Cesura, G
    Fischer, P
    Lutz, G
    Neeser, W
    Richter, RH
    Wermes, N
    NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT, 1997, 392 (1-3): : 254 - 259
  • [49] On the spectral radius of the adjacency matrix and signless Laplacian matrix of a graph
    Jahanbani, A.
    Sheikholeslami, S. M.
    LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (21): : 6846 - 6851
  • [50] The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
    Rojo, O
    Soto, R
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 403 : 97 - 117