CN104637484A - MP3 audio steganography detection method based on co-occurrence matrix analysis - Google Patents

MP3 audio steganography detection method based on co-occurrence matrix analysis Download PDF

Info

Publication number
CN104637484A
CN104637484A CN201510053970.2A CN201510053970A CN104637484A CN 104637484 A CN104637484 A CN 104637484A CN 201510053970 A CN201510053970 A CN 201510053970A CN 104637484 A CN104637484 A CN 104637484A
Authority
CN
China
Prior art keywords
mrow
msub
sample
audio
munderover
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201510053970.2A
Other languages
Chinese (zh)
Other versions
CN104637484B (en
Inventor
王让定
羊开云
严迪群
金超
孙冉
周劲蕾
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Yong Ming
Original Assignee
Ningbo University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ningbo University filed Critical Ningbo University
Priority to CN201510053970.2A priority Critical patent/CN104637484B/en
Publication of CN104637484A publication Critical patent/CN104637484A/en
Application granted granted Critical
Publication of CN104637484B publication Critical patent/CN104637484B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

The invention discloses an MP3 audio steganography detection method based on co-occurrence matrix analysis. According to the method, steganography detection is performed by virtue of analyzing the quantified MDCT (Modified Discrete Cosine Transform) coefficient of main storage data of MP3 audio; transformation of the quantified MDCT coefficient of the audio can be directly or indrectly influenced by performing steganography operation in an audio compressed encoding process and the tiny transformation can be measured by use of the sensitive characteristic of intra-unite correlation of the quantified MDCT coefficient, so that in the method, a steganography analysis characteristic vector sensitive to the steganography operation is constructed according to the principle of the intra-unite correlation of the quantified MDCT coefficient of natural audio, and therefore, the method has generality and is capable of achieving detection effects for multiple algorithms of one type of steganography algorithm. The final steganography analysis characteristic vector constructed by the method is capable of roundly sensing the influence of steganography operation on the quantified MDCT coefficient in a horizontal direction, a vertical direction, a 45-degree angle direction and a 135-degree angle direction at the same time, so that the steganography detection rate is improved and the detection false rate is reduced.

Description

MP3 audio steganography detection method based on co-occurrence matrix analysis
Technical Field
The invention relates to an audio steganography detection technology, in particular to an MP3 audio steganography detection method based on symbiotic matrix analysis.
Background
Steganography is a means for hiding secret information by using redundancy of multimedia files, the secret information to be secretly transmitted can be converted into bit streams and hidden in the multimedia files serving as transmission carriers, and the hiding mode is steganography. Good steganographic algorithms have good imperceptibility and attack resistance. In order to monitor the illegal use of steganography on the internet, steganography detection techniques are proposed. The steganography detection technology is used for extracting and analyzing the characteristics of the multimedia file to be detected so as to judge whether the multimedia file contains the stego information. The carriers for steganography and steganalysis are mainly text, images, video, audio and the like.
Audio files have become a hot spot of interest to steganographers and steganography testers due to their widespread recent spread over the internet. At present, most of steganography detection algorithms for audio are concentrated in a non-compression domain, and correspondingly effective steganography detection algorithms are provided for some classical non-compression domain audio steganography algorithms. In recent years, some non-compressed domain universal steganalysis algorithms are also proposed, and the method has a detection effect on various non-compressed domain audio steganography algorithms. However, the existing steganography detection algorithm for compressed domain audio is only for a specific typical steganography tool, such as MP3Stego and the like, which cannot be used for other steganography algorithms for detecting MP3 audio.
Disclosure of Invention
The invention aims to solve the technical problem of providing an MP3 audio steganography detection method based on symbiotic matrix analysis, which has a detection effect on various MP3 audio steganography methods.
The technical scheme adopted by the invention for solving the technical problems is as follows: an MP3 audio steganography detection method based on co-occurrence matrix analysis is characterized by comprising the following steps:
selecting N uncompressed WAV audios with different change styles, wherein N is more than or equal to 100;
performing compression coding on each uncompressed WAV audio by using an MP3 audio 8HZ coder to obtain an uncompressed MP3 compressed audio corresponding to each uncompressed WAV audio, and forming an audio negative sample library by the obtained N uncompressed MP3 compressed audios;
steganographic information with different lengths and different contents is steganographically written on each uncompressed WAV audio by using an MP3Stego audio steganographic algorithm to obtain steganographic MP3 compressed audio corresponding to each uncompressed WAV audio, and a first-class audio positive sample library is formed by the obtained N steganographic MP3 compressed audio; steganographic information with different lengths and different contents is steganographically written on each uncompressed WAV audio by using a steganographic algorithm selected based on window types to obtain steganographic MP3 compressed audio corresponding to each uncompressed WAV audio, and a second-class audio positive sample library is formed by the obtained N steganographic MP3 compressed audio; steganographic information with different lengths and different contents is steganographically written in each uncompressed WAV audio by using a steganographic algorithm selected based on Huffman code table index to obtain steganographic MP3 compressed audio corresponding to each uncompressed WAV audio, and a third-class audio positive sample library is formed by the obtained N steganographic MP3 compressed audio;
a sample library composed of an audio negative sample library, a first audio positive sample library, a second audio positive sample library and a third audio positive sample library;
decompressing each sample in the sample library by using an MP3 audio lame decoder to obtain a WAV audio corresponding to each sample in the sample library; then, performing compression coding on the WAV audio corresponding to each sample in the sample library by using an MP3 audio lame coder to obtain a carrier estimation corresponding to each sample in the sample library after being recompressed;
fourthly, decompressing each sample in the sample library by using an MP3 audio lame decoder, and extracting 5 of each frame in each sample in the sample libraryTaking 576 quantized MDCT coefficients of each frame in each sample as a line, constructing a coefficient matrix by all quantized MDCT coefficients corresponding to each sample in the sample bank, and recording the coefficient matrix constructed by all quantized MDCT coefficients corresponding to the ith sample in the sample bank as Xi X i = x 1,1 x 1,2 . . . x 1,575 x 1,576 x 2,1 x 2,2 . . . x 2,575 x 2,576 . . . . . . . . . . . . . . . x N i f , 1 x N i f , 2 . . . x N i f , 575 x N i f , 576 , Wherein i is more than or equal to 1 and less than or equal to 4N, XiHas a dimension ofRepresenting the total number of frames, x, contained in the ith sample in the sample bank1,1、x1,2、x1,575、x1,576Corresponding to the 1 st, 2 nd, 575 th and 576 th quantized MDCT coefficients, x, representing the 1 st frame in the ith sample in the sample bank2,1、x2,2、x2,575、x2,576Corresponding to the 1 st, 2 nd, 575 th and 576 th quantized MDCT coefficients representing the 2 nd frame in the ith sample in the sample bank, corresponding to the ith sample in the sample library1 st, 2 nd, 575 th and 576 th quantized MDCT coefficients of the frame;
fifthly, correcting the coefficient with the median value larger than 300 in the coefficient matrix formed by all the quantized MDCT coefficients corresponding to each sample in the sample library to obtain a new coefficient matrix corresponding to each sample in the sample library, and recording the new coefficient matrix corresponding to the ith sample in the sample library as Xi';
Then according to the new coefficient matrix corresponding to each sample in the sample library, constructing a horizontal direction co-occurrence matrix, a vertical direction co-occurrence matrix, a 45-degree angle direction co-occurrence matrix and a 135-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library, and enabling the X-ray detector to detect the X-ray detector to obtain the X-ray detectori' the correspondence of the horizontal direction co-occurrence matrix, the vertical direction co-occurrence matrix, the 45 degree angle co-occurrence matrix and the 135 degree angle co-occurrence matrix is recorded as Pi,0、Pi,90、Pi,45And Pi,135A 1 is to Pi,0The element with the middle subscript (P, q) is marked as Pi,0(p,q),Will Pi,90The element with the middle subscript (P, q) is marked as Pi,90(p,q),Will Pi,45The element with the middle subscript (P, q) is marked as Pi,45(p,q),Will Pi,135The element with the middle subscript (P, q) is marked as Pi,135(p,q),Wherein p is more than or equal to 1 and less than or equal to 300, q is more than or equal to 1 and less than or equal to 300, and d represents the step length of the symbiotic matrix, x'u,vRepresents Xi'the subscript in the middle is the coefficient at (u, v), x'u,v+dRepresents Xi'the subscript in the middle is a coefficient, x'u+d,vRepresents Xi'the subscript in the middle is the coefficient at (u + d, v), x'u+d,v+dRepresents Xi' the subscript in the middle is the coefficient at (u + d, v + d);
constructing a characteristic vector containing 12 high-order statistical features of a horizontal direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library according to the horizontal direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library, and converting P into Pi,0The feature vector containing 12 high-order statistical features is denoted as Fi,0
Constructing a feature vector containing 12 high-order statistical features of a vertical direction co-occurrence matrix of a new coefficient matrix corresponding to each sample in a sample library according to the vertical direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library, and converting P into Pi,90The feature vector containing 12 high-order statistical features is denoted as Fi,90
Constructing a characteristic vector containing 12 high-order statistical features of the 45-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library according to the 45-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library, and converting P into Pi,45The feature vector containing 12 high-order statistical features is denoted as Fi,45
Constructing a characteristic vector containing 12 high-order statistical features of the 135-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library according to the 135-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library, and converting P into Pi,135The feature vector containing 12 high-order statistical features is denoted as Fi,135
Acquiring feature vectors containing 48 features of each sample in the sample library according to respective feature vectors of a horizontal direction co-occurrence matrix, a vertical direction co-occurrence matrix, a 45-degree angle direction co-occurrence matrix and a 135-degree angle direction co-occurrence matrix of a new coefficient matrix corresponding to each sample in the sample library, and recording the feature vector containing 48 features of the ith sample in the sample library as Fi,FiIs Fi,0、Fi,90、Fi,45、Fi,135The 48 high-order statistical features contained in the four feature vectors are formed in sequence;
obtaining the characteristic vector which is estimated by the carrier and corresponds to each sample in the sample base after being recompressed and contains 48 characteristics in the same mode according to the operations from the step (r) to the step (c), and recording the characteristic vector which is estimated by the carrier and corresponds to the ith sample in the sample base after being recompressed and contains 48 characteristics as Fi *
Ninthly, calculating the absolute value of the difference value of the feature vector of each sample in the sample library and the two corresponding features in the feature vector of the carrier estimation corresponding to each sample in the sample library after recompression to obtain the steganalysis feature vector containing 48 elements corresponding to each sample in the sample library, and performing steganalysis on the sample library corresponding to the ith sample and containing 48 elementsAnalyze the feature vector as YiIs a reaction of YiThe t-th element in (1) is marked as Yi(t),Yi(t)=|Fi(t)-Fi *(t) |, where t is greater than or equal to 1 and less than or equal to 48, Fi(t) represents FiThe t-th feature of (1), Fi *(t) represents Fi *The t-th feature in (1), the symbol "|" is an absolute value symbol;
the method comprises the steps that normalization processing is carried out on the steganalysis characteristic vector corresponding to each sample in a sample library by the aid of the red (R) waves, and normalized steganalysis characteristic vectors corresponding to each sample in the sample library are obtained;
marking normalized steganalysis characteristic vectors corresponding to all samples belonging to an audio negative sample library in a sample library as-1, marking normalized steganalysis characteristic vectors corresponding to all samples belonging to a first type of audio positive sample library in the sample library as +1, inputting the normalized steganalysis characteristic vectors corresponding to all samples belonging to the audio negative sample library after marking and the normalized steganalysis characteristic vectors corresponding to all samples belonging to the first type of audio positive sample library into an SVM classifier for training to obtain a detection template of the MP3Stego audio steganalysis algorithm, and marking M as M1
Similarly, marking normalized steganalysis feature vectors corresponding to all samples belonging to the audio negative sample library in the sample library as-1, marking normalized steganalysis feature vectors corresponding to all samples belonging to the second type audio positive sample library in the sample library as +1, inputting the marked normalized steganalysis feature vectors corresponding to all samples belonging to the audio negative sample library and the normalized steganalysis feature vectors corresponding to all samples belonging to the second type audio positive sample library into an SVM classifier for training to obtain a detection template of the steganalysis algorithm selected based on window types, and marking the detection template as M2
Marking normalized steganalysis characteristic vectors corresponding to all samples belonging to an audio negative sample library in a sample library as-1, marking normalized steganalysis characteristic vectors corresponding to all samples belonging to a third type audio positive sample library in the sample library as +1, inputting the normalized steganalysis characteristic vectors corresponding to all samples belonging to the audio negative sample library after marking and the normalized steganalysis characteristic vectors corresponding to all samples belonging to the third type audio positive sample library into an SVM classifier for training to obtain a detection template of the steganalysis algorithm selected based on a Huffman code table index, and marking the detection template as M3
For any MP3 compressed audio to be detected, acquiring normalized steganalysis feature vectors corresponding to the MP3 compressed audio in the same way according to the processes from step (c) to step (r); then, respectively utilizing the detection template M of the MP3Stego audio steganography algorithm1Detection template M of steganographic algorithm based on window type selection2And a detection template M of a steganography algorithm based on Huffman code table index selection3And detecting the normalized steganalysis feature vector corresponding to the MP3 compressed audio to determine whether the MP3 compressed audio is subjected to steganography and an audio steganography algorithm adopted by the steganography.
Step five, the new coefficient matrix X corresponding to the ith sample in the sample libraryiThe acquisition process of' is: mixing Xi'the coefficient at the subscript in (u, v) is denoted as x'u,vWherein,1≤v≤576,xu,vrepresents XiThe middle subscript is the coefficient at (u, v).
The step ofi,0The acquisition process comprises the following steps: fi,0=[Fi,0(1),Fi,0(2),Fi,0(3),Fi,0(4),Fi,0(5),Fi,0(6),Fi,0(7),Fi,0(8),Fi,0(9),Fi,0(10),Fi,0(11),Fi,0(12)]Wherein F isi,0(1),Fi,0(2),…,Fi,0(12) Corresponding representation Fi,0The 1 st to 12 th high order statistical features in (c), <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math> Fi,0(2)=max(Pi,0), <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mfrac> <mrow> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> </mrow> <mrow> <mn>1</mn> <mo>+</mo> <msup> <mrow> <mo>(</mo> <mi>p</mi> <mo>-</mo> <mi>q</mi> <mo>)</mo> </mrow> <mn>2</mn> </msup> </mrow> </mfrac> <mo>,</mo> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msup> <mrow> <mo>(</mo> <mi>p</mi> <mo>-</mo> <mi>mm</mi> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mi>p</mi> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>&times;</mo> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mi>q</mi> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> </mrow> <mrow> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msup> <mrow> <mo>(</mo> <mi>p</mi> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mi>p</mi> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>)</mo> </mrow> <mo>&times;</mo> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msup> <mrow> <mo>(</mo> <mi>q</mi> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mi>q</mi> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>)</mo> </mrow> </mfrac> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>10</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>11</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>12</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mn>300</mn> <mo>-</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mn>300</mn> <mo>-</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> max () represents a function taking the maximum value, <math> <mrow> <mi>mm</mi> <mo>=</mo> <mfrac> <mn>1</mn> <mrow> <mn>300</mn> <mo>&times;</mo> <mn>300</mn> </mrow> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> Pi,0(P, P) represents Pi,0The middle subscript is the element at (P, P), Pi,0(P,300-P) represents Pi,0The middle subscript is the element at (p, 300-p);
according to Fi,0Respectively obtaining F in the same manneri,90、Fi,45And Fi,135
Compared with the prior art, the invention has the advantages that:
1) the method carries out steganography detection by analyzing the MDCT coefficient after the main data quantization of the MP3 audio is stored, because the transformation of the MDCT coefficient after the audio quantization can be directly or indirectly influenced by steganography operation in the audio compression coding process, and the fine transformation can be measured by the sensitive characteristic of the internal relevance of the MDCT coefficient after the quantization, the steganography analysis characteristic vector sensitive to the steganography operation is constructed according to the principle of the internal relevance of the MDCT coefficient after the natural audio quantization, so that the method has universality and can simultaneously have detection effect on a plurality of algorithms of steganography algorithms.
2) The method utilizes the quantized MDCT coefficients of the audio to be detected to construct the symbiotic matrixes in four different directions, namely a horizontal direction symbiotic matrix, a vertical direction symbiotic matrix, a 45-degree angle symbiotic matrix and a 135-degree angle symbiotic matrix, and then constructs the eigenvector containing the high-order statistical characteristics of the symbiotic matrixes in each direction as the final steganalysis characteristic, so that the obtained final steganalysis characteristic vector can comprehensively and simultaneously sense the influence of steganography operation on the correlation of the quantized MDCT coefficients in the four directions, namely the horizontal direction, the vertical direction, the 45-degree angle and the 135-degree angle, the steganalysis detection rate is improved, and the false detection rate is reduced.
3) The method obtains corrected audio through the recompression process of the audio to be detected, simultaneously extracts the characteristic vectors of the audio to be detected and the corrected audio, and then takes the difference value of the two characteristic vectors as the final steganalysis characteristic vector, thus eliminating the interference of the audio characteristic change caused by the content style of the audio to the audio characteristic change caused by steganalysis, and ensuring that the method still has higher steganalysis rate under the condition of less embedded secret information.
Drawings
Fig. 1 is a block diagram of the overall implementation of the method of the present invention.
Detailed Description
The invention is described in further detail below with reference to the accompanying examples.
The overall implementation block diagram of the MP3 audio steganography detection method based on symbiotic matrix analysis provided by the invention is shown in FIG. 1, and the method comprises the following steps:
selecting N uncompressed WAV audios with different change styles, wherein N is more than or equal to 100.
In an implementation, N is 300, for example, 300 uncompressed WAV audios covering various audio styles that are currently typical and having an audio length of 15 seconds are selected.
In actual operation, the lengths of the N uncompressed WAV audios may be all the same, may be partially the same, or may be different from each other, that is, the lengths of the N uncompressed WAV audios are not required.
And secondly, performing compression coding on each uncompressed WAV audio by using an MP3 audio 8HZ coder to obtain an uncompressed MP3 compressed audio corresponding to each uncompressed WAV audio, and forming an audio negative sample library by the obtained N uncompressed MP3 compressed audios. Here, each uncompressed WAV audio is compression-encoded by using an MP3 audio 8HZ encoder, and actually, the MP3Stego audio steganography tool can be directly used to perform compression encoding on each uncompressed WAV audio without Stego information, and the MP3 compressed audio corresponding to each uncompressed WAV audio can also be obtained.
Steganographic information with different lengths and different contents is steganographically written on each uncompressed WAV audio by using an MP3Stego audio steganographic algorithm to obtain steganographic MP3 compressed audio corresponding to each uncompressed WAV audio, and a first-class audio positive sample library is formed by the obtained N steganographic MP3 compressed audio; steganographic information with different lengths and different contents is steganographically written on each uncompressed WAV audio by using a steganographic algorithm selected based on window types to obtain steganographic MP3 compressed audio corresponding to each uncompressed WAV audio, and a second-class audio positive sample library is formed by the obtained N steganographic MP3 compressed audio; steganographic information with different lengths and different contents is steganographically written in each uncompressed WAV audio by using a steganographic algorithm selected based on Huffman code table index to obtain steganographic MP3 compressed audio corresponding to each uncompressed WAV audio, and a third-class audio positive sample library is formed by the obtained N steganographic MP3 compressed audio.
And the audio negative sample library, the first type audio positive sample library, the second type audio positive sample library and the third type audio positive sample library form a sample library.
The MP3Stego audio steganography algorithm, the steganography algorithm selected based on window types and the steganography algorithm selected based on Hufffman code table indexes are all realized on the basis of an MP3 audio 8HZ encoder, an uncompressed WAV audio is compressed and encoded by an MP3 audio 8HZ encoder, and the MP3Stego audio steganography algorithm embeds secret information by adjusting the parity of the length of a main data block of an encoding parameter in the quantization encoding process; the steganographic algorithm selected based on the window type embeds the secret information by adjusting the window type of the MDCT coefficient change; the steganography algorithm based on Huffman code table index selection achieves the aim of steganography by adjusting the index of a code table in the process of performing Huffman coding on MDCT coefficients of quantization coding.
Decompressing each sample in the sample library by using an MP3 audio lame decoder to obtain a WAV audio corresponding to each sample in the sample library; and then, performing compression coding on the WAV audio corresponding to each sample in the sample library by using an MP3 audio lame coder to obtain a carrier estimation corresponding to each sample in the sample library after being recompressed.
Decompressing each sample in the sample library by using an MP3 audio lame decoder, extracting 576 quantized MDCT coefficients of each frame in each sample in the sample library, taking the 576 quantized MDCT coefficients of each frame in each sample as a row, forming all quantized MDCT coefficients corresponding to each sample in the sample library into a coefficient matrix, and recording the coefficient matrix formed by all quantized MDCT coefficients corresponding to the ith sample in the sample library as Xi X i = x 1,1 x 1,2 . . . x 1,575 x 1,576 x 2,1 x 2,2 . . . x 2,575 x 2,576 . . . . . . . . . . . . . . . x N i f , 1 x N i f , 2 . . . x N i f , 575 x N i f , 576 , Wherein i is more than or equal to 1 and less than or equal to 4N, XiHas a dimension ofRepresenting the total number of frames, x, contained in the ith sample in the sample bank1,1、x1,2、x1,575、x1,576Corresponding to the second in the sample library1 st, 2 nd, 575 th, 576 th quantized MDCT coefficients, x, of the 1 st frame of i samples2,1、x2,2、x2,575、x2,576Corresponding to the 1 st, 2 nd, 575 th and 576 th quantized MDCT coefficients representing the 2 nd frame in the ith sample in the sample bank, corresponding to the ith sample in the sample libraryThe 1 st, 2 nd, 575 th, 576 th quantized MDCT coefficients of the frame.
Fifthly, correcting the coefficient with the median value larger than 300 in the coefficient matrix formed by all the quantized MDCT coefficients corresponding to each sample in the sample library to obtain a new coefficient matrix corresponding to each sample in the sample library, and recording the new coefficient matrix corresponding to the ith sample in the sample library as Xi'. In this embodiment, in step (v), the new coefficient matrix X corresponding to the ith sample in the sample bankiThe acquisition process of' is: mixing Xi'the coefficient at the subscript in (u, v) is denoted as x'u,vWherein,1≤v≤576,xu,vrepresents XiThe middle subscript is the coefficient at (u, v), xu,vAlso denoted is the v-th quantized MDCT coefficient of the u-th frame in the i-th sample in the pre-modification sample bank.
Then, according to the new coefficient matrix corresponding to each sample in the sample library, constructing a horizontal direction co-occurrence matrix, a vertical direction co-occurrence matrix, a 45-degree angle direction co-occurrence matrix sum of the new coefficient matrix corresponding to each sample in the sample libraryCo-occurrence matrix of 135 degree angle, Xi' the correspondence of the horizontal direction co-occurrence matrix, the vertical direction co-occurrence matrix, the 45 degree angle co-occurrence matrix and the 135 degree angle co-occurrence matrix is recorded as Pi,0、Pi,90、Pi,45And Pi,135A 1 is to Pi,0The element with the middle subscript (P, q) is marked as Pi,0(p,q),Will Pi,90The element with the middle subscript (P, q) is marked as Pi,90(p,q),Will Pi,45The element with the middle subscript (P, q) is marked as Pi,45(p,q),Will Pi,135The element with the middle subscript (P, q) is marked as Pi,135(p,q),Wherein p is not less than 1 and not more than 300, q is not less than 1 and not more than 300, d represents the step size of the co-occurrence matrix, and in this embodiment, d is 2, x'u,vRepresents Xi'the subscript in the middle is the coefficient at (u, v), x'u,v+dRepresents Xi'the subscript in the middle is a coefficient, x'u+d,vRepresents Xi'the subscript in the middle is the coefficient at (u + d, v), x'u+d,v+dRepresents XiThe' subscript in the middle is the coefficient at (u + d, v + d).
Here, since the ratio of the median of all quantized MDCT coefficients of an audio smaller than 300 is large, since the method of the present invention is to reduce the dimension of the co-occurrence matrix, the value of all coefficients larger than 300 in the coefficient matrix is replaced with 300, resulting in a new coefficient matrix with a value ranging from 0 to 300.
Constructing a horizontal co-occurrence matrix containing 1 of the new coefficient matrix corresponding to each sample in the sample library according to the horizontal co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample libraryFeature vector of 2 higher order statistical features, Pi,0The feature vector containing 12 high-order statistical features is denoted as Fi,0,Fi,0=[Fi,0(1),Fi,0(2),Fi,0(3),Fi,0(4),Fi,0(5),Fi,0(6),Fi,0(7),Fi,0(8),Fi,0(9),Fi,0(10),Fi,0(11),Fi,0(12)]Wherein F isi,0(1),Fi,0(2),…,Fi,0(12) Corresponding representation Fi,0The 1 st to 12 th high order statistical features in (c), <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math> Fi,0(2)=max(Pi,0), <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mfrac> <mrow> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> </mrow> <mrow> <mn>1</mn> <mo>+</mo> <msup> <mrow> <mo>(</mo> <mi>p</mi> <mo>-</mo> <mi>q</mi> <mo>)</mo> </mrow> <mn>2</mn> </msup> </mrow> </mfrac> <mo>,</mo> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msup> <mrow> <mo>(</mo> <mi>p</mi> <mo>-</mo> <mi>mm</mi> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mi>p</mi> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>&times;</mo> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mi>q</mi> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> </mrow> <mrow> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msup> <mrow> <mo>(</mo> <mi>p</mi> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mi>p</mi> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>)</mo> </mrow> <mo>&times;</mo> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msup> <mrow> <mo>(</mo> <mi>q</mi> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mi>q</mi> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>)</mo> </mrow> </mfrac> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>10</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>11</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>12</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mn>300</mn> <mo>-</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mn>300</mn> <mo>-</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> max () represents a function taking the maximum value, <math> <mrow> <mi>mm</mi> <mo>=</mo> <mfrac> <mn>1</mn> <mrow> <mn>300</mn> <mo>&times;</mo> <mn>300</mn> </mrow> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> Pi,0(P, P) represents Pi,0The middle subscript is the element at (P, P), Pi,0(P,300-P) represents Pi,0The middle subscript is the element at (p, 300-p);
constructing a feature vector containing 12 high-order statistical features of a vertical direction co-occurrence matrix of a new coefficient matrix corresponding to each sample in a sample library according to the vertical direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library, and converting P into Pi,90The feature vector containing 12 high-order statistical features is denoted as Fi,90,Fi,90=[Fi,90(1),Fi,90(2),Fi,90(3),Fi,90(4),Fi,90(5),Fi,90(6),Fi,90(7),Fi,90(8),Fi,90(9),Fi,90(10),Fi,90(11),Fi,90(12)]Wherein F isi,90(1),Fi,90(2),…,Fi,90(12) Corresponding representation Fi,90The 1 st to 12 th high order statistical features in F are obtainedi,90The formula adopted by the 1 st to 12 th high-order statistical features in the method and the acquisition Fi,0The 1 st to 12 th high order statistical characteristics in (b) are the same in formula.
Constructing a characteristic vector containing 12 high-order statistical features of the 45-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library according to the 45-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library, and converting P into Pi,45The feature vector containing 12 high-order statistical features is denoted as Fi,45,Fi,45=[Fi,45(1),Fi,45(2),Fi,45(3),Fi,45(4),Fi,45(5),Fi,45(6),Fi,45(7),Fi,45(8),Fi,45(9),Fi,45(10),Fi,45(11),Fi,45(12)]Wherein F isi,45(1),Fi,45(2),…,Fi,45(12) Corresponding representation Fi,45The 1 st to 12 th high order statistical features in F are obtainedi,45The formula adopted by the 1 st to 12 th high-order statistical features in the method and the acquisition Fi,0The 1 st to 12 th high order statistical characteristics in (b) are the same in formula.
Constructing a characteristic vector containing 12 high-order statistical features of the 135-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library according to the 135-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library, and converting P into Pi,135The feature vector containing 12 high-order statistical features is denoted as Fi,135,Fi,135=[Fi,135(1),Fi,135(2),Fi,135(3),Fi,135(4),Fi,135(5),Fi,135(6),Fi,135(7),Fi,135(8),Fi,135(9),Fi,135(10),Fi,135(11),Fi,135(12)]Wherein F isi,135(1),Fi,135(2),…,Fi,135(12) Corresponding representation Fi,135The 1 st to 12 th high order statistical features in F are obtainedi,135The formula adopted by the 1 st to 12 th high-order statistical features in the method and the acquisition Fi,0The 1 st to 12 th high order statistical characteristics in (b) are the same in formula.
Acquiring feature vectors containing 48 features of each sample in the sample library according to respective feature vectors of a horizontal direction co-occurrence matrix, a vertical direction co-occurrence matrix, a 45-degree angle direction co-occurrence matrix and a 135-degree angle direction co-occurrence matrix of a new coefficient matrix corresponding to each sample in the sample library, and recording the feature vector containing 48 features of the ith sample in the sample library as Fi,FiIs Fi,0、Fi,90、Fi,45、Fi,135The 48 high-order statistical features contained in the four feature vectors are formed in sequence, namely Fi1 st to 12 th features in (b) are corresponding to Fi,01 st to 12 th higher order statistical feature of (1), Fi13 th to 24 th features in (b) are corresponding to Fi,901 st to 12 th higher order statistical feature of (1), FiIs F to the 25 th to 36 th feature ofi,451 st to 12 th higher order statistical feature of (1), FiThe 37 th to 48 th features in (b) correspond to Fi,1351 st to 12 th high order statistical features.
Obtaining the characteristic vector which is estimated by the carrier and corresponds to each sample in the sample base after being recompressed and contains 48 characteristics in the same mode according to the operations from the step (r) to the step (c), and recording the characteristic vector which is estimated by the carrier and corresponds to the ith sample in the sample base after being recompressed and contains 48 characteristics as Fi *. Firstly, decompressing the carrier estimation corresponding to each sample recompressed in the sample library by using an MP3 audio lamee decoder, extracting 576 quantized MDCT coefficients of each frame in the carrier estimation corresponding to each sample recompressed in the sample library, and decompressing the 576 quantized MDCT coefficients of each frame in the carrier estimation corresponding to each sample recompressedAs a row, all quantized MDCT coefficients corresponding to the carrier estimation after each sample in the sample library is recompressed form a coefficient matrix; then correcting the coefficient with the median value larger than 300 in the coefficient matrix formed by all quantized MDCT coefficients corresponding to the carrier estimation after each sample in the sample library is recompressed to obtain a new coefficient matrix corresponding to the carrier estimation after each sample in the sample library is recompressed; then constructing a horizontal direction co-occurrence matrix, a vertical direction co-occurrence matrix, a 45-degree angle direction co-occurrence matrix and a 135-degree angle direction co-occurrence matrix of a new coefficient matrix estimated by a carrier corresponding to each sample in the sample library after recompression; then constructing a feature vector containing 12 high-order statistical features of a horizontal direction co-occurrence matrix of a new coefficient matrix corresponding to carrier estimation after each sample in a sample library is recompressed, a feature vector containing 12 high-order statistical features of a vertical direction co-occurrence matrix, a feature vector containing 12 high-order statistical features of a 45-degree angle direction co-occurrence matrix, and a feature vector containing 12 high-order statistical features of a 135-degree angle direction co-occurrence matrix; and estimating respective eigenvectors of a horizontal direction co-occurrence matrix, a vertical direction co-occurrence matrix, a 45-degree angle direction co-occurrence matrix and a 135-degree angle direction co-occurrence matrix of the corresponding new coefficient matrix according to the carrier corresponding to each sample in the sample library after recompression, and acquiring the eigenvectors including 48 characteristics estimated by the carrier corresponding to each sample in the sample library after recompression.
Ninthly, calculating the absolute value of the difference value of the two corresponding features in the feature vector of each sample in the sample library and the feature vector of the carrier estimation corresponding to each sample in the sample library after recompression to obtain the steganalysis feature vector containing 48 elements corresponding to each sample in the sample library, and recording the steganalysis feature vector containing 48 elements corresponding to the ith sample in the sample library as YiIs a reaction of YiThe t-th element in (1) is marked as Yi(t),Yi(t)=|Fi(t)-Fi *(t) |, where t is greater than or equal to 1 and less than or equal to 48, Fi(t) represents FiThe t-th feature of (1), Fi *(t) represents Fi *The symbol "|" is an absolute value symbol.
And (c) performing normalization processing on the steganalysis characteristic vector corresponding to each sample in the sample library by using the existing normalization processing technology to obtain the normalized steganalysis characteristic vector corresponding to each sample in the sample library.
Marking normalized steganalysis characteristic vectors corresponding to all samples belonging to an audio negative sample library in a sample library as-1, marking normalized steganalysis characteristic vectors corresponding to all samples belonging to a first type of audio positive sample library in the sample library as +1, inputting the normalized steganalysis characteristic vectors corresponding to all samples belonging to the audio negative sample library after marking and the normalized steganalysis characteristic vectors corresponding to all samples belonging to the first type of audio positive sample library into an SVM classifier for training to obtain a detection template of the MP3Stego audio steganalysis algorithm, and marking M as M1
Similarly, marking normalized steganalysis feature vectors corresponding to all samples belonging to the audio negative sample library in the sample library as-1, marking normalized steganalysis feature vectors corresponding to all samples belonging to the second type audio positive sample library in the sample library as +1, inputting the marked normalized steganalysis feature vectors corresponding to all samples belonging to the audio negative sample library and the normalized steganalysis feature vectors corresponding to all samples belonging to the second type audio positive sample library into an SVM classifier for training to obtain a detection template of the steganalysis algorithm selected based on window types, and marking the detection template as M2
Marking normalized steganalysis characteristic vectors corresponding to all samples belonging to the audio negative sample library in the sample library as-1, and marking normalized steganalysis characteristic vectors corresponding to all samples belonging to the third type audio positive sample library in the sample library as-1The analysis feature vector is marked as +1, then the marked normalized steganalysis feature vectors corresponding to all samples belonging to the audio negative sample library and the normalized steganalysis feature vectors corresponding to all samples belonging to the third class audio positive sample library are input into an SVM classifier for training to obtain a detection template of the steganalysis algorithm selected based on the Huffman code table index, and the detection template is marked as M3
For any MP3 compressed audio to be detected, acquiring normalized steganalysis feature vectors corresponding to the MP3 compressed audio in the same way according to the processes from step (c) to step (r); then, respectively utilizing the detection template M of the MP3Stego audio steganography algorithm1Detection template M of steganographic algorithm based on window type selection2And a detection template M of a steganography algorithm based on Huffman code table index selection3And detecting the normalized steganalysis feature vector corresponding to the MP3 compressed audio to determine whether the MP3 compressed audio is subjected to steganography and an audio steganography algorithm adopted by the steganography.
To further illustrate the feasibility and effectiveness of the method of the present invention, experiments were conducted.
The result of a steganalysis of MP3 compressed audio may be one of four cases: 1) the MP3 compressed audio to be detected is a secret-containing carrier, and the judgment result of the steganography detection method is also the secret-containing carrier and belongs to True Positive (True Positive); 2) the MP3 compressed audio to be detected is an original carrier, and the carrier is judged to be a secret carrier by a steganography detection method and belongs to False Positive and False alarm (False Positive); 3) the MP3 compressed audio to be detected is an original carrier, and the judgment result of the steganography detection method is also the original carrier and belongs to True negativity (True Negative); 4) the MP3 compressed audio to be detected is a secret carrier, and the steganography detection method judges that the audio is an original carrier and belongs to false negative and false alarm (Falsenegtive).
When a plurality of MP3 compressed audio frequencies are detected, the detection accuracy, false alarm rate and false alarm rate can be respectively expressed by the following formulas:
acquiring normalized steganography analysis feature vectors corresponding to 100 MP3 compressed audios respectively according to the processes from the third step to the third step for 50 steganographic MP3 compressed audios obtained by steganography through an MP3Stego audio steganography algorithm and 50 clean non-steganographic MP3 compressed audios in the same way; then using M1The normalized steganalysis feature vectors corresponding to the 100 MP3 compressed audios are detected, 48 audios which belong to true positives, 2 audios which belong to false alarms, 47 audios which belong to true negatives and 3 audios which belong to false alarms, and the detection results are listed in Table 1.
Table 1 shows the detection results of steganographic MP3 compressed audio and non-steganographic MP3 compressed audio obtained by steganography with MP3Stego audio steganography algorithm
Acquiring normalized steganography analysis feature vectors corresponding to 100 MP3 compressed audios respectively by 50 steganography MP3 compressed audios obtained by steganography based on window type selection and 50 clean non-steganography MP3 compressed audios in the same way according to the processes from the third step to the third step; then using M2The normalized steganalysis feature vectors corresponding to the 100 MP3 compressed audios are detected, 49 audios which belong to true positives, 1 audio which belong to false alarms, 50 audio which belong to true negatives and 0 audio which belongs to false alarms, and the detection results are listed in Table 2.
TABLE 2 detection results of steganographic MP3 compressed audio and non-steganographic MP3 compressed audio steganographically obtained using a steganographic algorithm based on window type selection
Acquiring normalized steganography analysis feature vectors corresponding to 100 MP3 compressed audios respectively according to the processes from the third step to the third step for 50 steganography MP3 compressed audios obtained by steganography based on Huffman code table index selection and 50 clean non-steganography MP3 compressed audios in the same way; then using M3The normalized steganalysis feature vectors corresponding to the 100 MP3 compressed audios are detected, 44 audios belonging to true positives, 6 audios belonging to false alarms, 42 audios belonging to true negatives and 8 audios belonging to false alarms, and the detection results are listed in Table 3.
Table 3 detection results of steganographic MP3 compressed audio and non-steganographic MP3 compressed audio obtained by steganographic algorithm based on huffman code table index selection
As can be seen from tables 1 to 3, the method of the present invention has a good detection effect on the steganographic MP3 compressed audio obtained by steganography using the MP3Stego audio steganography algorithm, the steganographic MP3 compressed audio obtained by steganography using the steganography algorithm selected based on the window type, and the steganographic MP3 compressed audio obtained by steganography using the steganography algorithm selected based on the huffman code table index, and has a low false alarm rate and a low false alarm rate, wherein the steganographic MP3 compressed audio obtained by steganography using the steganography algorithm selected based on the window type has a best detection effect, a highest detection accuracy, and a lowest false alarm rate and false alarm rate. This fully demonstrates that the method of the present invention is feasible and efficient relative to the common steganographic detection algorithm.

