{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T05:24:13Z","timestamp":1782624253201,"version":"3.54.5"},"reference-count":54,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,2,5]],"date-time":"2021-02-05T00:00:00Z","timestamp":1612483200000},"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,2,5]]},"abstract":"<jats:p>LSB matching revisited is an LSB-based approach for image steganography. This method is a type of coding to increase the capacity of steganography. In this method, two bits of the secret message are hidden in two pixels with only one change. But this method provides no idea for hiding a message with a large number of bits. In other words, this method works only for <jats:inline-formula>\n                     <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                        <a:mi>n<\/a:mi>\n                        <a:mo>=<\/a:mo>\n                        <a:mn>2<\/a:mn>\n                     <\/a:math>\n                  <\/jats:inline-formula>, where <jats:inline-formula>\n                     <c:math xmlns:c=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\">\n                        <c:mi>n<\/c:mi>\n                     <\/c:math>\n                  <\/jats:inline-formula> is the number of bits in a block of the secret message. In this paper, we propose an improved version of the LSB matching revisited approach, which works for <jats:inline-formula>\n                     <e:math xmlns:e=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\">\n                        <e:mi>n<\/e:mi>\n                        <e:mo>&gt;<\/e:mo>\n                        <e:mn>2<\/e:mn>\n                     <\/e:math>\n                  <\/jats:inline-formula>. The proposed scheme contains two phases including embedding and extracting the message. In the embedding phase, we first convert the secret message into a bit-stream, and then the bit-stream is divided into a set of blocks including <jats:inline-formula>\n                     <g:math xmlns:g=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M4\">\n                        <g:mi>n<\/g:mi>\n                     <\/g:math>\n                  <\/jats:inline-formula> bits in each block. Then we choose <jats:inline-formula>\n                     <i:math xmlns:i=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M5\">\n                        <i:msup>\n                           <i:mrow>\n                              <i:mn>2<\/i:mn>\n                           <\/i:mrow>\n                           <i:mrow>\n                              <i:mi>n<\/i:mi>\n                              <i:mo>\u2212<\/i:mo>\n                              <i:mn>1<\/i:mn>\n                           <\/i:mrow>\n                        <\/i:msup>\n                     <\/i:math>\n                  <\/jats:inline-formula> pixels for hiding such <jats:inline-formula>\n                     <k:math xmlns:k=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M6\">\n                        <k:mi>n<\/k:mi>\n                     <\/k:math>\n                  <\/jats:inline-formula> bits of the secret message. In the next step, we choose the operations needed to generate such a message. Finally, we perform the obtained operations over the coefficients to hide the secret message. The proposed approach needs fewer changes than LSB MR when <jats:inline-formula>\n                     <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M7\">\n                        <m:mi>n<\/m:mi>\n                        <m:mo>&gt;<\/m:mo>\n                        <m:mn>2<\/m:mn>\n                     <\/m:math>\n                  <\/jats:inline-formula>. The capacity of the proposed approach is <jats:inline-formula>\n                     <o:math xmlns:o=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M8\">\n                        <o:mfenced open=\"(\" close=\")\" separators=\"|\">\n                           <o:mrow>\n                              <o:mfenced open=\"(\" close=\")\" separators=\"|\">\n                                 <o:mrow>\n                                    <o:mfenced open=\"(\" close=\")\" separators=\"|\">\n                                       <o:mrow>\n                                          <o:msup>\n                                             <o:mrow>\n                                                <o:mn>2<\/o:mn>\n                                             <\/o:mrow>\n                                             <o:mrow>\n                                                <o:mi>n<\/o:mi>\n                                             <\/o:mrow>\n                                          <\/o:msup>\n                                          <o:mo>\u2212<\/o:mo>\n                                          <o:mn>1<\/o:mn>\n                                       <\/o:mrow>\n                                    <\/o:mfenced>\n                                    <o:mo>\/<\/o:mo>\n                                    <o:mrow>\n                                       <o:msup>\n                                          <o:mrow>\n                                             <o:mn>2<\/o:mn>\n                                          <\/o:mrow>\n                                          <o:mrow>\n                                             <o:mi>n<\/o:mi>\n                                             <o:mo>\u2212<\/o:mo>\n                                             <o:mn>1<\/o:mn>\n                                          <\/o:mrow>\n                                       <\/o:msup>\n                                    <\/o:mrow>\n                                 <\/o:mrow>\n                              <\/o:mfenced>\n                              <o:mo>\u2212<\/o:mo>\n                              <o:mn>1<\/o:mn>\n                           <\/o:mrow>\n                        <\/o:mfenced>\n                        <o:mo>\u00d7<\/o:mo>\n                        <o:mn>100<\/o:mn>\n                        <o:mo>%<\/o:mo>\n                     <\/o:math>\n                  <\/jats:inline-formula> higher than the F5 method where this value for <jats:inline-formula>\n                     <z:math xmlns:z=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M9\">\n                        <z:mi>n<\/z:mi>\n                        <z:mo>&gt;<\/z:mo>\n                        <z:mn>2<\/z:mn>\n                     <\/z:math>\n                  <\/jats:inline-formula> is bigger than 75%. For example, the capacity of our scheme is 75% higher than the capacity of F5 for <jats:inline-formula>\n                     <bb:math xmlns:bb=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M10\">\n                        <bb:mi>n<\/bb:mi>\n                        <bb:mo>=<\/bb:mo>\n                        <bb:mn>3<\/bb:mn>\n                     <\/bb:math>\n                  <\/jats:inline-formula>. The proposed method can be used in the first step of every steganography method to reduce the change in the stego image. Therefore, this method is a new coding method for steganography. Our experimental results using steganalysis show that using our method provides around 10% higher detection error for SRNet over two steganography schemes.<\/jats:p>","DOI":"10.1155\/2021\/6610678","type":"journal-article","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T01:59:06Z","timestamp":1612835946000},"page":"1-15","source":"Crossref","is-referenced-by-count":42,"title":["A New Method of Coding for Steganography Based on LSB Matching Revisited"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2133-3480","authenticated-orcid":true,"given":"Mansoor","family":"Fateh","sequence":"first","affiliation":[{"name":"Faculty of Computer Engineering, Shahrood University of Technology, Shahroud, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1172-1941","authenticated-orcid":true,"given":"Mohsen","family":"Rezvani","sequence":"additional","affiliation":[{"name":"Faculty of Computer Engineering, Shahrood University of Technology, Shahroud, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9870-8423","authenticated-orcid":true,"given":"Yasser","family":"Irani","sequence":"additional","affiliation":[{"name":"Faculty of Computer Engineering, Shahrood University of Technology, Shahroud, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/s00034-013-9703-3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.07.245"},{"key":"3","first-page":"1","article-title":"A high capacity geometrical domain based 3D image steganography scheme","author":"S. L. Farrag"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.5120\/19941-1731"},{"key":"5","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1016\/j.future.2016.11.029","article-title":"Image steganography using uncorrelated color space and its application for security of visual contents in online social networks","volume":"86","author":"M. Khan","year":"2018","journal-title":"Future Generation Computer Systems"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/49.668971"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/msecp.2003.1203220"},{"issue":"5","key":"8","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1007\/s00500-017-2944-5","article-title":"An adaptive hybrid fuzzy-wavelet approach for image steganography using bit reduction and pixel adjustment","volume":"22","author":"I. Hafi","year":"2018","journal-title":"Soft Computing"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1080\/1206212x.2018.1517713"},{"key":"10","unstructured":"DeviK. J.A secure image steganography using lsb technique and pseudo random encoding technique2013Rourkela, IndiaDepartment of Computer Science and Engineering, National Institute of TechnologyPh.D. thesis"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2018.03.012"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.4304\/jmm.5.5.458-463"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.2478\/cait-2018-0029"},{"key":"14","doi-asserted-by":"crossref","article-title":"A DWT based approach for steganography using biometrics","author":"A. A. Shejul","DOI":"10.1109\/DSDE.2010.10"},{"key":"15","first-page":"309","article-title":"Evaluating image steganography techniques: future research challenges","author":"R. Roy"},{"key":"16","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/3-540-45496-9_21","article-title":"F5\u2014a steganographic algorithm","volume-title":"Information Hiding","author":"A. Westfeld","year":"2001"},{"key":"17","first-page":"1","article-title":"Research on an steganographic algorithm based on image edge","author":"G. Chen"},{"key":"18","article-title":"An overview of image steganography","author":"T. Morkel"},{"key":"19","first-page":"1","article-title":"Pixel indicator high capacity technique for RGB image based steganography","author":"K. Raja"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2003.08.007"},{"key":"21","first-page":"154","article-title":"Model-based steganography","author":"P. Sallee"},{"key":"22","doi-asserted-by":"crossref","first-page":"18815","DOI":"10.1007\/s11042-020-08745-5","article-title":"Adaptive PVD and LSB based high capacity data hiding scheme","volume":"79","author":"S. Singh","year":"2020","journal-title":"Multimedia Tools and Applications"},{"key":"23","first-page":"377","article-title":"Secure key based image realization steganography","author":"S. Samima"},{"key":"24","first-page":"218","article-title":"Image realization steganography with LCS based mapping","author":"R. Roy"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/s0167-8655(02)00402-6"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1049\/ip-vis:20059022"},{"key":"27","first-page":"170","article-title":"A secure image steganography using LSB, DCT and compression techniques on raw images","author":"K. Raja"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2017.04.004"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-018-6584-2"},{"key":"30","doi-asserted-by":"crossref","first-page":"7951","DOI":"10.1007\/s11042-019-08427-x","article-title":"Hiding shares by multimedia image steganography for optimized counting-based secret sharing","volume":"79","author":"A. Gutub","year":"2020","journal-title":"Multimedia Tools and Applications"},{"key":"31","first-page":"1","article-title":"A comprehensive study of reversible data hiding (RDH) schemes based on pixel value ordering (PVO)","author":"G. Kaur","year":"2020","journal-title":"Archives of Computational Methods in Engineering"},{"key":"32","first-page":"727","article-title":"A high capacity reversible data hiding technique based on pixel value ordering using interlock partitioning","author":"G. Kaur"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-019-7640-2"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.05.174"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-015-2937-2"},{"key":"36","first-page":"903","article-title":"Human visual system based enhanced ambtc for color image compression using interpolation","author":"R. Kumar"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1504\/ijesdf.2019.102567"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1007\/s13319-018-0188-5"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1007\/s13319-018-0211-x"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.22266\/ijies2019.1031.07"},{"key":"41","first-page":"1","article-title":"The rise of steganography","author":"A. Siper"},{"issue":"1","key":"42","first-page":"1","article-title":"Comprehensive survey of 3D image steganography techniques","volume":"12","author":"G. Ashish","year":"2017","journal-title":"IET Image Processing"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1109\/lsp.2006.870357"},{"key":"44","first-page":"19","article-title":"Improved algorithm of edge adaptive image steganography based on LSB matching revisited algorithm","author":"F. Huang"},{"key":"45","first-page":"175","article-title":"Protect fragile regions in steganography LSB embedding","author":"Q. Huang"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2010.2051426"},{"issue":"1","key":"47","doi-asserted-by":"crossref","first-page":"259","DOI":"10.18576\/amis\/100126","article-title":"High capacity image steganography technique based on LSB substitution method","volume":"10","author":"M. H. Mohamed","year":"2016","journal-title":"Applied Mathematics & Information Sciences"},{"key":"48","first-page":"97","article-title":"Improved detection of LSB steganography in grayscale images","author":"A. D. Ker"},{"key":"49","first-page":"1","article-title":"PSNR vs SSIM: imperceptibility quality assessment for image steganography","author":"D. R. I. M. Setiadi","year":"2020","journal-title":"Multimedia Tools and Applications"},{"key":"50","first-page":"4206","article-title":"A new cost function for spatial image steganography","author":"B. Li"},{"issue":"1","key":"51","doi-asserted-by":"crossref","DOI":"10.1186\/1687-417X-2014-1","article-title":"Universal distortion function for steganography in an arbitrary domain","volume":"2014","author":"V. Holub","year":"2014","journal-title":"EURASIP Journal on Information Security"},{"issue":"5","key":"52","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1109\/TIFS.2018.2871749","article-title":"Deep residual network for steganalysis of digital images","volume":"14","author":"M. Boroumand","year":"2018","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"53","first-page":"59","article-title":"Break our steganographic system: the ins and outs of organizing BOSS","author":"P. Bas"},{"key":"54","first-page":"39","article-title":"ROC curves for steganalysts","author":"A. Westfeld"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/6610678.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/6610678.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/6610678.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T01:59:30Z","timestamp":1612835970000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2021\/6610678\/"}},"subtitle":[],"editor":[{"given":"Benjamin","family":"Aziz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2021,2,5]]},"references-count":54,"alternative-id":["6610678","6610678"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6610678","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"value":"1939-0122","type":"electronic"},{"value":"1939-0114","type":"print"}],"subject":[],"published":{"date-parts":[[2021,2,5]]}}}