Abstract | ||
---|---|---|
Recently the research on steganalysis for breaking HUGO has been further moved ahead. A novel mapping scheme is reported in this paper. Through a Huffman coding like procedure, this scheme can lower the feature dimensionality from 625 to 120 generated from one residual image as a 4th order co-occurrence matrix is considered. Two experiments have been reported to demonstrate its effectiveness. In breaking the HUGO, the proposed mapping scheme has been applied to the frame work of the state-of-the-art [13] with some minor modification. With a total number of 15,840 features the new method can achieve 87.17% accuracy in BOSSbase ver. 0.92 at 0.4 bpp, outperforming the state-of-the-art. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/978-3-642-40099-5_3 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Keywords | Field | DocType |
bossbase ver,frame work,feature dimensionality,huffman coding,proposed mapping scheme,novel mapping scheme,order co-occurrence matrix,new method,minor modification,residual image | Steganography,Markov process,Co-occurrence matrix,Matrix (mathematics),Computer science,Local binary patterns,Algorithm,Curse of dimensionality,Huffman coding,Steganalysis | Conference |
Volume | Issue | ISSN |
7809 LNCS | null | 16113349 |
Citations | PageRank | References |
11 | 0.62 | 17 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Licong Chen | 1 | 43 | 2.99 |
Yun Q. Shi | 2 | 2918 | 199.53 |
Patchara Sutthiwan | 3 | 101 | 6.50 |
Xinxin Niu | 4 | 211 | 33.93 |