Claims (3)

1. An MP3 audio steganography detection method based on co-occurrence matrix analysis is characterized by comprising the following steps:
selecting N uncompressed WAV audios with different change styles, wherein N is more than or equal to 100;
performing compression coding on each uncompressed WAV audio by using an MP3 audio 8HZ coder to obtain an uncompressed MP3 compressed audio corresponding to each uncompressed WAV audio, and forming an audio negative sample library by the obtained N uncompressed MP3 compressed audios;
steganographic information with different lengths and different contents is steganographically written on each uncompressed WAV audio by using an MP3Stego audio steganographic algorithm to obtain steganographic MP3 compressed audio corresponding to each uncompressed WAV audio, and a first-class audio positive sample library is formed by the obtained N steganographic MP3 compressed audio; steganographic information with different lengths and different contents is steganographically written on each uncompressed WAV audio by using a steganographic algorithm selected based on window types to obtain steganographic MP3 compressed audio corresponding to each uncompressed WAV audio, and a second-class audio positive sample library is formed by the obtained N steganographic MP3 compressed audio; steganographic information with different lengths and different contents is steganographically written in each uncompressed WAV audio by using a steganographic algorithm selected based on Huffman code table index to obtain steganographic MP3 compressed audio corresponding to each uncompressed WAV audio, and a third-class audio positive sample library is formed by the obtained N steganographic MP3 compressed audio;
a sample library composed of an audio negative sample library, a first audio positive sample library, a second audio positive sample library and a third audio positive sample library;
decompressing each sample in the sample library by using an MP3 audio lame decoder to obtain a WAV audio corresponding to each sample in the sample library; then, performing compression coding on the WAV audio corresponding to each sample in the sample library by using an MP3 audio lame coder to obtain a carrier estimation corresponding to each sample in the sample library after being recompressed;
decompressing each sample in the sample library by using an MP3 audio lame decoder, extracting 576 quantized MDCT coefficients of each frame in each sample in the sample library, taking the 576 quantized MDCT coefficients of each frame in each sample as a row, forming all quantized MDCT coefficients corresponding to each sample in the sample library into a coefficient matrix, and recording the coefficient matrix formed by all quantized MDCT coefficients corresponding to the ith sample in the sample library as XiWherein i is more than or equal to 1 and less than or equal to 4N, XiHas a dimension of Representing the total number of frames, x, contained in the ith sample in the sample bank1,1、x1,2、x1,575、x1,576Corresponding to the 1 st, 2 nd, 575 th and 576 th quantized MDCT coefficients, x, representing the 1 st frame in the ith sample in the sample bank2,1、x2,2、x2,575、x2,576Corresponding to the 1 st, 2 nd, 575 th and 576 th quantized MDCT coefficients representing the 2 nd frame in the ith sample in the sample bank, corresponding to the ith sample in the sample library1 st, 2 nd, 575 th and 576 th quantized MDCT coefficients of the frame;
fifthly, correcting the coefficient with the median value larger than 300 in the coefficient matrix formed by all the quantized MDCT coefficients corresponding to each sample in the sample library to obtain a new coefficient matrix corresponding to each sample in the sample library, and recording the new coefficient matrix corresponding to the ith sample in the sample library as Xi';
Then according to the new coefficient matrix corresponding to each sample in the sample library, constructing a horizontal direction co-occurrence matrix, a vertical direction co-occurrence matrix, a 45-degree angle direction co-occurrence matrix and a 135-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library, and enabling the X-ray detector to detect the X-ray detector to obtain the X-ray detectori' the correspondence of the horizontal direction co-occurrence matrix, the vertical direction co-occurrence matrix, the 45 degree angle co-occurrence matrix and the 135 degree angle co-occurrence matrix is recorded as Pi,0、Pi,90、Pi,45And Pi,135A 1 is to Pi,0The element with the middle subscript (P, q) is marked as Pi,0(p,q),Will Pi,90The element with the middle subscript (P, q) is marked as Pi,90(p,q),Will Pi,45The element with the middle subscript (P, q) is marked as Pi,45(p,q),Will Pi,135The element with the middle subscript (P, q) is marked as Pi,135(p,q),Wherein p is more than or equal to 1 and less than or equal to 300, q is more than or equal to 1 and less than or equal to 300, and d represents the step length of the symbiotic matrix, x'u,vRepresents Xi'the subscript in the middle is the coefficient at (u, v), x'u,v+dRepresents Xi'the subscript in the middle is a coefficient, x'u+d,vRepresents Xi'the subscript in the middle is the coefficient at (u + d, v), x'u+d,v+dRepresents Xi' the subscript in the middle is the coefficient at (u + d, v + d);
constructing a characteristic vector containing 12 high-order statistical features of a horizontal direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library according to the horizontal direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library, and converting P into Pi,0The feature vector containing 12 high-order statistical features is denoted as Fi,0
Constructing a feature vector containing 12 high-order statistical features of a vertical direction co-occurrence matrix of a new coefficient matrix corresponding to each sample in a sample library according to the vertical direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library, and converting P into Pi,90The feature vector containing 12 high-order statistical features is denoted as Fi,90
Constructing a 45-degree angle of a new coefficient matrix corresponding to each sample in the sample library according to a 45-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample libraryThe feature vector of the direction co-occurrence matrix, which contains 12 high-order statistical features, is Pi,45The feature vector containing 12 high-order statistical features is denoted as Fi,45
Constructing a characteristic vector containing 12 high-order statistical features of the 135-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library according to the 135-degree angle direction co-occurrence matrix of the new coefficient matrix corresponding to each sample in the sample library, and converting P into Pi,135The feature vector containing 12 high-order statistical features is denoted as Fi,135
Acquiring feature vectors containing 48 features of each sample in the sample library according to respective feature vectors of a horizontal direction co-occurrence matrix, a vertical direction co-occurrence matrix, a 45-degree angle direction co-occurrence matrix and a 135-degree angle direction co-occurrence matrix of a new coefficient matrix corresponding to each sample in the sample library, and recording the feature vector containing 48 features of the ith sample in the sample library as Fi,FiIs Fi,0、Fi,90、Fi,45、Fi,135The 48 high-order statistical features contained in the four feature vectors are formed in sequence;
obtaining the characteristic vector which is estimated by the carrier and corresponds to each sample in the sample base after being recompressed and contains 48 characteristics in the same mode according to the operations from the step (r) to the step (c), and recording the characteristic vector which is estimated by the carrier and corresponds to the ith sample in the sample base after being recompressed and contains 48 characteristics as Fi *
Ninthly, calculating the absolute value of the difference value of the two corresponding features in the feature vector of each sample in the sample library and the feature vector of the carrier estimation corresponding to each sample in the sample library after recompression to obtain the steganalysis feature vector containing 48 elements corresponding to each sample in the sample library, and recording the steganalysis feature vector containing 48 elements corresponding to the ith sample in the sample library as YiIs a reaction of YiThe t-th element in (1) is marked as Yi(t),Wherein t is more than or equal to 1 and less than or equal to 48, Fi(t) represents FiThe t-th feature of (1), Fi *(t) represents Fi *The t-th feature in (1), the symbol "|" is an absolute value symbol;
the method comprises the steps that normalization processing is carried out on the steganalysis characteristic vector corresponding to each sample in a sample library by the aid of the red (R) waves, and normalized steganalysis characteristic vectors corresponding to each sample in the sample library are obtained;
marking normalized steganalysis characteristic vectors corresponding to all samples belonging to an audio negative sample library in a sample library as-1, marking normalized steganalysis characteristic vectors corresponding to all samples belonging to a first type of audio positive sample library in the sample library as +1, inputting the normalized steganalysis characteristic vectors corresponding to all samples belonging to the audio negative sample library after marking and the normalized steganalysis characteristic vectors corresponding to all samples belonging to the first type of audio positive sample library into an SVM classifier for training to obtain a detection template of the MP3Stego audio steganalysis algorithm, and marking M as M1
Similarly, marking normalized steganalysis feature vectors corresponding to all samples belonging to the audio negative sample library in the sample library as-1, marking normalized steganalysis feature vectors corresponding to all samples belonging to the second type audio positive sample library in the sample library as +1, inputting the marked normalized steganalysis feature vectors corresponding to all samples belonging to the audio negative sample library and the normalized steganalysis feature vectors corresponding to all samples belonging to the second type audio positive sample library into an SVM classifier for training to obtain a detection template of the steganalysis algorithm selected based on window types, and marking the detection template as M2
Marking normalized steganalysis characteristic vectors corresponding to all samples belonging to the audio negative sample library in the sample library as-1, and marking normalized steganalysis characteristic vectors corresponding to all samples belonging to the third type audio positive sample library in the sample libraryAnd if the sum is +1, inputting the normalized steganalysis feature vectors corresponding to all the marked samples belonging to the audio negative sample library and the normalized steganalysis feature vectors corresponding to all the samples belonging to the third-class audio positive sample library into an SVM classifier for training to obtain a detection template of the steganalysis algorithm selected based on the Hufffman code table index, and marking the detection template as M3
For any MP3 compressed audio to be detected, acquiring normalized steganalysis feature vectors corresponding to the MP3 compressed audio in the same way according to the processes from step (c) to step (r); then, respectively utilizing the detection template M of the MP3Stego audio steganography algorithm1Detection template M of steganographic algorithm based on window type selection2And a detection template M of a steganography algorithm based on Huffman code table index selection3And detecting the normalized steganalysis feature vector corresponding to the MP3 compressed audio to determine whether the MP3 compressed audio is subjected to steganography and an audio steganography algorithm adopted by the steganography.
2. The MP3 audio steganography detection method based on co-occurrence matrix analysis according to claim 1, wherein the new coefficient matrix X corresponding to the ith sample in the sample bank in the fifth stepiThe acquisition process of' is: mixing Xi'the coefficient at the subscript in (u, v) is denoted as x'u,vWherein,1≤v≤576,xu,vrepresents XiThe middle subscript is the coefficient at (u, v).
3. Co-occurrence matrix analysis based on the claims 1 or 2The MP3 audio steganography detection method is characterized in that F is adopted in the stepi,0The acquisition process comprises the following steps: fi,0=[Fi,0(1),Fi,0(2),Fi,0(3),Fi,0(4),Fi,0(5),Fi,0(6),Fi,0(7),Fi,0(8),Fi,0(9),Fi,0(10),Fi,0(11),Fi,0(12)]Wherein F isi,0(1),Fi,0(2),…,Fi,0(12) Corresponding representation Fi,0The 1 st to 12 th high order statistical features in (c), <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math> Fi,0(2)=max(Pi,0), <math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math>
<math> <mrow> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> <mi>=</mi> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mfrac> <mrow> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> </mrow> <mrow> <mn>1</mn> <mo>+</mo> <msup> <mrow> <mo>(</mo> <mi>p</mi> <mo>-</mo> <mi>q</mi> <mo>)</mo> </mrow> <mn>2</mn> </msup> </mrow> </mfrac> <mo>,</mo> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> </mrow> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mrow> <msup> <mrow> <mo>(</mo> <mi>p</mi> <mo>-</mo> <mi>mm</mi> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>&times;</mo> <mi>P</mi> </mrow> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math>
<math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mi>p</mi> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>&times;</mo> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mi>q</mi> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> </mrow> <mrow> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msup> <mrow> <mo>(</mo> <mi>p</mi> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mi>p</mi> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>)</mo> </mrow> <mo>&times;</mo> <mrow> <mo>(</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msup> <mrow> <mo>(</mo> <mi>q</mi> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <mi>q</mi> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>,</mo> </mrow> </math>
<math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math>
<math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math>
<math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>10</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math>
<math> <mrow> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>11</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>12</mn> <mo>)</mo> </mrow> <mo>=</mo> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mn>300</mn> <mo>-</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mn>300</mn> <mo>-</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> max () represents a function taking the maximum value, <math> <mrow> <mi>mm</mi> <mo>=</mo> <mfrac> <mn>1</mn> <mrow> <mn>300</mn> <mo>&times;</mo> <mn>300</mn> </mrow> </mfrac> <munderover> <mi>&Sigma;</mi> <mrow> <mi>p</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>q</mi> <mo>=</mo> <mn>1</mn> </mrow> <mn>300</mn> </munderover> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mn>0</mn> </mrow> </msub> <mrow> <mo>(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> Pi,0(P, P) represents Pi,0The middle subscript is the element at (P, P), Pi,0(P,300-P) represents Pi,0The middle subscript is the element at (p, 300-p);
according to Fi,0Respectively obtaining F in the same manneri,90、Fi,45And Fi,135
CN201510053970.2A 2015-02-03 2015-02-03 A kind of MP3 audio steganography detection methods based on Co-occurrence Matrix Analysis Active CN104637484B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510053970.2A CN104637484B (en) 2015-02-03 2015-02-03 A kind of MP3 audio steganography detection methods based on Co-occurrence Matrix Analysis

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510053970.2A CN104637484B (en) 2015-02-03 2015-02-03 A kind of MP3 audio steganography detection methods based on Co-occurrence Matrix Analysis

Publications (2)

Publication Number Publication Date
CN104637484A true CN104637484A (en) 2015-05-20
CN104637484B CN104637484B (en) 2017-09-29

Family

ID=53216155

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510053970.2A Active CN104637484B (en) 2015-02-03 2015-02-03 A kind of MP3 audio steganography detection methods based on Co-occurrence Matrix Analysis

Country Status (1)

Country Link
CN (1) CN104637484B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105913856A (en) * 2016-04-20 2016-08-31 深圳大学 Audio tampering detection method and system based on amplitude co-occurrence vector characteristics
CN109065074A (en) * 2018-09-25 2018-12-21 河南理工大学 A kind of baby's speech sound translater
CN109272987A (en) * 2018-09-25 2019-01-25 河南理工大学 A kind of sound identification method sorting coal and spoil
CN110390941A (en) * 2019-07-01 2019-10-29 清华大学 MP3 audio hidden information analysis method and device based on coefficient correlation model

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20070107875A (en) * 2006-05-04 2007-11-08 고려대학교 산학협력단 Method for synchronized encryption and decryption of audio and apparatus thereof
CN101206861A (en) * 2007-12-25 2008-06-25 宁波大学 Method for imbedding digital music production authentication information and method for authentication of said production
CN101211562A (en) * 2007-12-25 2008-07-02 宁波大学 Digital music works damage-free digital watermarking embedding and extraction method
CN102097098A (en) * 2011-02-25 2011-06-15 宁波大学 Digital steganography and digital extraction methods with compressed audio as masking carrier
CN102930495A (en) * 2012-10-16 2013-02-13 中国科学院信息工程研究所 Steganography evaluation based steganalysis method
CN103034853A (en) * 2013-01-08 2013-04-10 武汉大学 Universal steganalysis method for JPEG images
CN103106901A (en) * 2013-01-22 2013-05-15 宁波大学 Audio digital steganography and extraction method in compressed domain based on index values
CN103236265A (en) * 2013-04-08 2013-08-07 宁波大学 MP3Stegz steganography detecting method
CN103366753A (en) * 2013-06-28 2013-10-23 宁波大学 Moving picture experts group audio layer-3 (MP3) audio double-compression detection method under same code rate
US20140039890A1 (en) * 2011-04-28 2014-02-06 Dolby International Ab Efficient content classification and loudness estimation
CN104282310A (en) * 2014-09-26 2015-01-14 宁波大学 Steganography detection method for audio subjected to MP3Stego steganography

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20070107875A (en) * 2006-05-04 2007-11-08 고려대학교 산학협력단 Method for synchronized encryption and decryption of audio and apparatus thereof
CN101206861A (en) * 2007-12-25 2008-06-25 宁波大学 Method for imbedding digital music production authentication information and method for authentication of said production
CN101211562A (en) * 2007-12-25 2008-07-02 宁波大学 Digital music works damage-free digital watermarking embedding and extraction method
CN102097098A (en) * 2011-02-25 2011-06-15 宁波大学 Digital steganography and digital extraction methods with compressed audio as masking carrier
US20140039890A1 (en) * 2011-04-28 2014-02-06 Dolby International Ab Efficient content classification and loudness estimation
CN102930495A (en) * 2012-10-16 2013-02-13 中国科学院信息工程研究所 Steganography evaluation based steganalysis method
CN103034853A (en) * 2013-01-08 2013-04-10 武汉大学 Universal steganalysis method for JPEG images
CN103106901A (en) * 2013-01-22 2013-05-15 宁波大学 Audio digital steganography and extraction method in compressed domain based on index values
CN103236265A (en) * 2013-04-08 2013-08-07 宁波大学 MP3Stegz steganography detecting method
CN103366753A (en) * 2013-06-28 2013-10-23 宁波大学 Moving picture experts group audio layer-3 (MP3) audio double-compression detection method under same code rate
CN104282310A (en) * 2014-09-26 2015-01-14 宁波大学 Steganography detection method for audio subjected to MP3Stego steganography

Non-Patent Citations (8)

* Cited by examiner, † Cited by third party
Title
CHAO JIN ET AL: ""A NOVEL DETECTION SCHEME FOR MP3STEGO WITH LOW PAYLOAD"", 《IEEE》 *
MENGYU QIAO ET AL: ""MP3 audio steganalysis"", 《INFORMATION SCIENCES》 *
QI YINCHEN ET AL: ""Audio Steganalysis Based on Co-occurrence Matrix and PCA"", 《2009 INTERNATIONAL CONFERENCE ON MEASURING TECHNOLOGY AND MECHATRONICS AUTOMATION》 *
S.GEETHA ET AL: ""Evolving decision tree rule based system for audio stego anomalies detection based on Hausdorff distance statistics"", 《INFORMATION SCIENCE》 *
YAWAI TINT ET AL: ""Steganalysis for MP3Stego using independent component analysis"", 《WIT TRANSACTIONS ON INFORMATION AND COMMUNICATION TECHNOLOGIES》 *
吴福宝 等: ""改进的Markov和联合密度特征的MP3隐写分析方法"", 《计算机工程与应用》 *
宋华 等: ""MP3Stego 信息隐藏与检测方法研究"", 《中山大学学报(自然科学版)》 *
羊开云 等: ""MP3Stego 嵌入密文长度估计研究"", 《第十一届全国信息隐藏暨多媒体信息安全学术大会论文集》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105913856A (en) * 2016-04-20 2016-08-31 深圳大学 Audio tampering detection method and system based on amplitude co-occurrence vector characteristics
CN109065074A (en) * 2018-09-25 2018-12-21 河南理工大学 A kind of baby's speech sound translater
CN109272987A (en) * 2018-09-25 2019-01-25 河南理工大学 A kind of sound identification method sorting coal and spoil
CN110390941A (en) * 2019-07-01 2019-10-29 清华大学 MP3 audio hidden information analysis method and device based on coefficient correlation model

Also Published As

Publication number Publication date
CN104637484B (en) 2017-09-29

Similar Documents

Publication Publication Date Title
Meghanathan et al. Steganalysis algorithms for detecting the hidden information in image, audio and video cover media
Fan et al. Chaos-based discrete fractional Sine transform domain audio watermarking scheme
Yang et al. Effective electrocardiogram steganography based on coefficient alignment
US9147223B2 (en) Method and device for localized blind watermark generation and detection
Yamni et al. Efficient watermarking algorithm for digital audio/speech signal
CN102157154B (en) Audio-content-based non-uniform discrete cosine transform audio reliability authentication method
Chowdhuri et al. Secured steganographic scheme for highly compressed color image using weighted matrix through DCT
CN104282310B (en) Steganography detection method for audio subjected to MP3Stego steganography
CN104637484B (en) A kind of MP3 audio steganography detection methods based on Co-occurrence Matrix Analysis
Dhar et al. Audio watermarking in transform domain based on singular value decomposition and Cartesian-polar transformation
CN108682425B (en) Robust digital audio watermark embedding system based on constant watermark
JP2006217340A5 (en)
Kumsawat A genetic algorithm optimization technique for multiwavelet-based digital audio watermarking
Yamni et al. Robust audio watermarking scheme based on fractional Charlier moment transform and dual tree complex wavelet transform
Yassine et al. A secure and high robust audio watermarking system for copyright protection
Dhar A blind audio watermarking method based on lifting wavelet transform and QR decomposition
CN102208096B (en) Image tamper detection and tamper localization method based on discrete wavelet transformation
CN102664014B (en) Blind audio watermark implementing method based on logarithmic quantization index modulation
Megías et al. A robust audio watermarking scheme based on MPEG 1 layer 3 compression
Tang et al. Dual watermarking algorithm based on the Fractional Fourier Transform
CN113506580A (en) Audio watermarking method and system capable of resisting random cutting and dubbing
Dhar et al. An SVD-based audio watermarking using variable embedding strength and exponential-log operations
CN101452564B (en) Improved method for jitter quantisation and watermark modulation
Amirtharajan et al. Info Hide–A Cluster Cover Approach
Su et al. Window switching strategy based semi-fragile watermarking for MP3 tamper detection

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20240222

Address after: 230000 floor 1, building 2, phase I, e-commerce Park, Jinggang Road, Shushan Economic Development Zone, Hefei City, Anhui Province

Patentee after: Dragon totem Technology (Hefei) Co.,Ltd.

Country or region after: China

Address before: 315211, Fenghua Road, Jiangbei District, Zhejiang, Ningbo 818

Patentee before: Ningbo University

Country or region before: China

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20240227

Address after: 414000 Dormitory of Yayuan Neighborhood Committee, Qianlianghu Town, Junshan District, Yueyang City, Hunan Province

Patentee after: Yong Ming

Country or region after: China

Address before: 230000 floor 1, building 2, phase I, e-commerce Park, Jinggang Road, Shushan Economic Development Zone, Hefei City, Anhui Province

Patentee before: Dragon totem Technology (Hefei) Co.,Ltd.

Country or region before: China

TR01 Transfer of patent right