{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:17:00Z","timestamp":1740147420594,"version":"3.37.3"},"reference-count":16,"publisher":"Wiley","license":[{"start":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T00:00:00Z","timestamp":1530748800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572182","61370225","15JJ2007"],"award-info":[{"award-number":["61572182","61370225","15JJ2007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572182","61370225","15JJ2007"],"award-info":[{"award-number":["61572182","61370225","15JJ2007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["61572182","61370225","15JJ2007"],"award-info":[{"award-number":["61572182","61370225","15JJ2007"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Advances in Multimedia"],"published-print":{"date-parts":[[2018,7,5]]},"abstract":"<jats:p>Pixel pair matching (PPM) is widely used in digital image steganography. As an important derivation, adaptive pixel pair matching method (APPM) offers low distortion and allows embedded digits in any notational system. However, APPM needs additional space to store, calculate, and query neighborhood set, which needs extra cost. To solve these problems, a formula adaptive pixel pair matching (FAPPM) method is proposed in this paper. The basic idea of FAPPM is to use the formula to get the stego image pixel pair without searching the neighborhood set for the given image pixel pair. This will allow users to embed secret message directly without storing and searching the look-up table. Experimental results and analysis show that the proposed method could embed secret data directly without searching the neighborhood sets by using a formula and it still maintains flexibility in the selection of notional system, high image quality, and strong anti-steganalysis ability.<\/jats:p>","DOI":"10.1155\/2018\/7682098","type":"journal-article","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T19:35:07Z","timestamp":1530819307000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["A Formula Adaptive Pixel Pair Matching Steganography Algorithm"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1229-2317","authenticated-orcid":true,"given":"Min","family":"Long","sequence":"first","affiliation":[{"name":"College of Computer and Communication Engineering, Changsha University of Science and Technology, 410114, China"},{"name":"Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha University of Science and Technology, Changsha, Hunan Province 410114, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fenfang","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer and Communication Engineering, Changsha University of Science and Technology, 410114, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"year":"2009","key":"1"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2009.08.010"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2018.03.012"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/msecp.2003.1203220"},{"journal-title":"The Workshop on Multimedia & Security: New Challenges ACM","first-page":"22","year":"2002","key":"5"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2005.847889"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2003.08.007"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-012-1114-0"},{"issue":"5","key":"12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.14257\/ijsia.2015.9.5.24","volume":"9","year":"2015","journal-title":"International Journal of Security and Its Applications"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2155062"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2006.870357"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2006.060863"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1186\/1687-417X-2009-658047"},{"issue":"6","key":"13","first-page":"1167","volume":"6","year":"2015","journal-title":"Journal of Information Hiding and Multimedia Signal Processing"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-017-4899-z"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-009-0380-y"}],"container-title":["Advances in Multimedia"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/am\/2018\/7682098.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/am\/2018\/7682098.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/am\/2018\/7682098.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T19:35:15Z","timestamp":1530819315000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/am\/2018\/7682098\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,5]]},"references-count":16,"alternative-id":["7682098","7682098"],"URL":"https:\/\/doi.org\/10.1155\/2018\/7682098","relation":{},"ISSN":["1687-5680","1687-5699"],"issn-type":[{"type":"print","value":"1687-5680"},{"type":"electronic","value":"1687-5699"}],"subject":[],"published":{"date-parts":[[2018,7,5]]}}}