{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T01:22:53Z","timestamp":1768094573963,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T00:00:00Z","timestamp":1660176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T00:00:00Z","timestamp":1660176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s11063-022-10992-6","type":"journal-article","created":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T10:04:02Z","timestamp":1660212242000},"page":"2953-2964","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Deep Clustering Network for Steganographer Detection Using Latent Features Extracted from a Novel Convolutional Autoencoder"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2763-958X","authenticated-orcid":false,"given":"E.","family":"Amrutha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Arivazhagan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. Sylvia Lilly","family":"Jebarani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,11]]},"reference":[{"key":"10992_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74124-4_18","volume-title":"Information hiding. Information hiding. IH 2006. Lecture notes in computer science","author":"AD Ker","year":"2007","unstructured":"Ker AD (2007) Batch steganography and pooled steganalysis. In: Camenisch JL, Collberg CS, Johnson NF, Sallee P (eds) Information hiding. IH 2006. Lecture notes in computer science, vol 4437. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-74124-4_18","edition":"4437"},{"key":"10992_CR2","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1109\/TIFS.2008.2002936","volume":"3","author":"T Pevny","year":"2008","unstructured":"Pevny T, Fridrich J (2008) Multiclass detector of current steganographic methods for JPEG format. IEEE Trans Inform Forensic Secur 3:635\u2013650. https:\/\/doi.org\/10.1109\/TIFS.2008.2002936","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"10992_CR3","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/TIFS.2014.2336380","volume":"9","author":"AD Ker","year":"2014","unstructured":"Ker AD, Pevny T (2014) The Steganographer is the Outlier: Realistic Large-Scale Steganalysis. IEEE Trans Inform Forensic Secur 9:1424\u20131435. https:\/\/doi.org\/10.1109\/TIFS.2014.2336380","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"10992_CR4","doi-asserted-by":"crossref","unstructured":"Zheng M, Zhong S, Wu S, Jiang J (2017) Steganographer detection via deep residual network. In: 2017 IEEE international conference on multimedia and expo (ICME). IEEE, Hong Kong, pp 235\u2013240","DOI":"10.1109\/ICME.2017.8019320"},{"key":"10992_CR5","doi-asserted-by":"crossref","unstructured":"Zheng M, Zhong S, Wu S, Jiang J (2018) Steganographer detection based on multiclass dilated residual networks. In: Proceedings of the 2018 ACM on international conference on multimedia retrieval. ACM, Yokohama Japan, pp 300\u2013308","DOI":"10.1145\/3206025.3206031"},{"key":"10992_CR6","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.neucom.2019.07.068","volume":"365","author":"M Zheng","year":"2019","unstructured":"Zheng M, Jiang J, Wu S et al (2019) Content-adaptive selective steganographer detection via embedding probability estimation deep networks. Neurocomputing 365:336\u2013348. https:\/\/doi.org\/10.1016\/j.neucom.2019.07.068","journal-title":"Neurocomputing"},{"key":"10992_CR7","doi-asserted-by":"crossref","unstructured":"Zhang Z, Zheng M, Zhong S, Liu Y (2020) Steganographer detection via enhancement-aware graph convolutional network. In: 2020 IEEE international conference on multimedia and expo (ICME). IEEE, London, United Kingdom, pp 1\u20136","DOI":"10.1109\/ICME46284.2020.9102817"},{"key":"10992_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.neunet.2020.12.026","volume":"136","author":"Z Zhang","year":"2021","unstructured":"Zhang Z, Zheng M, Zhong S, Liu Y (2021) Steganographer detection via a similarity accumulation graph convolutional network. Neural Netw 136:97\u2013111. https:\/\/doi.org\/10.1016\/j.neunet.2020.12.026","journal-title":"Neural Netw"},{"key":"10992_CR9","volume-title":"Neural Information Processing. ICONIP 2017. Lecture Notes in Computer Science","author":"X Guo","year":"2017","unstructured":"Guo X, Liu X, Zhu E, Yin J (2017) Deep clustering with convolutional autoencoders. In: Liu D, Xie S, Li Y, Zhao D, El-Alfy ES (eds) Neural Information Processing. ICONIP 2017. Lecture Notes in Computer Science, vol 10635. Springer, Cham"},{"key":"10992_CR10","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2712793","author":"W Luo","year":"2017","unstructured":"Luo W, Li J, Yang J et al (2017) Convolutional sparse autoencoders for image classification. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2017.2712793","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"10992_CR11","unstructured":"D\u00e9fossez A, Bottou L, Bach F, Usunier N (2020) A Simple Convergence Proof of Adam and Adagrad. http:\/\/arxiv.org\/abs\/2003.02395 [cs, stat]"},{"key":"10992_CR12","unstructured":"Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding, SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp 1027\u20131035"},{"key":"10992_CR13","doi-asserted-by":"publisher","unstructured":"Gretton A, Borgwardt KM, Rasch M et al (2006) A Kernel Method for the Two-Sample-Problem. In: Proceedings of the advances in neural information processing systems conference. https:\/\/doi.org\/10.7551\/mitpress\/7503.001.0001","DOI":"10.7551\/mitpress\/7503.001.0001"},{"key":"10992_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-24178-9_5","volume-title":"Information hiding","author":"P Bas","year":"2011","unstructured":"Bas P, Filler T, Pevn\u00fd T (2011) \u201dBreak Our Steganographic System\u201d: The Ins and Outs of Organizing BOSS. In: Filler T, Pevn\u00fd T, Craver S, Ker A (eds) Information hiding. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 59\u201370"},{"key":"10992_CR15","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1109\/TIFS.2010.2077629","volume":"5","author":"T Filler","year":"2010","unstructured":"Filler T, Fridrich J (2010) Gibbs construction in steganography. IEEE Trans Inform Forensic Secur 5:705\u2013720. https:\/\/doi.org\/10.1109\/TIFS.2010.2077629","journal-title":"IEEE Trans Inform Forensic Secur"},{"key":"10992_CR16","doi-asserted-by":"crossref","unstructured":"Holub V, Fridrich J (2012) Designing steganographic distortion using directional filters. In: 2012 IEEE international workshop on information forensics and security (WIFS). IEEE, Costa Adeje\u2014Tenerife, Spain, pp 234\u2013239","DOI":"10.1109\/WIFS.2012.6412655"},{"key":"10992_CR17","doi-asserted-by":"crossref","unstructured":"Holub V, Fridrich J (2013) Digital image steganography using universal distortion. In: Proceedings of the first ACM workshop on Information hiding and multimedia security\u2014IH&MMSec \u201913. ACM Press, Montpellier, France, p 59","DOI":"10.1145\/2482513.2482514"},{"key":"10992_CR18","doi-asserted-by":"publisher","first-page":"6","DOI":"10.3390\/a14010006","volume":"14","author":"J H\u00e4m\u00e4l\u00e4inen","year":"2020","unstructured":"H\u00e4m\u00e4l\u00e4inen J, K\u00e4rkk\u00e4inen T, Rossi T (2020) Improving scalable K-means++. Algorithms 14:6. https:\/\/doi.org\/10.3390\/a14010006","journal-title":"Algorithms"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-022-10992-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11063-022-10992-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-022-10992-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T12:09:53Z","timestamp":1688818193000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11063-022-10992-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,11]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["10992"],"URL":"https:\/\/doi.org\/10.1007\/s11063-022-10992-6","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"value":"1370-4621","type":"print"},{"value":"1573-773X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,11]]},"assertion":[{"value":"28 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}