{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:43:03Z","timestamp":1771612983815,"version":"3.50.1"},"reference-count":39,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T00:00:00Z","timestamp":1632182400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2021,9,21]]},"abstract":"<jats:p>Traditional machine learning-based steganalysis methods on compressed speech have achieved great success in the field of communication security. However, previous studies lacked mathematical modeling of the correlation between codewords, and there is still room for improvement in steganalysis for small-sized and low embedding rate samples. To deal with the challenge, we use Bayesian networks to measure different types of correlations between codewords in linear prediction code and present F3SNet\u2014a four-step strategy: embedding, encoding, attention, and classification for quantization index modulation steganalysis of compressed speech based on the hierarchical attention network. Among them, embedding converts codewords into high-density numerical vectors, encoding uses the memory characteristics of LSTM to retain more information by distributing it among all its vectors, and attention further determines which vectors have a greater impact on the final classification result. To evaluate the performance of F3SNet, we make a comprehensive comparison of F3SNet with existing steganography methods. Experimental results show that F3SNet surpasses the state-of-the-art methods, particularly for small-sized and low embedding rate samples.<\/jats:p>","DOI":"10.1155\/2021\/1627486","type":"journal-article","created":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T22:23:12Z","timestamp":1632349392000},"page":"1-15","source":"Crossref","is-referenced-by-count":2,"title":["F3SNet: A Four-Step Strategy for QIM Steganalysis of Compressed Speech Based on Hierarchical Attention Network"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6926-6259","authenticated-orcid":true,"given":"Chuanpeng","family":"Guo","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0332-2649","authenticated-orcid":true,"given":"Wei","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1911-5361","authenticated-orcid":true,"given":"Mengxia","family":"Shuai","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, University of Science and Technology of China, Hefei 230026, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8417-3256","authenticated-orcid":true,"given":"Liusheng","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/2543581.2543587"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/2566590.2566610"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1049\/iet-spr.2016.0651"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/glocom.2008.ecp.375"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-015-0315-6"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-016-3257-x"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/icassp.2008.4518532"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2012.05.003"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/compcomm.2016.7925046"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2012.2218599"},{"key":"11","first-page":"275","article-title":"Pitch delay based adaptive steganography for amr speech stream","author":"C. Gong"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1631\/jzus.c1100374"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/taslp.2017.2676356"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43886-2_5"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2015.2421322"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2009.2024718"},{"issue":"10","key":"17","first-page":"2107","article-title":"Detection of pitch modulation information hiding based on codebook correlation network","volume":"37","author":"S.-B. Li","year":"2014","journal-title":"Chinese Journal of Computers"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2882088"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2016.11.013"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2018.2806741"},{"key":"21","first-page":"5998","article-title":"Attention is all you need","author":"A. Vaswani"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054361"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/WICOM.2010.5600125"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2010.0348"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2020.3026868"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2005.858377"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2019.2920605"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.3724\/sp.j.1016.2013.01168"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.12.044"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1117\/12.2083479"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2548421"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1145\/2909827.2930798"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2710946"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1007\/s10772-016-9352-6"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1145\/3082031.3083234"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1145\/3335203.3335708"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-41579-2_45"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1109\/18.923725"},{"key":"39","unstructured":"Ebert-UphoffI.Measuring connection strengths and link strengths in discrete bayesian networks2007Atlanta, GeorgiaGeorgia Institute of TechnologyTech. rep."}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/1627486.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/1627486.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/1627486.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T22:23:16Z","timestamp":1632349396000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2021\/1627486\/"}},"subtitle":[],"editor":[{"given":"Beijing","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,9,21]]},"references-count":39,"alternative-id":["1627486","1627486"],"URL":"https:\/\/doi.org\/10.1155\/2021\/1627486","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"value":"1939-0122","type":"electronic"},{"value":"1939-0114","type":"print"}],"subject":[],"published":{"date-parts":[[2021,9,21]]}}}