<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">IASC</journal-id>
<journal-id journal-id-type="nlm-ta">IASC</journal-id>
<journal-id journal-id-type="publisher-id">IASC</journal-id>
<journal-title-group>
<journal-title>Intelligent Automation &#x0026; Soft Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2326-005X</issn><issn pub-type="ppub">1079-8587</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">14773</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2021.014773</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Image Steganography in Spatial Domain: Current Status, Techniques, and Trends</article-title><alt-title alt-title-type="left-running-head">Image Steganography in Spatial Domain: Current Status, Techniques, and Trends</alt-title><alt-title alt-title-type="right-running-head">Image Steganography in Spatial Domain: Current Status, Techniques, and Trends</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western">
<surname>Alhomoud</surname>
<given-names>Adeeb M.</given-names>
</name>
<email>a.alhomoud@seu.edu.sa</email>
</contrib><aff><institution>Department of Basic Sciences, College of Science and Theoretical Studies, Saudi Electronic University</institution>, <addr-line>Riyadh, 11673</addr-line>, <country>Saudi Arabia</country></aff>
</contrib-group><author-notes><corresp id="cor1">&#x002A;Corresponding Author: Adeeb M. Alhomoud. Email: <email>a.alhomoud@seu.edu.sa</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2021-01-04">
<day>4</day>
<month>1</month>
<year>2021</year>
</pub-date>
<volume>27</volume>
<issue>1</issue>
<fpage>69</fpage>
<lpage>88</lpage>
<history>
<date date-type="received">
<day>15</day>
<month>10</month>
<year>2020</year>
</date>
<date date-type="accepted">
<day>01</day>
<month>11</month>
<year>2020</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2021 Alhomoud</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Alhomoud</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_IASC_14773.pdf"></self-uri>
<abstract>
<p>This research article provides an up-to-date review of spatial-domain steganography. Maintaining the communication as secure as possible when transmitting secret data through any available communication channels is the target of steganography. Currently, image steganography is the most developed field, with several techniques are provided for different image formats. Therefore, the general image steganography including the fundamental concepts, the terminology, and the applications are highlighted in this paper. Further, the paper depicts the essential characteristics between information hiding and cryptography systems. In addition, recent well-known techniques in the spatial-domain steganography, such as LSB and pixel value differencing, are discussed in detail and several comparisons are provided to show the merits and the demerits of the discussed techniques. Furthermore, to aid the steganography researchers in developing efficient spatial-domain embedding techniques, the future research of the spatial-domain steganography is discussed and a set of recommendations are suggested.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Information hiding</kwd>
<kwd>steganography</kwd>
<kwd>spatial-domain steganography</kwd>
<kwd>stego-image</kwd>
<kwd>adaptive embedding</kwd>
<kwd>steganalysis</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Steganography is a word that is derived from the Greek word, namely, &#x201C;Stegos&#x201D;, which refers to the word &#x201C;cover&#x201D;, and the word &#x201C;Grafia&#x201D; refers to the word &#x201C;writing&#x201D;, which is defined as &#x201C;covered writing&#x201D; [<xref ref-type="bibr" rid="ref-1">1</xref>]. Steganography can be defined as the art and science that aims at applying an object of digital communication by hiding any secretive information [<xref ref-type="bibr" rid="ref-2">2</xref>]. Typically, secure communication is targeted based on different encryption approaches. Nonetheless, the current need for security remains increasing causing the use of steganography for information security. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> illustrates many different majors related to the domain of information hiding. Cryptography and Steganography are highly dependent aspects to information hiding. In fact, both aspects deliver the same aim, while both are however different in some other aspects. Steganography represents a writing that is hidden, while cryptography represents a writing that is kept secret. In particular, cryptography offers security based on the message&#x2019;s contents, while steganography aims at hiding the message itself [<xref ref-type="bibr" rid="ref-1">1</xref>].</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>The different disciplines of information hiding [<xref ref-type="bibr" rid="ref-3">3</xref>]</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-1.png"/>
</fig>
<p>Information hiding contains two sub domains, which are watermarking and steganography [<xref ref-type="bibr" rid="ref-4">4</xref>]. The two domains are applied to make the secret message hidden from other unauthorized users. Both domains are highly dependent on each other. Nonetheless, they depend on many various objectives. Steganography aims at hiding the protective and communication tools pertaining to the secretive information. On the contrary, watermarking aims at protecting the secret data&#x2019;s integrity as to whether the communication derived from eavesdroppers is hidden. The applications of watermarking aim at protecting the information contents&#x2019; intellectual property. Nevertheless, <xref ref-type="table" rid="table-1">Tab. 1</xref> depicts the essential basic characteristic between information hiding and cryptography systems [<xref ref-type="bibr" rid="ref-5">5</xref>].</p>

<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Brief comparison between information hiding and cryptography</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr><th rowspan="2"></th><th colspan="2">Information Hiding</th><th rowspan="2">Cryptography (Encryption)</th>
</tr>
<tr>
<th>Watermarking</th>
<th>Steganography</th>
</tr>
</thead>
<tbody>
<tr>
<td>Main objective</td>
<td>Protect media copyrights</td>
<td>Conceal existence of secret data and communication</td>
<td>Content protection</td>
</tr>
<tr>
<td>Robustness</td>
<td>Against removing tampering security data</td>
<td>Against detecting the existence of secret data</td>
<td>Against breaking ciphers</td>
</tr>
<tr>
<td>Secret information</td>
<td>Watermark</td>
<td>Payload</td>
<td>Plain text of file</td>
</tr>
<tr>
<td>Security of communication</td>
<td>Depends on how confidential the embedding method is.</td>
<td>Depends on how confidential the embedding method is.</td>
<td>Depends on how confidential the key is.</td>
</tr>
<tr>
<td>Loss of security</td>
<td>When loss of integrity</td>
<td>When detecting the existence of security data</td>
<td>When decrypting the cipher</td>
</tr>
<tr>
<td>Result</td>
<td>Watermarked media</td>
<td>Stego-media</td>
<td>Cipher</td>
</tr>
<tr>
<td>Need for key</td>
<td>Optional</td>
<td>Depends on used application</td>
<td>Compulsory</td>
</tr>
<tr>
<td>Type of attacks</td>
<td>Image processing</td>
<td>Steganalysis</td>
<td>Cryptanalysis</td>
</tr>
<tr>
<td>Main challenges</td>
<td>Robustness</td>
<td>Imperceptibility, embedding payload, and robustness</td>
<td>complexity of encryption and key management</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>New review papers in the domain of image steganography are always needed to discuss the strengths and limitations of recent proposed techniques. Therefore, this review paper aims to present an up-to-date knowledge for spatial-domain image steganography. The rest of the paper is structured as follows: Section 2 presents an overview of the steganography including history, fundamental concepts, terminology, and applications. Section 3 reviews the current spatial-domain image steganography, where recent well-known techniques are analyzed and discussed in detail. The future research and recommendations, which could forward the researchers to develop efficient spatial-domain embedding schemes, are presented in Section 4. Finally, Section 5 concludes the paper.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Steganography: An Overview</title>
<sec id="s2_1">
<label>2.1</label>
<title>Brief History</title>
<p>The notion of making any information hidden from other unauthorized users has been studied since the 440 BC and applied into various layouts through the past few years ago [<xref ref-type="bibr" rid="ref-6">6</xref>]. Based on the Greek historian Herodotus, Histaiacus, who is a Greek tyrant, applied a steganography layout in order to provide a communication along with his son-in-law &#x2018;Aristagoras&#x2019;. Histaiacus shaved a trusted slave&#x2019;s head where a tattoo was applied on a secret message on top of his scalp. When the hair of that slave grew back again, Aristagoras received him along with the hidden message [<xref ref-type="bibr" rid="ref-7">7</xref>]. A further layout of steganography took place in the World War 2 once Germans improved the microdot method. In fact, the method aims at condensing several information, at most photographs, into a typed period&#x2019;s size. Information is hidden through one period of a paper (e.g., a full stop) and disseminated through an undefended channel. Edgar Hoover, an FBI detective, elaborates the way of using microdots as a form of the enemy&#x2019;s masterpiece of espionage [<xref ref-type="bibr" rid="ref-8">8</xref>]. Despite the fact that steganography has far been studied for several years now, its new layout formation is clarified based on the use of the prisoners&#x2019; problem that is produced by Simmons [<xref ref-type="bibr" rid="ref-9">9</xref>] such that two prisoners, Alice and Bob, look forward to exchanging information in a secret manner in order to obtain an escape scheme. The whole communication between both prisoners is provided to Eve, who represents a warden of such a communication. If this warden distrusts any secretive communication, then the two prisoners are directed to a solitary confinement. The entire correspondences between the two prisoners are assessed through the warden, which can be either active or passive. If the warden considers a passive method, it will be possible for that warden to check any available secretive information through a prospective communication. If a secretive communication is revealed, then the warden provides a notification towards an external party where the information can accordingly gain access with no any obstacle. Nevertheless, if an active warden distrusts any hidden information; the communication is then modified based on changing or eliminating the hidden data [<xref ref-type="bibr" rid="ref-10">10</xref>].</p>
<p>Most of the current steganographic systems make use of different multimedia objects such as images, videos, audio files, and so on, as a covering media since digital images are frequently transmitted by users through emails and many different communications [<xref ref-type="bibr" rid="ref-11">11</xref>]. These systems aim at making any information hidden into digital multimedia files and at the level of a network packet. In addition, in comparison with other digital media, image-based steganography is currently the most developed field, with several techniques are provided for different image formats [<xref ref-type="bibr" rid="ref-12">12</xref>].</p>
<p>Modern steganographic systems apply the inventions of the networking and computers that appeared in the 20th century. There exist four major improved aspects regarding the digital steganography. These comprise network steganography, file system steganography, linguistic steganography and digital media steganography [<xref ref-type="bibr" rid="ref-13">13</xref>].</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Fundamental Concepts</title>
<p>The term cover image indicates to the image that is used for the purpose of transporting the embedded bits [<xref ref-type="bibr" rid="ref-1">1</xref>]. The embedded data refers to the payload where the image with the embedded data refers to which is called &#x2018;stego-image&#x2019;. The &#x201C;embedded technique&#x201D; refers to the algorithm or process of hiding the &#x201C;secret message&#x201D; within the &#x201C;cover image&#x201D; including an optional &#x201C;stego-key&#x201D;. The optional &#x201C;stego-key&#x201D; is shared with the two ends [<xref ref-type="bibr" rid="ref-5">5</xref>]. In the same context, the &#x201C;extraction technique&#x201D; refers to the procedure of recovering the &#x201C;secret message&#x201D; from the &#x201C;stego-image&#x201D; including an &#x201C;optional key&#x201D;. Steganalysis represents the attack that usually occurs through the steganography process. In particular, steganalysis refers to the science and art of recovering or detecting the secret message that is derived from different stego images. Embedding distortion is the distortion that induced on the cover signal by embedding secret data. Imperceptibility refers to the difficulty confronted by the HVS in noticing any difference between the stego-image and the original cover image [<xref ref-type="bibr" rid="ref-14">14</xref>]. It is necessary that Stego-image would not contain any risky visual objects. A few main needs for steganography comprise embedding payload, security, and robustness. Embedding payload represents the number of information, which is hidden within a cover medium with no deterioration on the cover image&#x2019;s integrity. This number is based on the number of bits per pixel (bpp). The embedding process requires maintaining the statistical features pertaining to the cover image including the perceptual quality. Robustness refers to the number of updates for which the stego medium could possibly resist before an adversary attempts to destroy any hidden information. Security refers to the incapability of an eavesdropper to reveal any hidden information [<xref ref-type="bibr" rid="ref-1">1</xref>].</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>The General Model of Steganography (The Terminology)</title>
<p>In <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, the entire structure pertaining to the steganography process is depicted. Assume that &#x2018;<italic>C</italic>&#x2019; refers to the cover medium i.e., an image, where <italic>C</italic>&#x2032; refers to the stego-image that is derived based on the data that is embedded [<xref ref-type="bibr" rid="ref-1">1</xref>]. Additionally, assume that &#x2018;<italic>K</italic>&#x2019; refers to the optional key, where &#x2018;<italic>SM</italic>&#x2019; refers to the secret message that is to be communicated with. Assume also that <italic>P</italic><sub><italic>emb</italic></sub> refers to the embedding procedure, where <italic>P</italic><sub><italic>ext</italic></sub> refers to the extraction procedure. The encryption and compression procedures remove the redundancy that is likely to occur within a secret message and yield to a further improved security. Therefore, the procedures of embedding and extracting the secret data is highlighted according the following formulas:</p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-1.png"/><tex-math id="tex-eqn-1"><![CDATA[$${P_{emb}}:C\; {\rm \times \; }K\; {\rm \times \; }SM\; \to \; {C}^{\prime}$$]]></tex-math><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>:</mml:mo><mml:mi>C</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mi>K</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow><mml:mi>S</mml:mi><mml:mi>M</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mspace width="thickmathspace"></mml:mspace><mml:msup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math>
</alternatives></disp-formula></p>
<p><disp-formula id="eqn-2">
<label>(2)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-2.png"/><tex-math id="tex-eqn-2"><![CDATA[$${P_{ext}}\left( {{C}^{\prime}} \right) \approx SM$$]]></tex-math><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2248;</mml:mo><mml:mi>S</mml:mi><mml:mi>M</mml:mi></mml:math>
</alternatives></disp-formula></p>
<p>where the size of the secret message |SM|, hidden in <inline-formula id="ieqn-1">
<alternatives><inline-graphic xlink:href="ieqn-1.png"/><tex-math id="tex-ieqn-1"><![CDATA[${C}^{\prime}$]]></tex-math><mml:math id="mml-ieqn-1"><mml:msup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math>
</alternatives></inline-formula>, is known as an embedding payload.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>General model of image steganography</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-2.png"/>
</fig>
<p>An image is a frequently applied file format in steganography since a secret message is entirely embedded within a cover image. Image steganography is categorized into transform and spatial domains. In the spatial domain, a secret message is efficiently embedded within a pixel value in a direct manner. In the transform domain, different approaches perform the embedding procedure based on initially transforming an image from a spatial domain along to a frequency domain based on the use of any available transforms. In the next step, the embedding procedure is applied according to appropriate transformed coefficients.</p>
<p>The measures of an image quality are applied in order to assess the quality of the stego-image that is acquired following the embedding procedure. Various approached aim to attack the steganographic algorithm. Several techniques related to steganography are existing where such techniques involve StegHide, Hide4PGP, S-tools, OutGuess, Stegnos, Ezstego, Hide and Seek, F5, Mp3Stego, and so on. Many different methods of steganalysis comprise the efficient selection of any available secret message and detecting its estimated length or a way of retrieving it. Many different stego attacks involve the filter attack, image resizing attack, J. Fridrich&#x2019;s RS steganalysis, JPEG compression attack, Chi Square attack, Jeremiah J. Harmsena&#x2019;s Histogram attack, image tampering attack, AWGN attack, and so on. The algorithm that is applied to embed the secret data must endure the whole attacking types by preventing an eavesdropper from obtaining the hidden message [<xref ref-type="bibr" rid="ref-1">1</xref>].</p>
</sec>
<sec id="s2_4">
<label>2.4</label>
<title>Steganography Applications</title>
<p>Steganography is applied into many different suitable applications [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-3">3</xref>]. For instance, such examples comprise materials&#x2019; copyright control, improving the strength of several image search engines including smart IDs (identity cards) when all details of individuals are embedded through their photos. Many more applications comprise TV broadcasting, checksum embedding [<xref ref-type="bibr" rid="ref-15">15</xref>], the safe circulation of companies&#x2019; secret data, video&#x2013;audio synchronization, TCP/IP packets (e.g., a unique ID is embedded into an image for analyzing the network traffic of particular users) [<xref ref-type="bibr" rid="ref-2">2</xref>]. Another example involves Petitcolas [<xref ref-type="bibr" rid="ref-16">16</xref>], which highlights a few current applications. One of these applications involve medical imaging systems where a separation is significant for achieving privacy among the data images of prospective patients or DNA sequences including their captions, such as physician&#x2019;s name, patient&#x2019;s name, address and some other related and personal details. Nonetheless, a link is kept between the two. Consequently, a patient&#x2019;s information that is embedded based on an image is beneficial for safety measures purposes, which assist in tackling any emerging issues related to the secrecy of a patient&#x2019;s information. Steganography offers a final assurance of authentication in which no further security techniques can provide a reliable assurance. Miaou et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] propose the LSB embedding method for recording patients&#x2019; information electronically according to the bi-polar multiple-base data hiding method. The difference of a pixel value between the JPEG version of an original image and the image itself represents a number of a conversion base. Nirinjan et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] and Li et al. [<xref ref-type="bibr" rid="ref-19">19</xref>] also discussed hiding patient data in cover images.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Image Steganography</title>
<p>The indispensable characteristic of steganography is based on maintaining the communication as secure as possible when transmitting the stego-image through any available communication or networking channels [<xref ref-type="bibr" rid="ref-20">20</xref>]. Many different kinds of image steganographic techniques are produced where a distinct method is applied for each of these techniques in order to conduct the embedding process of a secret data [<xref ref-type="bibr" rid="ref-5">5</xref>]. However, since it is not possible to categorize the techniques entirely, they are split based on various categories (see <xref ref-type="fig" rid="fig-3">Fig. 3</xref>). The only way is to split them based on the embedding domain (transform and spatial domains) that is derived from [<xref ref-type="bibr" rid="ref-2">2</xref>]. Additionally, the adaptive (statistical aware) embedding technique is also based on the indicated division as it is engaged in the transform and spatial domains. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> illustrates the categorization of such techniques along with the objectives.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Image steganography domains with aimed objectives</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-3.png"/>
</fig>
<p>The spatial domain can utilize the cover image pixels for concealing the secret information, such as the replacement of secret bits within a pixel value [<xref ref-type="bibr" rid="ref-5">5</xref>]. In the transform domain, the data that is contained in the cover image is initially transformed into different signals prior to the use of the embedding procedure. Take an example of the Discrete Cosine Transformation (DCT), which is applied to the pixels of the host image, and then the secret information is embedded into the DCT coefficients.</p>
<p>Moreover, the adaptive embedding represents a statistical or model-based approach that manages different methods related to information hiding. In fact, this approach is interwoven to the transform and spatial domains. This embedding method&#x2019;s type is based on considering the statistical characteristics of an image prior to applying the embedding procedure. This set of the statistical characteristics dictates where the modifications take place in the cover image [<xref ref-type="bibr" rid="ref-21">21</xref>].</p>
<sec id="s3_1">
<label>3.1</label>
<title>Spatial Domain Image Steganography</title>
<p>The spatial-domain embedding techniques are more common in comparison with the transform domain due to its simplicity in the embedding and extraction procedures, but with less strength [<xref ref-type="bibr" rid="ref-5">5</xref>]. Nonetheless, the transform domain techniques are considered immune to the operations of image processing and are also considered less vulnerable to steganalysis attacks [<xref ref-type="bibr" rid="ref-1">1</xref>]. <xref ref-type="table" rid="table-2">Tab. 2</xref> highlights detailed comparisons for the transform and spatial domains.</p>

<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Detailed comparisons of the spatial and transform domains with adaptive embedding techniques</title>
</caption>

<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Characteristics</th>
<th>Spatial Domain</th>
<th>Transform Domain</th>
<th>Adaptive Embedding</th>
</tr>
</thead>
<tbody>
<tr>
<td>Embedding Capacity (Payload)</td>
<td>High</td>
<td>Low</td>
<td>Vary, method dependent</td>
</tr>
<tr>
<td>Embedding place</td>
<td>Direct manipulating of pixel values</td>
<td>Transform coefficients</td>
<td>Method dependent</td>
</tr>
<tr>
<td>Cover format dependency</td>
<td>Format Dependent</td>
<td>Format independent</td>
<td>Method dependent</td>
</tr>
<tr>
<td>Complexity</td>
<td>Low</td>
<td>High</td>
<td>Method dependent</td>
</tr>
<tr>
<td>Robustness against noise, compression, cropping, etc.</td>
<td>Not robust</td>
<td>Less prone</td>
<td>Method dependent</td>
</tr>
<tr>
<td>Visual Quality (Imperceptibility)</td>
<td>High</td>
<td>Low</td>
<td>Low</td>
</tr>
<tr>
<td>Geometric attacks</td>
<td>Not robust (vulnerable)</td>
<td>Less prone (resistant)</td>
<td>Less prone (resistant)</td>
</tr>
<tr>
<td>Statistical detection attacks (e.g., Histogram, RS-attack)</td>
<td>Easy to detect</td>
<td>Hard to detect</td>
<td>Hard to detect</td>
</tr>
<tr>
<td>Well-known techniques</td>
<td>LSB, PVD, MBNS steganography</td>
<td>DCT based, DWT based, CWT based steganography</td>
<td>Region based, HVS, Machine Learning and AI based steganography</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The simplest method of conducting the process of data embedding through digital images is based on updating the values of cover pixels within the spatial domain [<xref ref-type="bibr" rid="ref-20">20</xref>]. The image or spatial-domain methods apply different bit-wise techniques, which implement the noise manipulation and bit insertion by applying different simple techniques. This section discusses the well-known image steganography schemes under the umbrella of spatial domain that evolved in recent time. Various methods that aim at performing the embedding procedure within a spatial domain are illustrated in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. Additionally, a detailed analysis of such methods is given in <xref ref-type="table" rid="table-3">Tab. 3</xref>.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Spatial-domain image steganography</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-4.png"/>
</fig>

<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Performance analysis of recent spatial-domain steganographic methods</title>
</caption>

<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Approach</th>
<th>Reference</th>
<th>Method Name</th>
<th>Merits</th>
<th>Challenges</th>
<th>Payload (bpp)</th>
<th>Visual Quality (PSNR)</th>
<th>Resistance against Steganalysis</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="5">LSB</td>
<td>Sarreshtedari et al. [<xref ref-type="bibr" rid="ref-22">22</xref>]</td>
<td>&#x00B1;1 LSB</td>
<td>High imperceptibility &#x0026; simple implementation.</td>
<td>Lower payload &#x0026; Key dependent</td>
<td>1 bpp (gray-image)</td>
<td>&#x007E;53 dB</td>
<td>HCF-COM</td>
</tr>
<tr>
<td>Qazanfari et al. [<xref ref-type="bibr" rid="ref-23">23</xref>]</td>
<td>GLSB&#x002B;&#x002B;</td>
<td>Secure against Histogram analysis &#x0026; improved visual quality.</td>
<td>Not robust &#x0026; key dependent</td>
<td>0.8 bpp (gray-image)</td>
<td>&#x003E;50 dB</td>
<td>Chi-Square &#x0026; Histogram</td>
</tr>
<tr>
<td>Nguyen et al. [<xref ref-type="bibr" rid="ref-24">24</xref>]</td>
<td>MPBDH</td>
<td>Adaptive embedding &#x0026; reduce visual attacks.</td>
<td>Not robust against compression &#x0026; cropping &#x0026; key dependent</td>
<td>&#x007E;1.5 bpp (gray-image)</td>
<td>&#x007E;46 dB</td>
<td>SPAM at low embedding</td>
</tr>
<tr>
<td>Muhammad et al. [<xref ref-type="bibr" rid="ref-25">25</xref>]</td>
<td>MLEA</td>
<td>Keeps balance between imperceptibility and security, &#x0026; applies multi-level of encryption for secret data.</td>
<td>Lower payload</td>
<td>&#x007E;1 bpp</td>
<td>&#x003E;45 dB</td>
<td>Salt &#x0026; pepper noise, &#x0026; Histogram</td>
</tr>
<tr>
<td>Rajendran and Doraipandian [<xref ref-type="bibr" rid="ref-26">26</xref>]</td>
<td>logistic map-LSB</td>
<td>High visual quality &#x0026; &#x0026; simple implementation.</td>
<td>Lower payload</td>
<td>2 bpp</td>
<td>&#x003E;44.5 dB</td>
<td>Histogram</td>
</tr><tr>
<td/>
<td>Vyas and Dudul [<xref ref-type="bibr" rid="ref-27">27</xref>]</td>
<td>OO-LSB</td>
<td>Encrypts the secret data before embedding starts &#x0026; embeds in skin areas.</td>
<td>Uses multiple covers</td>
<td>&#x007E;40KB</td>
<td>&#x003E;47 dB</td>
<td>N/A</td>
</tr>
<tr>
<td rowspan="4">PVD</td>
<td>Balasubra manian et al. [<xref ref-type="bibr" rid="ref-28">28</xref>]</td>
<td>Octonary-PVD</td>
<td>Adaptive embedding &#x0026; resistance against various statistical steganalysis.</td>
<td>Modern steganalysis evaluation is missing</td>
<td>&#x007E; 3.6 bpp (gray-image)</td>
<td>&#x007E;40 dB</td>
<td>PVD analysis &#x0026; RS analysis</td>
</tr>
<tr>
<td>Shen et al. [<xref ref-type="bibr" rid="ref-29">29</xref>]</td>
<td>MF-PVD</td>
<td>Resolves the PVD underflow/overflow problem &#x0026; simple implementation.</td>
<td>Limited payload &#x0026; modern steganalysis evaluation is missing</td>
<td>&#x007E;1 bpp (color-image)</td>
<td>&#x007E;36 dB</td>
<td>Pixel Difference<break/>Histogram &#x0026; RS analysis.</td>
</tr>
<tr>
<td>Swain [<xref ref-type="bibr" rid="ref-30">30</xref>]</td>
<td>Ad-PVD</td>
<td>Adaptive embedding.</td>
<td>Lower payload</td>
<td>&#x007E;1.74 bpp<break/>(color-image)</td>
<td>&#x007E;46.7 dB</td>
<td>Pixel Difference<break/>Histogram &#x0026; RS analysis.</td>
</tr>
<tr>
<td>GrajedaMar&#x00ED;n et al. [<xref ref-type="bibr" rid="ref-31">31</xref>]</td>
<td>PVD-TPVD</td>
<td>Resolves the PVD underflow/overflow &#x0026; embedding done by full utilization of pixels.</td>
<td>Security evaluation by steganalysis is missing</td>
<td>&#x007E;2.14 bpp (gray-image)</td>
<td>&#x007E;38.3 dB</td>
<td>N/A</td>
</tr><tr>
<td/>
<td>Swain [<xref ref-type="bibr" rid="ref-32">32</xref>]</td>
<td>Ad-PVD</td>
<td>Adaptive embedding &#x0026; High visual quality</td>
<td>Complex algorithms for embedding &#x0026; extracting</td>
<td>&#x007E;3 bits per byte</td>
<td>&#x007E;43 dB</td>
<td>Pixel Difference<break/>Histogram &#x0026; RS analysis.</td>
</tr>
<tr>
<td rowspan="2">EMD</td>
<td>Kuo et al. [<xref ref-type="bibr" rid="ref-33">33</xref>]</td>
<td>GEMD</td>
<td>Uses dynamic modulus table to resolve the extraction function fixed weighting problem.</td>
<td>Modification of all pixels to embed the secret data</td>
<td>1.5 bpp</td>
<td>&#x007E;50.2 dB</td>
<td>N/A</td>
</tr>
<tr>
<td>Kuo, Wang, et al. [<xref ref-type="bibr" rid="ref-34">34</xref>]</td>
<td>MSD</td>
<td>Maintains the bpp with increasing of n pixels &#x0026; reduces the pixel modification ratio (only n/2 of pixels modification).</td>
<td>Limited payload</td>
<td>Only 1 bpp</td>
<td>&#x003E;52 dB</td>
<td>RS analysis</td>
</tr><tr>
<td/>
<td>Kuo et al. [<xref ref-type="bibr" rid="ref-35">35</xref>]</td>
<td>MBEF</td>
<td>Adaptive embedding &#x0026; resolves the PVD underflow/overflow.</td>
<td>Low visual quality when high payload is embedded</td>
<td>Bet. 1.25 &#x0026; 4.5 bpp</td>
<td>Bet. 51 to 30 dB based on the payload</td>
<td>Bit plane &#x0026; RS analysis</td>
</tr>
<tr>
<td rowspan="2">MBNS</td>
<td>Geetha et al. [<xref ref-type="bibr" rid="ref-36">36</xref>]</td>
<td>VRNS</td>
<td>Good visual quality.</td>
<td>Not robust against compression, filtering &#x0026; cropping, limited payload</td>
<td>Only 1 bpp</td>
<td>&#x007E;41 dB</td>
<td>RS analysis</td>
</tr>
<tr>
<td>Chen et al. [<xref ref-type="bibr" rid="ref-37">37</xref>]</td>
<td>GMB</td>
<td>Adaptive technique &#x0026; increases security by coefficient mapping</td>
<td>SPAM analysis detection when payload is &#x003E; 1 bpp</td>
<td>Bet. 1.46 to 3.8 bpp</td>
<td>Bet. 50 to 35 dB</td>
<td>SPAM analysis, Histogram, RS analysis</td>
</tr><tr>
<td/>
<td>Nyeem [<xref ref-type="bibr" rid="ref-38">38</xref>]</td>
<td>Bit Plan Sclicing</td>
<td>high payload with high imperceptibility</td>
<td>Not robust against attacks</td>
<td>Bet. &#x007E;2.5 to &#x007E;7.3 bpp</td>
<td>&#x007E;57 dB at 2.5 bpp</td>
<td>Histogram</td>
</tr><tr>
<td>GLM</td>
<td>Muhammad et al. [<xref ref-type="bibr" rid="ref-39">39</xref>]</td>
<td>GLM-MLE</td>
<td>High imperceptibility &#x0026; robust against salt &#x0026; pepper.</td>
<td>Limited payload</td>
<td>8 KB</td>
<td>&#x007E;57 dB</td>
<td>N/A</td>
</tr><tr>
<td>Palette</td>
<td>Imaizumi et al. [<xref ref-type="bibr" rid="ref-40">40</xref>]</td>
<td>k-bit palette</td>
<td>Higher payload with higher visual quality</td>
<td>Location map is required to extract the embedded bits</td>
<td>Bet. 1 to 3 bpp</td>
<td>&#x007E;40 dB at 3 bpp</td>
<td>N/A</td>
</tr>
<tr>
<td>Prediction</td>
<td>Jafar et al. [<xref ref-type="bibr" rid="ref-41">41</xref>]</td>
<td>MPE</td>
<td>Improved the prediction accuracy by using multiple predictors.</td>
<td>Limited payload &#x0026; security evaluation by steganalysis is missing</td>
<td>Only 90574 bits</td>
<td>&#x007E;46 dB</td>
<td>N/A</td>
</tr><tr>
<td/>
<td>Benhfid et. al. [<xref ref-type="bibr" rid="ref-42">42</xref>]</td>
<td>MLBS</td>
<td>Good imperceptibility level</td>
<td>Limited payload</td>
<td>1.8 bpp</td>
<td>&#x007E;40 dB</td>
<td>Chi-Square</td>
</tr>
<tr>
<td rowspan="3">Deep learning</td>
<td>Baluja [<xref ref-type="bibr" rid="ref-43">43</xref>]</td>
<td>CNN</td>
<td>Higher payload</td>
<td>Takes more time to embed the secret image and requires much more memory</td>
<td>1:1 ratio</td>
<td>N/A</td>
<td>N/A</td>
</tr>
<tr>
<td>Zhu et al. [<xref ref-type="bibr" rid="ref-44">44</xref>]</td>
<td>GAN</td>
<td>High extracting accuracy</td>
<td>Limited payload and requires excessive memory</td>
<td>0.203 bpp</td>
<td>&#x003C;40 dB for Combined model</td>
<td>ATS analysis</td>
</tr>
<tr>
<td>Shang et al. [<xref ref-type="bibr" rid="ref-45">45</xref>]</td>
<td>GANste</td>
<td>Better security</td>
<td>Limited payload</td>
<td>0.4 bpp</td>
<td>&#x003C;30 dB</td>
<td>FGSM &#x0026; Onepixelattack</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s3_1_1">
<label>3.1.1</label>
<title>Least Significant Bit (LSB) Steganography</title>
<p>The LSB technique is considered an extremely simple technique in its performance, and therefore, it represents one of those common spatial image steganographic techniques [<xref ref-type="bibr" rid="ref-20">20</xref>]. The least significant bits within an image only introduces weak information and small modifications in these bits are not detectable through the eyes of humans. The secret bits are directly embedded into the cover image based on applying an LSB-based spatial-domain technique by modifying the cover&#x2019;s least significant bits with no any distortion for the visual quality of the cover image. However, the embedding procedure generates a noise of 50% derived from the average bit embedding rate (i.e., embedded bits per pixel). Previous studies in the LSB steganography approach [<xref ref-type="bibr" rid="ref-46">46</xref>,<xref ref-type="bibr" rid="ref-47">47</xref>] have only focused on designing a method for increasing the capacity of the payload based on the use of the cover pixels. Further, the domain of steganalysis turns to be more effective in breaking such methods when statistical analysis is applied.</p>
<p>To achieve effectiveness of this technique, several developed LSB based image steganography versions are taken into account. The most significant versions apply different LSB matching algorithms [<xref ref-type="bibr" rid="ref-48">48</xref>], Adaptive LSB embedding based on image features such as texture contents or nature of edge pixels [<xref ref-type="bibr" rid="ref-49">49</xref>,<xref ref-type="bibr" rid="ref-50">50</xref>], Optimized LSB substitution based on learning methods [<xref ref-type="bibr" rid="ref-51">51</xref>,<xref ref-type="bibr" rid="ref-52">52</xref>] and so on. Additionally, the LSB technique is expanded to a maximum of 4 LSB planes in order to raise the capacity of the embedding procedure according to the cost of the minimized imperceptibility [<xref ref-type="bibr" rid="ref-53">53</xref>]. In a recent study, the authors proposed an LSB object-oriented image steganography [<xref ref-type="bibr" rid="ref-27">27</xref>]. In the mentioned research work, the secret data is embedded in the skin region of the cover image where the skin objects are selected using a skin detection algorithm. The neural network approach is applied to find the largest object among selected skin-tone objects. While the proposed work gives high embedding PSNR, it uses more than one cover image to embed the secret data.</p>
<p>The major benefit of the LSB steganography related to its ease of the embedding and extraction procedures. Nonetheless, LSB techniques are vulnerable to different statistical attacks, with some manipulations within the stego-image. As the LSB steganography represents the way of modifying the cover&#x2019;s pixel values, its performance of extracting of the embedded data relies on some factors such as the compression quantization, noise effect, and intruder attacks.</p>
</sec>
<sec id="s3_1_2">
<label>3.1.2</label>
<title>Pixel Value Differencing (PVD) Steganography</title>
<p>Wu et al. presented a novel embedding aspect that relies on the occurring difference among pixel values [<xref ref-type="bibr" rid="ref-54">54</xref>]. The cover image consists of non-overlapping blocks of two joined pixels where the difference found within every block is changed. A greater difference between the two pixels allows a greater change and thus higher payload can be embedded. The number of secret bits, which are allowed to be embedded, relies on whether the pixel exists into a smooth or an edge location. In the edge location, the differences among neighboring pixels are found to be more, while in the smooth location it is found to be less. Therefore, more data can be embedded into the edge-area pixels in comparison with the smooth area. Since this technique aims to embed the data by changing the difference value within the two neighboring pixels instead of directly changing pixel values, it offers more effective results based on its stego-image quality and imperceptibility in comparison with the LSB replacement technique. Many techniques that relate to the PVD technique have been produced in order to offer several secure communications and to defeat any statistical attack. For instance, Hussain et al. [<xref ref-type="bibr" rid="ref-55">55</xref>] introduced an embedding technique for enhancing security based on the use of two modes that depend on the embedding procedure. In fact, this procedure is enhanced and based on two techniques, namely, the improved Rightmost Digit Replacement (iRMDR) and the Parity-Bit Pixel Value Difference (PBPVD). A further example of the enhanced security is the histogram analysis based vulnerability (PVD) technique [<xref ref-type="bibr" rid="ref-56">56</xref>]. To link the benefits of different embedding techniques together, hybrid embedding techniques are produced (i.e., Steganographic techniques that apply the LSB and PVD [<xref ref-type="bibr" rid="ref-57">57</xref>,<xref ref-type="bibr" rid="ref-58">58</xref>]).</p>
<p>Many enhanced PVD based image steganography versions were researched in order to improve the efficiency of PVD. The most significant versions apply the Adaptive PVD block technique by using different pseudo-random number techniques for determining the blocks [90] and tackling the fall-off boundary problem in the PVD technique [<xref ref-type="bibr" rid="ref-59">59</xref>]. In addition, Swain [<xref ref-type="bibr" rid="ref-32">32</xref>] proposed an adaptive PVD-based hiding scheme. In the mentioned work, the cover image is divided up into 1 &#x00D7; 2 overlapped blocks of adjacent pixels. After that, the method uses modular arithmetic and adaptive quantization range table to embed the secret data. The findings reveal that the mentioned scheme has higher PSNR value and embedding capacity in comparison with existing PVD schemes. However, the proposed scheme increases the algorithms&#x2019; complexity of embedding and extracting the secret data [<xref ref-type="bibr" rid="ref-60">60</xref>].</p>
</sec>
<sec id="s3_1_3">
<label>3.1.3</label>
<title>Exploiting Modification Direction (EMD) Steganography</title>
<p>The Exploiting modification direction (EMD) method is a common method that keeps the increased fidelity pertaining to the stego-images protected [<xref ref-type="bibr" rid="ref-61">61</xref>]. In general, the secret digit is converted based on the (2n &#x002B; 1)-ary system when the embedding procedure is taking place through this method, such that n denotes the number of the cover pixels. The range of the distortion&#x2019;s highest pixel value is just (&#x00B1;1). In particular, the EMD method applies a particular base for selecting the local variation corresponding to the pixel intensity in the cover image. Thus, more message size can be hidden in the pixels that exist in high texture areas. In fact, the EMD method delivers an effective visual quality in comparison with PVD and LSB methods. The highest capacity of the EMD method reaches 1.16 bpp for n &#x003D; 2. At the same time, the embedding payload is radically reduced when the selected pixels are incremented. Consequently, various EMD methods are produced in order to enhance the embedding payload [<xref ref-type="bibr" rid="ref-33">33</xref>,<xref ref-type="bibr" rid="ref-62">62</xref>&#x2013;<xref ref-type="bibr" rid="ref-64">64</xref>].</p>
<p>Kuo et al. [<xref ref-type="bibr" rid="ref-33">33</xref>] proposed the Generalized Exploiting Modification Direction (GEMD) technique where the major aim is that the (n &#x002B; 1)-ary binary bits are embedded through n adjacent pixels. The findings demonstrate that the technique can keep the embedding payload (1 &#x002B; 1/n) along with a modified set of pixels. However, the technique does not have the ability of hiding secret bits that are exceeding two per every pixel [<xref ref-type="bibr" rid="ref-5">5</xref>]. At the same time, it adjusts the entire pixels of the set when the embedding procedure of the secret is taking place. In order to tackle the issue of pixel modification, Kuo et al. [<xref ref-type="bibr" rid="ref-34">34</xref>] produced a new technique that is called the Modified Signed-Digit (MSD) technique. This technique can only adjust n/2 pixels but has only 1 bpp embedding payload. The MSD technique can proceed towards the RS steganalysis [<xref ref-type="bibr" rid="ref-65">65</xref>] with an efficient imperceptibility. Kuo et al. [<xref ref-type="bibr" rid="ref-35">35</xref>] introduced an embedding technique that is based on a multi-bit encoding function, which is applied in order to enhance the embedding payload. This technique embeds up to (k &#x002B; 1/n) pixels on average for every available pixel, where k is selected based on how much embedded bits are existing per each pixel. Furthermore, the technique can minimize the conversion of the secret data&#x2019;s overhead and gives a simple relation among the adjacent pixels. In the meantime, the technique keeps its security in order to resist the RS and bit plain detection analysis. However, it suffers from low visual quality in comparison with many different available EMD based techniques.</p>
</sec>
<sec id="s3_1_4">
<label>3.1.4</label>
<title>Multiple Base Notational System (MBNS) Steganography</title>
<p>A further spatial-domain embedding technique that relies on the Multiple Base Notational Systems (MBNSs) is proposed in order to transform the secret information through to the notational scheme prior to the embedding procedure [<xref ref-type="bibr" rid="ref-5">5</xref>]. In 2006, this technique was initially proposed to enhance the original LSB substitution technique such that bit planes are applied in order to hide the secret bits [<xref ref-type="bibr" rid="ref-66">66</xref>,<xref ref-type="bibr" rid="ref-67">67</xref>].</p>
<p>In several techniques related to the MBNSs, secret information is changed into symbols and re-expressed according to the used MBNS (e.g., octal, decimal and binary systems) [<xref ref-type="bibr" rid="ref-5">5</xref>]. Additionally, an embedding process is applied for such symbols to be embedded into the pixels&#x2019; intensities. In general, when the notational base symbol is large, the embedding rate gets also large. Several studies aim at enhancing the capacity of the embedding process through different MBNS based techniques. Zhang et al. [<xref ref-type="bibr" rid="ref-68">68</xref>] produced such steganography. Particular bases are selected based on the local variation&#x2019;s degree pertaining to the pixel magnitudes within the cover image such that busy area&#x2019; pixels can carry more secret bits. High embedding payload is obtained by this method. Comparisons of the obtained findings by the MBNSs are conducted with the PVD technique where it can be inferred that it achieves a superior and an effective quality factor and PSNR.</p>
<p>In [<xref ref-type="bibr" rid="ref-36">36</xref>], an adaptive embedding technique is produced according to the Varying-Radix Numeral System (VRNS). This technique divides any secret data into different numerals, which contain a capacity of different amounts of variable information. This division relates to the tolerance of cover pixels when managing the highest adulteration of the greater secret data. It is found to be proven from the findings that the payload is large enough while keeping an acceptable imperceptibility. Additionally, it controls the way it maintains security towards the RS steganalysis [<xref ref-type="bibr" rid="ref-65">65</xref>]. However, embedding the payload is still limited to many different radix-based methods. Consequently, an enhancement of the method in [<xref ref-type="bibr" rid="ref-36">36</xref>] has been conducted in [<xref ref-type="bibr" rid="ref-69">69</xref>]. The enhanced method is called the VRNS method, which is based on a hidden information when applying the Adaptation and Radix (AIHR) algorithm. Nonetheless, such a method obtains a greater payload compared to other available VRNS systems. On the other hand, this method contains few ambiguities in proposed flow. For example, there might be a way a receiver and sender are synchronized based on determining their bases. Additionally, in the AIHR extraction procedure, the ambiguity of selecting the multiple M might lead to not recovering the full secret data. Chen et al. [<xref ref-type="bibr" rid="ref-37">37</xref>] produce a General Multiple-Base (GMB) embedding technique in order to convert the secret bits into a number of M-ary secret digits that belong to a pixel-cluster (i.e., n pixels). The multiple M is selected in an automatic manner based on the end user&#x2019;s input function. It offers various styles of the multi-purpose embedding procedure leading to high embedding payload or high quality of the stego-image. At less than or equal to 1.0 bpp, the GMB method resists the non-structural SPAM features and the RS steganalysis [<xref ref-type="bibr" rid="ref-65">65</xref>].</p>
</sec>
<sec id="s3_1_5">
<label>3.1.5</label>
<title>Gray Level Modification (GLM) Steganography</title>
<p>Potdar et al. [<xref ref-type="bibr" rid="ref-70">70</xref>] proposed the GLM technique in order to map the data based on changing the pixels&#x2019; gray levels (i.e., not embedding it). According to a few mathematical functions, a group of pixels is determined where the values of their gray levels are organized in the bit stream that relates to the secret message, which could have been mapped within the cover image [<xref ref-type="bibr" rid="ref-71">71</xref>]. This technique applies the even and odd numbers aspect in order to provide an effective way of mapping the data through to the cover image. For instance, number &#x2018;1&#x2019; is mapped as an odd data value, while number &#x2018;0&#x2019; is mapped as an even data value. The benefits of such a technique comprise the reduced computational complexity and increased embedding payload. The hybrid embedding technique relies on the GLM technique, which is produced by Safarpour et al. [<xref ref-type="bibr" rid="ref-72">72</xref>] for embedding more secret data, and consequently, increasing the embedding payload.</p>
</sec>
<sec id="s3_1_6">
<label>3.1.6</label>
<title>Quantization Index Modulation (QIM) Steganography</title>
<p>The Quantization Index Modulation (QIM) technique [<xref ref-type="bibr" rid="ref-73">73</xref>] is considered an effective data embedding technique in the field of digital watermarking where it is applied in different steganography domains. This technique is based on embedding the information into the cover medium by first performing a modulation of an index or a set of indices with the embedded data. After that, the host is quantized according to the involved quantizer(s). The technique has high embedding payload, and it aims at allowing the embedder to manage the robustness and distortion levels obtained during the embedding process. Chung et al. introduced an enhanced data embedding technique that relies on a Singular Value Decomposition (SVD) and a vector quantization. The findings showed a better compression ratio and a more effective image quality [<xref ref-type="bibr" rid="ref-74">74</xref>]. A lossless data-hiding algorithm that applies the Side Match Vector Quantization (SMVQ) and the Search Order Coding (SOC) is proposed in [<xref ref-type="bibr" rid="ref-75">75</xref>]. This algorithm performs a compression rate of 0.325 bpp including a 256 of codebook size. A reversible data-hiding technique that is applied for several VQ indices is discussed in detail in [<xref ref-type="bibr" rid="ref-76">76</xref>]. This technique enhances several techniques such as enhancing the proposed techniques by Tsai and Yang and Lin and Chang, which provides 0.49 bpp of a compression rate.</p>
<p>For enhancements based on the embedding payload and the reduction of distortion, several enhanced quantization-based steganography versions are researched. One of these versions utilizes the elastic indicators and adjacent correlation. Through this approach, the indexes are encoded based on the difference values that are derived from the neighbouring indexes and the elastic sub codebooks are applied to enhance the compression rate [<xref ref-type="bibr" rid="ref-77">77</xref>].</p>
</sec>
<sec id="s3_1_7">
<label>3.1.7</label>
<title>Palette Based Steganography</title>
<p>The Palette based steganography is proposed in [<xref ref-type="bibr" rid="ref-78">78</xref>] to utilize the palette-based images as cover images. Image formats such as TIFF, PNG and GIF are appropriate for such a technique. In palette-based steganography, the colour that has a similar parity of a secret bit within a palette is used for the embedding procedure. The major advantage of the palette-based steganography is that the entire distortion within the stego-image is seen to be smaller in comparison with other related spatial techniques. On the other hand, the major drawback of this technique refers to the demand of particular images, which have lossless compression formats.</p>
<p>Imaizumi et al. [<xref ref-type="bibr" rid="ref-40">40</xref>] introduced a dense embedding technique based on the use of the palette based steganography that maintains the visual quality within an adequate level for an untraceable communication. Multiple secret bits are embedded in one pixel once the difference is assessed according to the Euclidian distance measures, knowing that the majority of the palette-based methods follow a strategy of single bit per pixel. As a comparison with further palette-based methods, the embedding payload is marginally increased, and the visual quality is seen to be further increased through the PSNR value of &#x007E;40 dB.</p>
</sec>
<sec id="s3_1_8">
<label>3.1.8</label>
<title>Prediction Based Steganography</title>
<p>The prediction based embedding technique has currently attracted many researchers [<xref ref-type="bibr" rid="ref-5">5</xref>]. In the prediction-based steganography, the embedding procedure is based on directly changing the pixel values, which causes a substantial distortion in the stego-image [<xref ref-type="bibr" rid="ref-1">1</xref>]. This leads to poor visual quality and a low embedding payload. In order to tackle such a problem, a predictive coding technique is provided such that existing pixel values are effectively predicted based on the use of a predictor rather than changing the pixel values. The Error Values (EVs) of prediction are modified for the purpose of embedding the secret bits. Referring to the international standards for lossless and near lossless image compression, the process of compression comprises two different steps, which include the prediction and entropy coding of predicting EVs. The predictive rule is expressed as follows [<xref ref-type="bibr" rid="ref-1">1</xref>]:</p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-3.png"/><tex-math id="tex-eqn-3"><![CDATA[$${X}^{\prime} = \; \left\{ {\matrix{ {\min \left( {{\rm a},{\rm b}} \right),\; \; \; \; \; \; \; \; \; if\; c \ge \max \left( {{\rm a},{\rm b}} \right)\; \; \; \; \; \; \; \; \; \; \; } \cr {\max \left( {{\rm a},{\rm b}} \right),\; \; \; \; \; \; \; \; \; if\; c \le \min \left( {{\rm a},{\rm b}} \right)\; \; \; \; \; \; \; \; \; \; \; \; } \cr {a + b - c,\; \; \; \; \; \; \; \; \; \; otherwise\; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; } \cr } } \right.$$]]></tex-math><mml:math id="mml-eqn-3" display="block"><mml:msup><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x003D;</mml:mo><mml:mspace width="thickmathspace"></mml:mspace><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnspacing="1em" rowspacing="4pt"><mml:mtr><mml:mtd><mml:mrow><mml:mo form="prefix" movablelimits="true">min</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi>c</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mo form="prefix" movablelimits="true">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo form="prefix" movablelimits="true">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mi>c</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mo form="prefix" movablelimits="true">min</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mi mathvariant="normal">a</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>a</mml:mi><mml:mo>&#x002B;</mml:mo><mml:mi>b</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>c</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace><mml:mspace width="thickmathspace"></mml:mspace></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo stretchy="true" symmetric="true" fence="true"></mml:mo></mml:mrow></mml:math>
</alternatives></disp-formula></p>
<p>During the prediction step, a predictor is employed to estimate the pixel values of the host image. After that, the entropy coder is used to compress the prediction EV. The Median Edge Detector (MED) technique and the Gradient Adjusted Prediction (GAP) techniques represent new predictors that are applied in several prediction-based image coding techniques. Many different reversible prediction-based embedding techniques are enhanced and highlighted in the literature. Every technique attempts at enhancing many available proposed existing techniques.</p>
<p>Hong et al. [<xref ref-type="bibr" rid="ref-79">79</xref>] proposed an embedding technique that relies on the modification of prediction error (MPE), which adjusts the prediction errors&#x2019; histogram in order to select the unoccupied area for embedding the secret data. The visual quality pertaining to the MPE method ensures more than 48 dB. To acquire an increased embedding payload, the authors in [<xref ref-type="bibr" rid="ref-41">41</xref>] proposed a multiple predictor base steganographic technique, which is considered as an enhancement to the MPE technique without the need for adding any predictor overhead. Determining the accurate predictor in the embedding process is based on the predictor&#x2019;s history. The produced technique demonstrates that the enhancement occurs for the visual quality and embedding payload where its security is not evaluated by any steganalysis technique.</p>
<p>Recently, Benhfid et al. [<xref ref-type="bibr" rid="ref-42">42</xref>] adopted the interpolation through multiple linear box-splines (MLBS) on three directional mesh in order to develop a reversible embedding technique. The secret data is embedded within the error between the interpolated and cover pixels. The secret data is initially put into the interpolated pixels as a particular error. The error is adopted to acquire several stego-pixels that are extremely close to the cover pixels. Furthermore, the LSBs pertaining to the secret data&#x2019;s interpolated pixels are replaced into the cover pixels. After that, the Optimal Pixel Adjustment Procedure (OPAP) is used for the purpose of minimizing the difference between the original cover pixel and the stego-pixel. To compare with other studies in the literature, the findings reveal that the produced technique contains a great embedding payload when the PSNR values are retained at a good level. Additionally, the findings show that this technique achieves a low detectability rate when examined through different steganalysis attacks.</p>
</sec>
<sec id="s3_1_9">
<label>3.1.9</label>
<title>Deep Learning Steganography</title>
<p>In recent years, the introducing of deep learning in steganography has shown a great improvement in the effectiveness of steganography methods. Deep learning steganography is learned from machine learning. Several deep learning steganography methods [<xref ref-type="bibr" rid="ref-43">43</xref>&#x2013;<xref ref-type="bibr" rid="ref-45">45</xref>] have been developed to improve the imperceptibility and security of steganography. Baluja [<xref ref-type="bibr" rid="ref-43">43</xref>] designed a convolutional neural network (CNN) model based on an encoder-decoder structure. The encoder successfully conceals the secret image into a cover image of the same size of the secret image, while the decoder reveals the complete secret image. The proposed method has a large payload with a minimum degree of distortion to the cover image. It distributes the bits of secret image across all the available bits of the cover image. However, in terms of security, the generated stego-images are distorted in color. In addition, this model takes more time to embed the secret image and requires much more memory since it uses three networks in the embedding and extracting processes [<xref ref-type="bibr" rid="ref-80">80</xref>].</p>
<p>Zhu et al. [<xref ref-type="bibr" rid="ref-44">44</xref>] proposed a deep learning data hiding method, called HiDDeN, based on using Generative adversarial networks (GANs). This method consists of a stego-image generator, an attack simulator, and an extractor. Different noises, such as JPEG compression and Gaussian filter, were modeled in the simulator to train the network. The proposed HiDDeN method can extract the hidden bits with high accuracy even under different attacks, such as JPEG compression and Gaussian blur. However, while this method is resistance to a set of various noises, it requires excessive memory, and therefore cannot effectively embed large payloads [<xref ref-type="bibr" rid="ref-81">81</xref>].</p>
<p>Recently, Shang et al. [<xref ref-type="bibr" rid="ref-45">45</xref>] proposed a deep learning steganography method based on GANs and adversarial example techniques to enhances the security of deep learning steganography. This method consists of two phases, namely, model training and security improving. By the security improving phase (i.e., using adversarial example techniques), the generated stego-images can fool the deep learning steganalysis techniques and the extracted secret images are less distorted. The experiments reveal that the MSE values of stego-images are less than one percent. However, the proposed method has lower embedding payload (&#x007E;0.4 bpp).</p>
<p>Many spatial-domain steganography techniques can achieve high payload, but they are susceptible to extremely few updates, which are likely to be encountered based on different image processing tasks (e.g., scaling, rotation, cropping, and so on). Moreover, these techniques recompense the image&#x2019;s statistical features indicating a weak robustness towards image filters and lossy compression. As a summary, <xref ref-type="table" rid="table-4">Tab. 4</xref> provides number of significant comparisons for the merits and demerits pertaining to the well-known spatial-domain steganography techniques.</p>

<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>The merits and demerits of well-known spatial-domain image steganography</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Technique</th>
<th>Merits</th>
<th>Demerits</th>
</tr>
</thead>
<tbody>
<tr>
<td>LSB</td>
<td>Acceptable payload &#x0026; simple implementation</td>
<td>Not robust against statistical attacks and noise</td>
</tr>
<tr>
<td>PVD</td>
<td>High payload with acceptable imperceptibility</td>
<td>Not robust against statistical attacks</td>
</tr>
<tr>
<td>EMD</td>
<td>Better imperceptibility compared with LSB &#x0026; PVD</td>
<td>Low payload</td>
</tr>
<tr>
<td>MBNS</td>
<td>High payload &#x0026; more robust against steganalysis process</td>
<td>Not robust against geometrical attacks</td>
</tr>
<tr>
<td>GLM</td>
<td>High payload &#x0026; low computational complexity</td>
<td>Not robust against attacks</td>
</tr>
<tr>
<td>QIM</td>
<td>High payload</td>
<td>Prone to steganalysis &#x0026; geometrical attacks</td>
</tr>
<tr>
<td>Palette based</td>
<td>High payload &#x0026; less distortion compared to other spatial-domain techniques</td>
<td>Not secure &#x0026; it needs covers of specific lossless compression format</td>
</tr>
<tr>
<td>Prediction based</td>
<td>Not prone to steganalysis attacks</td>
<td>Limited payload</td>
</tr>
<tr>
<td>Deep learning based</td>
<td>Better imperceptibility and security</td>
<td>Limited payload</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Future Research</title>
<sec id="s4_1">
<label>4.1</label>
<title>Steganographic Aspects for Improving the Embedding Efficiency</title>
<p>The major challenges incurred in the spatial-domain image steganography comprise having high embedding payload and security, and having a lowest detectability [<xref ref-type="bibr" rid="ref-20">20</xref>]. Although many researchers provide an extensive research in this domain in the past, the aforementioned demands are yet not entirely achieved. Knowing that the steganographic features are highly based on each other, developing a few features can reduce some different aspects&#x2019; efficiency. The challenge relates to finding a solution has not yet been completed for the entire demands at the same time. A few steganographic aspects are provided below in order to develop the efficiency pertaining to the current spatial-domain steganography.<list list-type="alpha-lower"><list-item>
<p>The emphasis over the adaptive steganography: An adaptive approach represents the basic notion for obtaining an optimized method. Adaptiveness does not only develop the embedding efficiency but can as well protect the attempts of steganalysis with appropriate and efficient counter measures. The majority of the prediction and deep learning techniques are considered to represent the most effective selection for obtaining an adaptive nature to the system. This allows providing further improvements for all image steganography concepts starting from the imperceptibility along towards the embedding payload in comparison with different traditional embedding techniques.</p></list-item><list-item>
<p>Statistics aware modelling: Due to the further improvements in steganalysis techniques, forming the most secure steganography method is getting more crucial. In order to form this method, the embedding secret data is added to particular regions instead of the whole image. These regions are called the Region of Interest (ROI). These regions must be determined based on applying the embedding procedure within the image&#x2019;s portions that yield to obtain the lowest distortion. Consequently, it can be inferred that embedding the secret data through the ROI by considering the image&#x2019;s statistical features will assist in obtaining the required results.</p></list-item><list-item>
<p>Soft computing tools: Determining suitable locations for the embedding process has an essential role in embedding the secret data. The determination of such embedding locations is performed based on applying soft computing tools. Applying different optimization algorithms, such as neural networks, can assist in embedding the secret data into the host image in a way that increases the embedded payload, innocuousness, and stego-image quality.</p></list-item><list-item>
<p>Enhancing the secret data&#x2019;s security: Using the encrypted form of the secret data assists in improving the security. Such techniques as the DES and RSA are applied to acquire an encrypted version of the secret data to be hidden in the cover image.</p></list-item><list-item>
<p>Selecting the most effective cover for hiding the data: researchers have previously concentrated on just applying the optimum selection pertaining to the locations of the data embedding in order to acquire an effective image quality. Nonetheless, the findings show that selecting an appropriate cover image maintains the rigidness of a system against any stego attacks while preserving high embedding payload.</p></list-item></list></p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Recommendations</title>
<p>In this subsection, a set of recommendations are provided in order to forward the researchers to develop efficient spatial-domain steganography techniques.<list list-type="alpha-lower"><list-item>
<p>The compound of steganography with cryptography: the encryption of the secret data prior to embedding it adds as an extra security layer. If the steganographic algorithm could be exposed by a steganalysis attack, then the encryption has to be broken by the attacker so that the secret data could be possibly recovered.</p></list-item><list-item>
<p>The integration of irreversible and reversible techniques: The integration of reversible and irreversible embedding can raise the security and the embedding payload. The same set of pixels are recursively employed by number of different reversible and irreversible techniques where it is hard for an attacker to have the secret data recovered.</p></list-item><list-item>
<p>Hybrid embedding techniques: Multiple embedding techniques can raise the security of the data and can cause confusion with some steganalysis techniques. Additionally, the weaknesses and strengths of the available techniques are exploited for designing a more effective embedding technique. Hybrid embedding techniques might likely represent effective techniques in terms of security and protection.</p></list-item><list-item>
<p>Universal steganography: The study demonstrates that the majority of the available steganographic techniques represent domain and format/type dependents. It is significant that the universal image steganographic techniques are revealed and formed in a way not to rely on the domain or type. Moreover, these techniques offer effective resistances for different attacks.</p></list-item><list-item>
<p>Minimizing the additive noise distortion: Minimizing the distortion resulting from the additive noise can resist modern steganalysis. In general, modern steganalysis attacks compute various distinctive features pertaining to the cover image and stego-image in order to differentiate the images types. At most, such features can be created based on an additive noise exists in the stego-image. Accordingly, challenges for reducing the additive noise in developing new embedding techniques are still in demand.</p></list-item><list-item>
<p>Blind (cover-less and key-less) extraction approaches: Both approaches refer to the capability of recovering the embedded secret data from the stego-image without the need for the cover image or the stego-key. When the original cover image is needed for the extraction procedure, the cover image gets suspicious. In the same context, sending a stego-key might likely be alarming. Consequently, the blind (cover-less and key-less) extraction procedure improves the security of the embedding techniques.</p></list-item><list-item>
<p>Multi-purpose embedding techniques: Many of these techniques are formed in order to achieve a single goal by either acquiring high embedding payload or high imperceptibility. A multi-purpose embedding technique can minimize the method&#x2019;s complexity and streamline the implementation. In fact, real-time applications acquire these benefits when designing multi-purpose steganography methods.</p></list-item><list-item>
<p>Ideal image steganography techniques must provide high imperceptibility, high embedding payload, and resistance towards statistical steganalysis attacks. However, no any ideal steganography technique in reality. All indicated techniques have merits and demerits, which rely on the adopted algorithm and their applications&#x2019; types. Subsequently, the significance of a steganography method is based on the provided application.</p></list-item></list></p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>In this review paper, a comprehensive survey related to recent spatial-domain embedding techniques are introduced. The difference between information hiding and cryptography is provided. Comparisons among available proposed embedding techniques in the spatial domain are explained based on their merits and demerits according to a graphical and tabular design. Additionally, many different recommendations, which might assist future researchers to proceed further in the spatial-image steganography, are elaborated in this paper. The major challenges pertaining to spatial-domain image steganography are comprised of the followings: (i) Maintaining imperceptibility within an increased level, (ii) Giving an increased security for the hidden secret data, (iii) Providing robust procedures towards many different intruder attacks and (iv) Providing an increased embedding payload. Generally, the majority of spatial-domain steganography techniques are considered more appropriate if high embedding payload is persistently required. However, the most commonly found flaw of spatial-domain steganography is the weak defense against geometric attacks, such as scaling, rotation, and cropping. As per the literature, it is inferred that adaptive embedding techniques are effective, and thus, the research may be directed towards applying adaptive approaches for high quality steganography techniques.</p>
</sec>
</body>
<back><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> The APC was funded by the Deanship of Scientific Research, Saudi Electronic University.</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1">
<label>1</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>M. S.</given-names> 
<surname>Subhedar</surname></string-name> and <string-name>
<given-names>V. H.</given-names> 
<surname>Mankar</surname></string-name>
</person-group>, &#x201C;
<article-title>Current status and key issues in image steganography: A survey</article-title>,&#x201D; 
<source>Computer Science Review</source>, vol. 
<volume>13</volume>, pp. 
<fpage>95</fpage>&#x2013;
<lpage>113</lpage>, 
<year>2014</year>.</mixed-citation>
</ref>
<ref id="ref-2">
<label>2</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>N. F.</given-names> 
<surname>Johnson</surname></string-name> and <string-name>
<given-names>S.</given-names> 
<surname>Jajodia</surname></string-name>
</person-group>, &#x201C;
<article-title>Exploring steganography: Seeing the unseen</article-title>,&#x201D; 
<source>Computer</source>, vol. 
<volume>31</volume>, no. 
<issue>2</issue>, pp. 
<fpage>26</fpage>&#x2013;
<lpage>34</lpage>, 
<year>1998</year>.</mixed-citation>
</ref>
<ref id="ref-3">
<label>3</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>A.</given-names> 
<surname>Cheddad</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Condell</surname></string-name>, <string-name>
<given-names>K.</given-names> 
<surname>Curran</surname></string-name> and <string-name>
<given-names>P.</given-names> 
<surname>Mc Kevitt</surname></string-name>
</person-group>, &#x201C;
<article-title>Digital image steganography: Survey and analysis of current methods</article-title>,&#x201D; 
<source>Signal Processing</source>, vol. 
<volume>90</volume>, no. 
<issue>3</issue>, pp. 
<fpage>727</fpage>&#x2013;
<lpage>752</lpage>, 
<year>2010</year>.</mixed-citation>
</ref>
<ref id="ref-4">
<label>4</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>F. A.</given-names> 
<surname>Petitcolas</surname></string-name>, <string-name>
<given-names>R. J.</given-names> 
<surname>Anderson</surname></string-name> and <string-name>
<given-names>M. G.</given-names> 
<surname>Kuhn</surname></string-name>
</person-group>, &#x201C;
<article-title>Information hiding-a survey</article-title>,&#x201D; 
<source>Proceedings of the IEEE</source>, vol. 
<volume>87</volume>, no. 
<issue>7</issue>, pp. 
<fpage>1062</fpage>&#x2013;
<lpage>1078</lpage>, 
<year>1999</year>.</mixed-citation>
</ref>
<ref id="ref-5">
<label>5</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>M.</given-names> 
<surname>Hussain</surname></string-name>, <string-name>
<given-names>A. W. A.</given-names> 
<surname>Wahab</surname></string-name>, <string-name>
<given-names>Y. I. B.</given-names> 
<surname>Idris</surname></string-name>, <string-name>
<given-names>A. T.</given-names> 
<surname>Ho</surname></string-name> and <string-name>
<given-names>K. H.</given-names> 
<surname>Jung</surname></string-name>
</person-group>, &#x201C;
<article-title>Image steganography in spatial domain: A survey</article-title>,&#x201D; 
<source>Signal Processing: Image Communication</source>, vol. 
<volume>65</volume>, pp. 
<fpage>46</fpage>&#x2013;
<lpage>66</lpage>, 
<year>2018</year>.</mixed-citation>
</ref>
<ref id="ref-6">
<label>6</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Barve</surname></string-name>, <string-name>
<given-names>U.</given-names> 
<surname>Nagaraj</surname></string-name> and <string-name>
<given-names>R.</given-names> 
<surname>Gulabani</surname></string-name>
</person-group>, &#x201C;
<article-title>Efficient and secure biometric image stegnography using discrete wavelet transform</article-title>,&#x201D; 
<source>International Journal of Computer Science &#x0026; Communication Networks</source>, vol. 
<volume>1</volume>, no. 
<issue>1</issue>, pp. 
<fpage>96</fpage>&#x2013;
<lpage>99</lpage>, 
<year>2011</year>.</mixed-citation>
</ref>
<ref id="ref-7">
<label>7</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>A.</given-names> 
<surname>Cheddad</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Condell</surname></string-name>, <string-name>
<given-names>K.</given-names> 
<surname>Curran</surname></string-name> and <string-name>
<given-names>P.</given-names> 
<surname>Mc Kevitt</surname></string-name>
</person-group>, &#x201C;
<article-title>Biometric inspired digital image steganography</article-title>,&#x201D; in <conf-name>15th Annual IEEE Int. Conf. and Workshop on the Engineering of Computer Based Systems</conf-name>, 
<publisher-name>IEEE</publisher-name>, Belfast, Northern Ireland, pp. 
<fpage>159</fpage>&#x2013;
<lpage>168</lpage>, 
<year>2008</year>. </mixed-citation>
</ref>
<ref id="ref-8">
<label>8</label><mixed-citation publication-type="other">
<person-group person-group-type="author"><string-name>
<given-names>J.</given-names> 
<surname>Cummins</surname></string-name>, <string-name>
<given-names>P.</given-names> 
<surname>Diskin</surname></string-name>, <string-name>
<given-names>S.</given-names> 
<surname>Lau</surname></string-name> and <string-name>
<given-names>R.</given-names> 
<surname>Parlett</surname></string-name>
</person-group>, &#x201C;
<article-title>Steganography and digital watermarking</article-title>,&#x201D; 
<publisher-name>School of Computer Science, The University of Birmingham</publisher-name>, 
<year>2004</year>, [Online]. Available: <uri>https://www.cs.bham.ac.uk/&#x007E;mdr/teaching/modules03/security/students/SS5/Steganography.pdf</uri>.</mixed-citation>
</ref>
<ref id="ref-9">
<label>9</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>T.</given-names> 
<surname>Morkel</surname></string-name>, <string-name>
<given-names>J. H.</given-names> 
<surname>Eloff</surname></string-name> and <string-name>
<given-names>M. S.</given-names> 
<surname>Olivier</surname></string-name>
</person-group>, &#x201C;
<article-title>An overview of image steganography</article-title>,&#x201D; 
<source>ISSA</source>, vol. 
<volume>1</volume>, no. 
<issue>2</issue>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>12</lpage>, 
<year>2005</year>.</mixed-citation>
</ref>
<ref id="ref-10">
<label>10</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>M.</given-names> 
<surname>Douglas</surname></string-name>, <string-name>
<given-names>K.</given-names> 
<surname>Bailey</surname></string-name>, <string-name>
<given-names>M.</given-names> 
<surname>Leeney</surname></string-name> and <string-name>
<given-names>K.</given-names> 
<surname>Curran</surname></string-name>
</person-group>, &#x201C;
<article-title>An overview of steganography techniques applied to the protection of biometric data</article-title>,&#x201D; 
<source>Multimedia Tools and Applications</source>, vol. 
<volume>77</volume>, no. 
<issue>13</issue>, pp. 
<fpage>17333</fpage>&#x2013;
<lpage>17373</lpage>, 
<year>2018</year>.</mixed-citation>
</ref>
<ref id="ref-11">
<label>11</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>G.</given-names> 
<surname>Smitha</surname></string-name> and <string-name>
<given-names>E.</given-names> 
<surname>Baburaj</surname></string-name>
</person-group>, &#x201C;
<article-title>A survey on image steganography based on least significant bit matched revisited (LSBMR) algorithm</article-title>,&#x201D; in <conf-name>2016 Int. Conf. on Emerging Technological Trends (ICETT)</conf-name>, 
<publisher-name>IEEE</publisher-name>, Kollam, India, pp. 
<fpage>1</fpage>&#x2013;
<lpage>6</lpage>, 
<year>2016</year>. </mixed-citation>
</ref>
<ref id="ref-12">
<label>12</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Atawneh</surname></string-name>, <string-name>
<given-names>A.</given-names> 
<surname>Almomani</surname></string-name> and <string-name>
<given-names>P.</given-names> 
<surname>Sumari</surname></string-name>
</person-group>, &#x201C;
<article-title>Steganography in digital images: Common approaches and tools</article-title>,&#x201D; 
<source>IETE Technical Review</source>, vol. 
<volume>30</volume>, no. 
<issue>4</issue>, pp. 
<fpage>344</fpage>&#x2013;
<lpage>358</lpage>, 
<year>2013</year>.</mixed-citation>
</ref>
<ref id="ref-13">
<label>13</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>E.</given-names> 
<surname>Zieli&#x0144;ska</surname></string-name>, <string-name>
<given-names>W.</given-names> 
<surname>Mazurczyk</surname></string-name> and <string-name>
<given-names>K.</given-names> 
<surname>Szczypiorski</surname></string-name>
</person-group>, &#x201C;
<article-title>Trends in steganography</article-title>,&#x201D; 
<source>Communications of the ACM</source>, vol. 
<volume>57</volume>, no. 
<issue>3</issue>, pp. 
<fpage>86</fpage>&#x2013;
<lpage>95</lpage>, 
<year>2014</year>.</mixed-citation>
</ref>
<ref id="ref-14">
<label>14</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Atawneh</surname></string-name>, <string-name>
<given-names>A.</given-names> 
<surname>Almomani</surname></string-name>, <string-name>
<given-names>H. Al</given-names> 
<surname>Bazar</surname></string-name>, <string-name>
<given-names>P.</given-names> 
<surname>Sumari</surname></string-name> and <string-name>
<given-names>B.</given-names> 
<surname>Gupta</surname></string-name>
</person-group>, &#x201C;
<article-title>Secure and imperceptible digital image steganographic algorithm based on diamond encoding in DWT domain</article-title>,&#x201D; 
<source>Multimedia Tools and Applications</source>, vol. 
<volume>76</volume>, no. 
<issue>18</issue>, pp. 
<fpage>18451</fpage>&#x2013;
<lpage>18472</lpage>, 
<year>2017</year>.</mixed-citation>
</ref>
<ref id="ref-15">
<label>15</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>W.</given-names> 
<surname>Bender</surname></string-name>, <string-name>
<given-names>W.</given-names> 
<surname>Butera</surname></string-name>, <string-name>
<given-names>D.</given-names> 
<surname>Gruhl</surname></string-name>, <string-name>
<given-names>R.</given-names> 
<surname>Hwang</surname></string-name>, <string-name>
<given-names>F. J.</given-names> 
<surname>Paiz</surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>Applications for data hiding</article-title>,&#x201D; 
<source>IBM Systems Journal</source>, vol. 
<volume>39</volume>, no. 
<issue>3.4</issue>, pp. 
<fpage>547</fpage>&#x2013;
<lpage>568</lpage>, 
<year>2000</year>.</mixed-citation>
</ref>
<ref id="ref-16">
<label>16</label><mixed-citation publication-type="book">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Katzenbeisser</surname></string-name> and <string-name>
<given-names>F. A.</given-names> 
<surname>Petitcolas</surname></string-name>
</person-group>, &#x201C;<chapter-title>Introduction to information hiding</chapter-title>, &#x201D; in K. Stefan and P. Fabien (eds.), 
<source>Information Hiding: Techniques for Steganography and Digital Watermarking</source>, Artech House, Boston, London: Artech House, pp. 
<fpage>1</fpage>&#x2013;
<lpage>14</lpage>, 
<year>2000</year>.</mixed-citation>
</ref>
<ref id="ref-17">
<label>17</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>S. G.</given-names> 
<surname>Miaou</surname></string-name>, <string-name>
<given-names>C. M.</given-names> 
<surname>Hsu</surname></string-name>, <string-name>
<given-names>Y. S.</given-names> 
<surname>Tsai</surname></string-name> and <string-name>
<given-names>H. M.</given-names> 
<surname>Chao</surname></string-name>
</person-group>, &#x201C;
<article-title>A secure data hiding technique with heterogeneous data-combining capability for electronic patient records</article-title>,&#x201D; in <conf-name>Proc. of the 22nd Annual Int. Conf. of the IEEE Engineering in Medicine and Biology Society (Cat. No. 00CH37143), vol. 1</conf-name>, 
<publisher-name>IEEE</publisher-name>, pp. 
<fpage>280</fpage>&#x2013;
<lpage>283</lpage>, 
<year>2000</year>. </mixed-citation>
</ref>
<ref id="ref-18">
<label>18</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>D.</given-names> 
<surname>Anand</surname></string-name> and <string-name>
<given-names>U.</given-names> 
<surname>Niranjan</surname></string-name>
</person-group>, &#x201C;
<article-title>Watermarking medical images with patient information</article-title>,&#x201D; in <conf-name>Proc. of the 20th Annual Int. Conf. of the IEEE Engineering in Medicine and Biology Society</conf-name>, 
<publisher-loc>Hong Kong, China</publisher-loc>: 
<publisher-name>IEEE</publisher-name>, vol. 
<volume>2</volume>, pp. 
<fpage>703</fpage>&#x2013;
<lpage>706</lpage>, 
<year>1998</year>. </mixed-citation>
</ref>
<ref id="ref-19">
<label>19</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>Y.</given-names> 
<surname>Li</surname></string-name>, <string-name>
<given-names>C. T.</given-names> 
<surname>Li</surname></string-name> and <string-name>
<given-names>C. H.</given-names> 
<surname>Wei</surname></string-name>
</person-group>, &#x201C;
<article-title>Protection of mammograms using blind steganography and watermarking</article-title>,&#x201D; in <conf-name>Third Int. Sym. on Information Assurance and Security</conf-name>, 
<publisher-loc>Manchester, UK</publisher-loc>: 
<publisher-name>IEEE</publisher-name>, pp. 
<fpage>496</fpage>&#x2013;
<lpage>500</lpage>, 
<year>2007</year>. </mixed-citation>
</ref>
<ref id="ref-20">
<label>20</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>I. J.</given-names> 
<surname>Kadhim</surname></string-name>, <string-name>
<given-names>P.</given-names> 
<surname>Premaratne</surname></string-name>, <string-name>
<given-names>P. J.</given-names> 
<surname>Vial</surname></string-name> and <string-name>
<given-names>B.</given-names> 
<surname>Halloran</surname></string-name>
</person-group>, &#x201C;
<article-title>Comprehensive survey of image steganography: Techniques, evaluations, and trends in future research</article-title>,&#x201D; 
<source>Neurocomputing</source>, vol. 
<volume>335</volume>, pp. 
<fpage>299</fpage>&#x2013;
<lpage>326</lpage>, 
<year>2019</year>.</mixed-citation>
</ref>
<ref id="ref-21">
<label>21</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>M.</given-names> 
<surname>Kharrazi</surname></string-name>, <string-name>
<given-names>H. T.</given-names> 
<surname>Sencar</surname></string-name> and <string-name>
<given-names>N. D.</given-names> 
<surname>Memon</surname></string-name>
</person-group>, &#x201C;
<article-title>Performance study of common image steganography and steganalysis techniques</article-title>,&#x201D; 
<source>Journal of Electronic Imaging</source>, vol. 
<volume>15</volume>, no. 
<issue>4</issue>, pp. 
<fpage>041104</fpage>, 
<year>2006</year>.</mixed-citation>
</ref>
<ref id="ref-22">
<label>22</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Sarreshtedari</surname></string-name> and <string-name>
<given-names>M. A.</given-names> 
<surname>Akhaee</surname></string-name>
</person-group>, &#x201C;
<article-title>One-third probability embedding: A new &#x00B1; 1 histogram compensating image least significant bit steganography scheme</article-title>,&#x201D; 
<source>IET Image Processing</source>, vol. 
<volume>8</volume>, no. 
<issue>2</issue>, pp. 
<fpage>78</fpage>, 
<year>2014</year>.</mixed-citation>
</ref>
<ref id="ref-23">
<label>23</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>K.</given-names> 
<surname>Qazanfari</surname></string-name> and <string-name>
<given-names>R.</given-names> 
<surname>Safabakhsh</surname></string-name>
</person-group>, &#x201C;
<article-title>A new steganography method which preserves histogram: Generalization of LSB&#x002B;&#x002B;</article-title>,&#x201D; 
<source>Information Sciences</source>, vol. 
<volume>277</volume>, pp. 
<fpage>90</fpage>&#x2013;
<lpage>101</lpage>, 
<year>2014</year>.</mixed-citation>
</ref>
<ref id="ref-24">
<label>24</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>T. D.</given-names> 
<surname>Nguyen</surname></string-name>, <string-name>
<given-names>S.</given-names> 
<surname>Arch-Int</surname></string-name> and <string-name>
<given-names>N.</given-names> 
<surname>Arch-Int</surname></string-name>
</person-group>, &#x201C;
<article-title>An adaptive multi bit-plane image steganography using block data-hiding</article-title>,&#x201D; 
<source>Multimedia Tools and Applications</source>, vol. 
<volume>75</volume>, no. 
<issue>14</issue>, pp. 
<fpage>8319</fpage>&#x2013;
<lpage>8345</lpage>, 
<year>2016</year>.</mixed-citation>
</ref>
<ref id="ref-25">
<label>25</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>K.</given-names> 
<surname>Muhammad</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Ahmad</surname></string-name>, <string-name>
<given-names>N. U.</given-names> 
<surname>Rehman</surname></string-name>, <string-name>
<given-names>Z.</given-names> 
<surname>Jan</surname></string-name> and <string-name>
<given-names>M.</given-names> 
<surname>Sajjad</surname></string-name>
</person-group>, &#x201C;
<article-title>CISSKA-LSB: Color image steganography using stego key-directed adaptive LSB substitution method</article-title>,&#x201D; 
<source>Multimedia Tools and Applications</source>, vol. 
<volume>76</volume>, no. 
<issue>6</issue>, pp. 
<fpage>8597</fpage>&#x2013;
<lpage>8626</lpage>, 
<year>2017</year>.</mixed-citation>
</ref>
<ref id="ref-26">
<label>26</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Rajendran</surname></string-name> and <string-name>
<given-names>M.</given-names> 
<surname>Doraipandian</surname></string-name>
</person-group>, &#x201C;
<article-title>Chaotic map based random image steganography using LSB technique</article-title>,&#x201D; 
<source>International Journal of Network Security</source>, vol. 
<volume>19</volume>, no. 
<issue>4</issue>, pp. 
<fpage>593</fpage>&#x2013;
<lpage>598</lpage>, 
<year>2017</year>.</mixed-citation>
</ref>
<ref id="ref-27">
<label>27</label><mixed-citation publication-type="book">
<person-group person-group-type="author"><string-name>
<given-names>A. O.</given-names> 
<surname>Vyas</surname></string-name> and <string-name>
<given-names>S. V.</given-names> 
<surname>Dudul</surname></string-name>
</person-group>, &#x201C;<chapter-title>A novel approach of object oriented image steganography using LSB</chapter-title>,&#x201D; in 
<source>ICDSMLA 2019</source>. 
<publisher-loc>Singapore</publisher-loc>: 
<publisher-name>Springer</publisher-name>, pp. 
<fpage>144</fpage>&#x2013;
<lpage>151</lpage>, 
<year>2020</year>.</mixed-citation>
</ref>
<ref id="ref-28">
<label>28</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>C.</given-names> 
<surname>Balasubramanian</surname></string-name>, <string-name>
<given-names>S.</given-names> 
<surname>Selvakumar</surname></string-name> and <string-name>
<given-names>S.</given-names> 
<surname>Geetha</surname></string-name>
</person-group>, &#x201C;
<article-title>High payload image steganography with reduced distortion using octonary pixel pairing scheme</article-title>,&#x201D; 
<source>Multimedia Tools and Applications</source>, vol. 
<volume>73</volume>, no. 
<issue>3</issue>, pp. 
<fpage>2223</fpage>&#x2013;
<lpage>2245</lpage>, 
<year>2014</year>.</mixed-citation>
</ref>
<ref id="ref-29">
<label>29</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Shen</surname></string-name>, <string-name>
<given-names>L.</given-names> 
<surname>Huang</surname></string-name> and <string-name>
<given-names>Q.</given-names> 
<surname>Tian</surname></string-name>
</person-group>, &#x201C;
<article-title>A novel data hiding for color images based on pixel value difference and modulus function</article-title>,&#x201D; 
<source>Multimedia Tools and Applications</source>, vol. 
<volume>74</volume>, no. 
<issue>3</issue>, pp. 
<fpage>707</fpage>&#x2013;
<lpage>728</lpage>, 
<year>2015</year>.</mixed-citation>
</ref>
<ref id="ref-30">
<label>30</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>G.</given-names> 
<surname>Swain</surname></string-name>
</person-group>, &#x201C;
<article-title>Adaptive pixel value differencing steganography using both vertical and horizontal edges</article-title>,&#x201D; 
<source>Multimedia Tools and Applications</source>, vol. 
<volume>75</volume>, no. 
<issue>21</issue>, pp. 
<fpage>13541</fpage>&#x2013;
<lpage>13556</lpage>, 
<year>2016</year>.</mixed-citation>
</ref>
<ref id="ref-31">
<label>31</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>I. R.</given-names> 
<surname>Grajeda-Mar&#x00ED;n</surname></string-name>, <string-name>
<given-names>H. A.</given-names> 
<surname>Montes-Venegas</surname></string-name>, <string-name>
<given-names>J. R.</given-names> 
<surname>Marcial-Romero</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Hern&#x00E1;ndez-Serv&#x00ED;n</surname></string-name> and <string-name>
<given-names>G.</given-names> 
<surname>De Ita</surname></string-name>
</person-group>, &#x201C;
<article-title>An optimization approach to the TWPVD method for digital image steganography</article-title>,&#x201D; in <conf-name>Mexican Conf. on Pattern Recognition</conf-name>, 
<publisher-name>Springer</publisher-name>, Guanajuato, Mexico, pp. 
<fpage>125</fpage>&#x2013;
<lpage>134</lpage>, 
<year>2016</year>. </mixed-citation>
</ref>
<ref id="ref-32">
<label>32</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>G.</given-names> 
<surname>Swain</surname></string-name>
</person-group>, &#x201C;
<article-title>Adaptive and non-adaptive PVD steganography using overlapped pixel blocks</article-title>,&#x201D; 
<source>Arabian Journal for Science and Engineering</source>, vol. 
<volume>43</volume>, no. 
<issue>12</issue>, pp. 
<fpage>7549</fpage>&#x2013;
<lpage>7562</lpage>, 
<year>2018</year>.</mixed-citation>
</ref>
<ref id="ref-33">
<label>33</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>W. C.</given-names> 
<surname>Kuo</surname></string-name>, <string-name>
<given-names>S. H.</given-names> 
<surname>Kuo</surname></string-name> and <string-name>
<given-names>Y. C.</given-names> 
<surname>Huang</surname></string-name>
</person-group>, &#x201C;
<article-title>Data hiding schemes based on the formal improved exploiting modification direction method</article-title>,&#x201D; 
<source>Applied Mathematics &#x0026; Information Sciences Letters</source>, vol. 
<volume>1</volume>, no. 
<issue>3</issue>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>8</lpage>, 
<year>2013</year>.</mixed-citation>
</ref>
<ref id="ref-34">
<label>34</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>W. C.</given-names> 
<surname>Kuo</surname></string-name>, <string-name>
<given-names>C. C.</given-names> 
<surname>Wang</surname></string-name> and <string-name>
<given-names>H. C.</given-names> 
<surname>Hou</surname></string-name>
</person-group>, &#x201C;
<article-title>Signed digit data hiding scheme</article-title>,&#x201D; 
<source>Information Processing Letters</source>, vol. 
<volume>116</volume>, no. 
<issue>2</issue>, pp. 
<fpage>183</fpage>&#x2013;
<lpage>191</lpage>, 
<year>2016</year>.</mixed-citation>
</ref>
<ref id="ref-35">
<label>35</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>W. C.</given-names> 
<surname>Kuo</surname></string-name>, <string-name>
<given-names>S. H.</given-names> 
<surname>Kuo</surname></string-name>, <string-name>
<given-names>C. C.</given-names> 
<surname>Wang</surname></string-name> and <string-name>
<given-names>L. C.</given-names> 
<surname>Wuu</surname></string-name>
</person-group>, &#x201C;
<article-title>High capacity data hiding scheme based on multi-bit encoding function</article-title>,&#x201D; 
<source>Optik</source>, vol. 
<volume>127</volume>, no. 
<issue>4</issue>, pp. 
<fpage>1762</fpage>&#x2013;
<lpage>1769</lpage>, 
<year>2016</year>.</mixed-citation>
</ref>
<ref id="ref-36">
<label>36</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Geetha</surname></string-name>, <string-name>
<given-names>V.</given-names> 
<surname>Kabilan</surname></string-name>, <string-name>
<given-names>S.</given-names> 
<surname>Chockalingam</surname></string-name> and <string-name>
<given-names>N.</given-names> 
<surname>Kamaraj</surname></string-name>
</person-group>, &#x201C;
<article-title>Varying radix numeral system based adaptive image steganography</article-title>,&#x201D; 
<source>Information Processing Letters</source>, vol. 
<volume>111</volume>, no. 
<issue>16</issue>, pp. 
<fpage>792</fpage>&#x2013;
<lpage>797</lpage>, 
<year>2011</year>.</mixed-citation>
</ref>
<ref id="ref-37">
<label>37</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>W. S.</given-names> 
<surname>Chen</surname></string-name>, <string-name>
<given-names>Y. K.</given-names> 
<surname>Liao</surname></string-name>, <string-name>
<given-names>Y. T.</given-names> 
<surname>Lin</surname></string-name> and <string-name>
<given-names>C. M.</given-names> 
<surname>Wang</surname></string-name>
</person-group>, &#x201C;
<article-title>A novel general multiple-base data embedding algorithm</article-title>,&#x201D; 
<source>Information Sciences</source>, vol. 
<volume>358&#x2013;359</volume>, pp. 
<fpage>164</fpage>&#x2013;
<lpage>190</lpage>, 
<year>2016</year>.</mixed-citation>
</ref>
<ref id="ref-38">
<label>38</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>H.</given-names> 
<surname>Nyeem</surname></string-name>
</person-group>, &#x201C;
<article-title>Reversible data hiding with image bit-plane slicing</article-title>,&#x201D; in <conf-name>2017 20th Int. Conf. of Computer and Information Technology (ICCIT)</conf-name>, Dhaka, Bangladesh, pp. 
<fpage>1</fpage>&#x2013;
<lpage>6</lpage>, 
<year>2017</year>. </mixed-citation>
</ref>
<ref id="ref-39">
<label>39</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>K.</given-names> 
<surname>Muhammad</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Ahmad</surname></string-name>, <string-name>
<given-names>H.</given-names> 
<surname>Farman</surname></string-name>, <string-name>
<given-names>Z.</given-names> 
<surname>Jan</surname></string-name>, <string-name>
<given-names>M.</given-names> 
<surname>Sajjad</surname></string-name> <etal>et al.</etal>
</person-group><italic>,</italic> &#x201C;
<article-title>A secure method for color image steganography using gray-level modification and multi-level encryption</article-title>,&#x201D; 
<source>TIIS</source>, vol. 
<volume>9</volume>, no. 
<issue>5</issue>, pp. 
<fpage>1938</fpage>&#x2013;
<lpage>1962</lpage>, 
<year>2015</year>.</mixed-citation>
</ref>
<ref id="ref-40">
<label>40</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Imaizumi</surname></string-name> and <string-name>
<given-names>K.</given-names> 
<surname>Ozawa</surname></string-name>
</person-group>, &#x201C;
<article-title>Multibit embedding algorithm for steganography of palette-based images</article-title>,&#x201D; in <conf-name>Pacific-Rim Symposium on Image and Video Technology</conf-name>, 
<publisher-name>Springer</publisher-name>, Guanajuato, Mexico, pp. 
<fpage>99</fpage>&#x2013;
<lpage>110</lpage>, 
<year>2013</year>. </mixed-citation>
</ref>
<ref id="ref-41">
<label>41</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>I. F.</given-names> 
<surname>Jafar</surname></string-name>, <string-name>
<given-names>K. A.</given-names> 
<surname>Darabkh</surname></string-name>, <string-name>
<given-names>R. T.</given-names> 
<surname>Al-Zubi</surname></string-name> and <string-name>
<given-names>R. A.</given-names> 
<surname>Al Na&#x2019;mneh</surname></string-name>
</person-group>, &#x201C;
<article-title>Efficient reversible data hiding using multiple predictors</article-title>,&#x201D; 
<source>Computer Journal</source>, vol. 
<volume>59</volume>, no. 
<issue>3</issue>, pp. 
<fpage>423</fpage>&#x2013;
<lpage>438</lpage>, 
<year>2016</year>.</mixed-citation>
</ref>
<ref id="ref-42">
<label>42</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>A.</given-names> 
<surname>Benhfid</surname></string-name> and <string-name>
<given-names>Y.</given-names> 
<surname>Taouil</surname></string-name>
</person-group>, &#x201C;
<article-title>Reversible steganographic method based on interpolation by bivariate linear box-spline on the three directional mesh</article-title>,&#x201D; 
<source>Journal of King Saud University-Computer and Information Sciences</source>, vol. 
<volume>32</volume>, no. 
<issue>7</issue>, pp. 
<fpage>850</fpage>&#x2013;
<lpage>859</lpage>, 
<year>2018</year>.</mixed-citation>
</ref>
<ref id="ref-43">
<label>43</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Baluja</surname></string-name>
</person-group>, &#x201C;
<article-title>Hiding images in plain sight: Deep steganography</article-title>,&#x201D; in <conf-name>Advances in Neural Information Processing Systems</conf-name>, 
<publisher-loc>CA, USA</publisher-loc>, pp. 
<fpage>2069</fpage>&#x2013;
<lpage>2079</lpage>, 
<year>2017</year>. </mixed-citation>
</ref>
<ref id="ref-44">
<label>44</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>J.</given-names> 
<surname>Zhu</surname></string-name>, <string-name>
<given-names>R.</given-names> 
<surname>Kaplan</surname></string-name>, <string-name>
<given-names>J.</given-names> 
<surname>Johnson</surname></string-name> and <string-name>
<given-names>L.</given-names> 
<surname>Fei-Fei</surname></string-name>
</person-group>, &#x201C;
<article-title>Hidden: Hiding data with deep networks</article-title>,&#x201D; in <conf-name>Proc. of the European Conf. on Computer Vision (ECCV)</conf-name>, 
<publisher-loc>Munich, Germany</publisher-loc>, pp. 
<fpage>657</fpage>&#x2013;
<lpage>672</lpage>, 
<year>2018</year>. </mixed-citation>
</ref>
<ref id="ref-45">
<label>45</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>Y.</given-names> 
<surname>Shang</surname></string-name>, <string-name>
<given-names>S.</given-names> 
<surname>Jiang</surname></string-name>, <string-name>
<given-names>D.</given-names> 
<surname>Ye</surname></string-name> and <string-name>
<given-names>J.</given-names> 
<surname>Huang</surname></string-name>
</person-group>, &#x201C;
<article-title>Enhancing the security of deep learning steganography via adversarial examples</article-title>,&#x201D; 
<source>Mathematics</source>, vol. 
<volume>8</volume>, no. 
<issue>9</issue>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>10</lpage>, 
<year>2020</year>.</mixed-citation>
</ref>
<ref id="ref-46">
<label>46</label><mixed-citation publication-type="other">
<person-group person-group-type="author"><string-name>
<given-names>M.</given-names> 
<surname>Sutaone</surname></string-name> and <string-name>
<given-names>M.</given-names> 
<surname>Khandare</surname></string-name>
</person-group>, &#x201C;
<article-title>Image based steganography using LSB insertion</article-title>,&#x201D; IET Int. Conf. on Wireless. 
<year>2008</year>.</mixed-citation>
</ref>
<ref id="ref-47">
<label>47</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>R.</given-names> 
<surname>Chandramouli</surname></string-name> and <string-name>
<given-names>N.</given-names> 
<surname>Memon</surname></string-name>
</person-group>, &#x201C;
<article-title>Analysis of LSB based image steganography techniques</article-title>,&#x201D; in <conf-name>Proc. 2001 Int. Conf. on Image Processing (Cat. No. 01CH37205)</conf-name>, 
<publisher-name>IEEE</publisher-name>, Thessaloniki, Greece, vol. 
<volume>3</volume>, pp. 
<fpage>1019</fpage>&#x2013;
<lpage>1022</lpage>, 
<year>2001</year>. </mixed-citation>
</ref>
<ref id="ref-48">
<label>48</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>V.</given-names> 
<surname>Ajith</surname></string-name>, <string-name>
<given-names>S.</given-names> 
<surname>Kanagaraj</surname></string-name> and <string-name>
<given-names>P.</given-names> 
<surname>Malathi</surname></string-name>
</person-group>, &#x201C;
<article-title>Image steganography based on LSB matching revisited using secret sharing application</article-title>,&#x201D; 
<source>International Journal of Applied Engineering Research</source>, vol.  
<volume>10</volume>, pp. 
<fpage>2931</fpage>&#x2013;
<lpage>2938</lpage>, 
<year>2015</year>.</mixed-citation>
</ref>
<ref id="ref-49">
<label>49</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>W.</given-names> 
<surname>Luo</surname></string-name>, <string-name>
<given-names>F.</given-names> 
<surname>Huang</surname></string-name> and <string-name>
<given-names>J.</given-names> 
<surname>Huang</surname></string-name>
</person-group>, &#x201C;
<article-title>Edge adaptive image steganography based on LSB matching revisited</article-title>,&#x201D; 
<source>IEEE Transactions on Information Forensics and Security</source>, vol. 
<volume>5</volume>, no. 
<issue>2</issue>, pp. 
<fpage>201</fpage>&#x2013;
<lpage>214</lpage>, 
<year>2010</year>.</mixed-citation>
</ref>
<ref id="ref-50">
<label>50</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Chakraborty</surname></string-name>, <string-name>
<given-names>A. S.</given-names> 
<surname>Jalal</surname></string-name> and <string-name>
<given-names>C.</given-names> 
<surname>Bhatnagar</surname></string-name>
</person-group>, &#x201C;
<article-title>LSB based non blind predictive edge adaptive image steganography</article-title>,&#x201D; 
<source>Multimedia Tools and Applications</source>, vol. 
<volume>76</volume>, no. 
<issue>6</issue>, pp. 
<fpage>7973</fpage>&#x2013;
<lpage>7987</lpage>, 
<year>2017</year>.</mixed-citation>
</ref>
<ref id="ref-51">
<label>51</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>H.</given-names> 
<surname>Dadgostar</surname></string-name> and <string-name>
<given-names>F.</given-names> 
<surname>Afsari</surname></string-name>
</person-group>, &#x201C;
<article-title>Image steganography based on interval-valued intuitionistic fuzzy edge detection and modified LSB</article-title>,&#x201D; 
<source>Journal of Information Security and Applications</source>, vol. 
<volume>30</volume>, pp. 
<fpage>94</fpage>&#x2013;
<lpage>104</lpage>, 
<year>2016</year>.</mixed-citation>
</ref>
<ref id="ref-52">
<label>52</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Bhatt</surname></string-name>, <string-name>
<given-names>A.</given-names> 
<surname>Ray</surname></string-name>, <string-name>
<given-names>A.</given-names> 
<surname>Ghosh</surname></string-name> and <string-name>
<given-names>A.</given-names> 
<surname>Ray</surname></string-name>
</person-group>, &#x201C;
<article-title>Image steganography and visible watermarking using LSB extraction technique</article-title>,&#x201D; in <conf-name>2015 IEEE 9th Int. Conf. on Intelligent Systems and Control (ISCO)</conf-name>, 
<publisher-name>IEEE</publisher-name>, Coimbatore, India, pp. 
<fpage>1</fpage>&#x2013;
<lpage>6</lpage>, 
<year>2015</year>. </mixed-citation>
</ref>
<ref id="ref-53">
<label>53</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>T. C.</given-names> 
<surname>Lu</surname></string-name>, <string-name>
<given-names>C. Y.</given-names> 
<surname>Tseng</surname></string-name> and <string-name>
<given-names>J. H.</given-names> 
<surname>Wu</surname></string-name>
</person-group>, &#x201C;
<article-title>Dual imaging-based reversible hiding technique using LSB matching</article-title>,&#x201D; 
<source>Signal Processing</source>, vol. 
<volume>108</volume>, pp. 
<fpage>77</fpage>&#x2013;
<lpage>89</lpage>, 
<year>2015</year>.</mixed-citation>
</ref>
<ref id="ref-54">
<label>54</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>D. C.</given-names> 
<surname>Wu</surname></string-name> and <string-name>
<given-names>W. H.</given-names> 
<surname>Tsai</surname></string-name>
</person-group>, &#x201C;
<article-title>A steganographic method for images by pixel-value differencing</article-title>,&#x201D; 
<source>Pattern Recognition Letters</source>, vol. 
<volume>24</volume>, no. 
<issue>9&#x2013;10</issue>, pp. 
<fpage>1613</fpage>&#x2013;
<lpage>1626</lpage>, 
<year>2003</year>.</mixed-citation>
</ref>
<ref id="ref-55">
<label>55</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>M.</given-names> 
<surname>Hussain</surname></string-name>, <string-name>
<given-names>A. W. A.</given-names> 
<surname>Wahab</surname></string-name>, <string-name>
<given-names>A. T.</given-names> 
<surname>Ho</surname></string-name>, <string-name>
<given-names>N.</given-names> 
<surname>Javed</surname></string-name> and <string-name>
<given-names>K. H.</given-names> 
<surname>Jung</surname></string-name>
</person-group>, &#x201C;
<article-title>A data hiding scheme using parity-bit pixel value differencing and improved rightmost digit replacement</article-title>,&#x201D; 
<source>Signal Processing: Image Communication</source>, vol. 
<volume>50</volume>, pp. 
<fpage>44</fpage>&#x2013;
<lpage>57</lpage>, 
<year>2017</year>.</mixed-citation>
</ref>
<ref id="ref-56">
<label>56</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>X.</given-names> 
<surname>Zhang</surname></string-name> and <string-name>
<given-names>S.</given-names> 
<surname>Wang</surname></string-name>
</person-group>, &#x201C;
<article-title>Vulnerability of pixel-value differencing steganography to histogram analysis and modification for enhanced security</article-title>,&#x201D; 
<source>Pattern Recognition Letters</source>, vol. 
<volume>25</volume>, no. 
<issue>3</issue>, pp. 
<fpage>331</fpage>&#x2013;
<lpage>339</lpage>, 
<year>2004</year>.</mixed-citation>
</ref>
<ref id="ref-57">
<label>57</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>G.</given-names> 
<surname>Swain</surname></string-name>
</person-group>, &#x201C;
<article-title>A steganographic method combining LSB substitution and PVD in a block</article-title>,&#x201D; 
<source>Procedia Computer Science</source>, vol. 
<volume>85</volume>, pp. 
<fpage>39</fpage>&#x2013;
<lpage>44</lpage>, 
<year>2016</year>.</mixed-citation>
</ref>
<ref id="ref-58">
<label>58</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>M.</given-names> 
<surname>Kalita</surname></string-name> and <string-name>
<given-names>T.</given-names> 
<surname>Tuithung</surname></string-name>
</person-group>, &#x201C;
<article-title>A novel steganographic method using 8-neighboring PVD (8nPVD) and LSB substitution</article-title>,&#x201D; in <conf-name>2016 Int. Conf. on Systems, Signals and Image Processing (IWSSIP)</conf-name>, 
<publisher-name>IEEE</publisher-name>, Bratislava, Slovakia, pp. 
<fpage>1</fpage>&#x2013;
<lpage>5</lpage>, 
<year>2016</year>. </mixed-citation>
</ref>
<ref id="ref-59">
<label>59</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>H.</given-names> 
<surname>Sajedi</surname></string-name> and <string-name>
<given-names>M.</given-names> 
<surname>Jamzad</surname></string-name>
</person-group>, &#x201C;
<article-title>Using contourlet transform and cover selection for secure steganography</article-title>,&#x201D; 
<source>International Journal of Information Security</source>, vol. 
<volume>9</volume>, no. 
<issue>5</issue>, pp. 
<fpage>337</fpage>&#x2013;
<lpage>352</lpage>, 
<year>2010</year>.</mixed-citation>
</ref>
<ref id="ref-60">
<label>60</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>C.</given-names> 
<surname>Nisha</surname></string-name> and <string-name>
<given-names>T.</given-names> 
<surname>Monoth</surname></string-name>
</person-group>, &#x201C;
<article-title>Analysis of spatial domain image steganography based on pixel-value differencing method</article-title>,&#x201D; in <conf-name>Soft Computing for Problem Solving</conf-name>, 
<publisher-loc>Singapore</publisher-loc>: 
<publisher-name>Springer</publisher-name>, pp. 
<fpage>385</fpage>&#x2013;
<lpage>397</lpage>, 
<year>2020</year>. </mixed-citation>
</ref>
<ref id="ref-61">
<label>61</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>X.</given-names> 
<surname>Zhang</surname></string-name> and <string-name>
<given-names>S.</given-names> 
<surname>Wang</surname></string-name>
</person-group>, &#x201C;
<article-title>Efficient steganographic embedding by exploiting modification direction</article-title>,&#x201D; 
<source>IEEE Communications Letters</source>, vol. 
<volume>10</volume>, no. 
<issue>11</issue>, pp. 
<fpage>781</fpage>&#x2013;
<lpage>783</lpage>, 
<year>2006</year>.</mixed-citation>
</ref>
<ref id="ref-62">
<label>62</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>T. D.</given-names> 
<surname>Kieu</surname></string-name> and <string-name>
<given-names>C. C.</given-names> 
<surname>Chang</surname></string-name>
</person-group>, &#x201C;
<article-title>A steganographic scheme by fully exploiting modification directions</article-title>,&#x201D; 
<source>Expert Systems with Applications</source>, vol. 
<volume>38</volume>, no. 
<issue>8</issue>, pp. 
<fpage>10648</fpage>&#x2013;
<lpage>10657</lpage>, 
<year>2011</year>.</mixed-citation>
</ref>
<ref id="ref-63">
<label>63</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>W. C.</given-names> 
<surname>Kuo</surname></string-name> and <string-name>
<given-names>M. C.</given-names> 
<surname>Kao</surname></string-name>
</person-group>, &#x201C;
<article-title>A steganographic scheme based on formula fully exploiting modification directions</article-title>,&#x201D; 
<source>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</source>, vol. 
<volume>96</volume>, no. 
<issue>11</issue>, pp. 
<fpage>2235</fpage>&#x2013;
<lpage>2243</lpage>, 
<year>2013</year>.</mixed-citation>
</ref>
<ref id="ref-64">
<label>64</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>X.</given-names> 
<surname>Liao</surname></string-name>, <string-name>
<given-names>Q.</given-names> 
<surname>Wen</surname></string-name> and <string-name>
<given-names>J.</given-names> 
<surname>Zhang</surname></string-name>
</person-group>, &#x201C;
<article-title>A novel steganographic method with four-pixel differencing and exploiting modification direction</article-title>,&#x201D; 
<source>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</source>, vol. 
<volume>95</volume>, no. 
<issue>7</issue>, pp. 
<fpage>1189</fpage>&#x2013;
<lpage>1192</lpage>, 
<year>2012</year>.</mixed-citation>
</ref>
<ref id="ref-65">
<label>65</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>J.</given-names> 
<surname>Fridrich</surname></string-name>, <string-name>
<given-names>M.</given-names> 
<surname>Goljan</surname></string-name> and <string-name>
<given-names>R.</given-names> 
<surname>Du</surname></string-name>
</person-group>, &#x201C;
<article-title>Reliable detection of LSB steganography in color and grayscale images</article-title>,&#x201D; in <conf-name>Proc. of the 2001 Workshop on Multimedia and Security: New Challenges</conf-name>, 
<publisher-loc>Ottawa, Canada</publisher-loc>, pp. 
<fpage>27</fpage>&#x2013;
<lpage>30</lpage>, 
<year>2001</year>. </mixed-citation>
</ref>
<ref id="ref-66">
<label>66</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>B. C.</given-names> 
<surname>Nguyen</surname></string-name>, <string-name>
<given-names>S. M.</given-names> 
<surname>Yoon</surname></string-name> and <string-name>
<given-names>H. K.</given-names> 
<surname>Lee</surname></string-name>
</person-group>, &#x201C;
<article-title>Multi bit plane image steganography</article-title>,&#x201D; in <conf-name>Int. Workshop on Digital Watermarking</conf-name>, 
<publisher-name>Springer</publisher-name>, Jeju Island, Korea, pp. 
<fpage>61</fpage>&#x2013;
<lpage>70</lpage>, 
<year>2006</year>. </mixed-citation>
</ref>
<ref id="ref-67">
<label>67</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>U.</given-names> 
<surname>Ghosh</surname></string-name>, <string-name>
<given-names>D.</given-names> 
<surname>Burman</surname></string-name>, <string-name>
<given-names>S.</given-names> 
<surname>Maity</surname></string-name> and <string-name>
<given-names>I.</given-names> 
<surname>Mukherjee</surname></string-name>
</person-group>, &#x201C;
<article-title>Adaptive multi-bit image steganography using pixel-pair differential approach</article-title>,&#x201D; in <conf-name>Progress in Advanced Computing and Intelligent Engineering</conf-name>, 
<publisher-loc>Singapore</publisher-loc>: 
<publisher-name>Springer</publisher-name>, pp. 
<fpage>47</fpage>&#x2013;
<lpage>56</lpage>, 
<year>2018</year>. </mixed-citation>
</ref>
<ref id="ref-68">
<label>68</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>X.</given-names> 
<surname>Zhang</surname></string-name> and <string-name>
<given-names>S.</given-names> 
<surname>Wang</surname></string-name>
</person-group>, &#x201C;
<article-title>Steganography using multiple-base notational system and human vision sensitivity</article-title>,&#x201D; 
<source>IEEE Signal Processing Letters</source>, vol. 
<volume>12</volume>, no. 
<issue>1</issue>, pp. 
<fpage>67</fpage>&#x2013;
<lpage>70</lpage>, 
<year>2004</year>.</mixed-citation>
</ref>
<ref id="ref-69">
<label>69</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>M.</given-names> 
<surname>Tang</surname></string-name>, <string-name>
<given-names>W.</given-names> 
<surname>Song</surname></string-name>, <string-name>
<given-names>X.</given-names> 
<surname>Chen</surname></string-name> and <string-name>
<given-names>J.</given-names> 
<surname>Hu</surname></string-name>
</person-group>, &#x201C;
<article-title>An image information hiding using adaptation and radix</article-title>,&#x201D; 
<source>Optik</source>, vol. 
<volume>126</volume>, no. 
<issue>23</issue>, pp. 
<fpage>4136</fpage>&#x2013;
<lpage>4141</lpage>, 
<year>2015</year>.</mixed-citation>
</ref>
<ref id="ref-70">
<label>70</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>V. M.</given-names> 
<surname>Potdar</surname></string-name> and <string-name>
<given-names>E.</given-names> 
<surname>Chang</surname></string-name>
</person-group>, &#x201C;
<article-title>Grey level modification steganography for secret communication</article-title>,&#x201D; in <conf-name>2nd IEEE Int. Conf. on Industrial Informatics, 2004</conf-name>, 
<publisher-name>IEEE</publisher-name>, Berlin, Germany, pp. 
<fpage>223</fpage>&#x2013;
<lpage>228</lpage>, 
<year>2004</year>.</mixed-citation>
</ref>
<ref id="ref-71">
<label>71</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>S.</given-names> 
<surname>Mukherjee</surname></string-name> and <string-name>
<given-names>G.</given-names> 
<surname>Sanyal</surname></string-name>
</person-group>, &#x201C;
<article-title>Edge based image steganography with variable threshold</article-title>,&#x201D; 
<source>Multimedia Tools and Applications</source>, vol. 
<volume>78</volume>, no. 
<issue>12</issue>, pp. 
<fpage>16363</fpage>&#x2013;
<lpage>16388</lpage>, 
<year>2019</year>.</mixed-citation>
</ref>
<ref id="ref-72">
<label>72</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>M.</given-names> 
<surname>Safarpour</surname></string-name> and <string-name>
<given-names>M.</given-names> 
<surname>Charmi</surname></string-name>
</person-group>, &#x201C;
<article-title>Capacity enlargement of the PVD steganography method using the GLM technique</article-title>,&#x201D; 
<source>ArXiv Preprint ArXiv:1601.00299</source>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>6</lpage>, 
<year>2016</year>.</mixed-citation>
</ref>
<ref id="ref-73">
<label>73</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>B.</given-names> 
<surname>Chen</surname></string-name> and <string-name>
<given-names>G. W.</given-names> 
<surname>Wornell</surname></string-name>
</person-group>, &#x201C;
<article-title>Quantization index modulation: A class of provably good methods for digital watermarking and information embedding</article-title>,&#x201D; 
<source>IEEE Transactions on Information Theory</source>, vol. 
<volume>47</volume>, no. 
<issue>4</issue>, pp. 
<fpage>1423</fpage>&#x2013;
<lpage>1443</lpage>, 
<year>2001</year>.</mixed-citation>
</ref>
<ref id="ref-74">
<label>74</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>K. L.</given-names> 
<surname>Chung</surname></string-name>, <string-name>
<given-names>C. H.</given-names> 
<surname>Shen</surname></string-name> and <string-name>
<given-names>L. C.</given-names> 
<surname>Chang</surname></string-name>
</person-group>, &#x201C;
<article-title>A novel SVD-and VQ-based image hiding scheme</article-title>,&#x201D; 
<source>Pattern Recognition Letters</source>, vol. 
<volume>22</volume>, no. 
<issue>9</issue>, pp. 
<fpage>1051</fpage>&#x2013;
<lpage>1058</lpage>, 
<year>2001</year>.</mixed-citation>
</ref>
<ref id="ref-75">
<label>75</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>C. C.</given-names> 
<surname>Chang</surname></string-name>, <string-name>
<given-names>T. S.</given-names> 
<surname>Nguyen</surname></string-name> and <string-name>
<given-names>C. C.</given-names> 
<surname>Lin</surname></string-name>
</person-group>, &#x201C;
<article-title>A novel VQ-based reversible data hiding scheme by using hybrid encoding strategies</article-title>,&#x201D; 
<source>Journal of Systems and Software</source>, vol. 
<volume>86</volume>, no. 
<issue>2</issue>, pp. 
<fpage>389</fpage>&#x2013;
<lpage>402</lpage>, 
<year>2013</year>.</mixed-citation>
</ref>
<ref id="ref-76">
<label>76</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>C. C.</given-names> 
<surname>Chang</surname></string-name>, <string-name>
<given-names>T. S.</given-names> 
<surname>Nguyen</surname></string-name> and <string-name>
<given-names>C. C.</given-names> 
<surname>Lin</surname></string-name>
</person-group>, &#x201C;
<article-title>A reversible data hiding scheme for VQ indices using locally adaptive coding</article-title>,&#x201D; 
<source>Journal of Visual Communication and Image Representation</source>, vol. 
<volume>22</volume>, no. 
<issue>7</issue>, pp. 
<fpage>664</fpage>&#x2013;
<lpage>672</lpage>, 
<year>2011</year>.</mixed-citation>
</ref>
<ref id="ref-77">
<label>77</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>C. T.</given-names> 
<surname>Huang</surname></string-name>, <string-name>
<given-names>L. C.</given-names> 
<surname>Lin</surname></string-name>, <string-name>
<given-names>D. E.</given-names> 
<surname>Sun</surname></string-name> and <string-name>
<given-names>S. J.</given-names> 
<surname>Wang</surname></string-name>
</person-group>, &#x201C;
<article-title>A security-based steganographic scheme in vector quantization coding between correlated neighboring blocks</article-title>,&#x201D; 
<source>Multimedia Tools and Applications</source>, vol. 
<volume>78</volume>, no. 
<issue>3</issue>, pp. 
<fpage>3131</fpage>&#x2013;
<lpage>3151</lpage>, 
<year>2019</year>.</mixed-citation>
</ref>
<ref id="ref-78">
<label>78</label><mixed-citation publication-type="conf-proc">
<person-group person-group-type="author"><string-name>
<given-names>M.</given-names> 
<surname>Niimi</surname></string-name>, <string-name>
<given-names>H.</given-names> 
<surname>Noda</surname></string-name>, <string-name>
<given-names>E.</given-names> 
<surname>Kawaguchi</surname></string-name> and <string-name>
<given-names>R. O.</given-names> 
<surname>Eason</surname></string-name>
</person-group>, &#x201C;
<article-title>High capacity and secure digital steganography to palette-based images</article-title>,&#x201D; in <conf-name>Proc. Int. Conf. on Image Processing</conf-name>, 
<publisher-name>IEEE</publisher-name>, NY, USA, vol. 
<volume>2</volume>, pp. 
<fpage>II-II</fpage>, 
<year>2002</year>. </mixed-citation>
</ref>
<ref id="ref-79">
<label>79</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>W.</given-names> 
<surname>Hong</surname></string-name>, <string-name>
<given-names>T. S.</given-names> 
<surname>Chen</surname></string-name> and <string-name>
<given-names>C. W.</given-names> 
<surname>Shiu</surname></string-name>
</person-group>, &#x201C;
<article-title>Reversible data hiding for high quality images using modification of prediction errors</article-title>,&#x201D; 
<source>Journal of Systems and Software</source>, vol. 
<volume>82</volume>, no. 
<issue>11</issue>, pp. 
<fpage>1833</fpage>&#x2013;
<lpage>1842</lpage>, 
<year>2009</year>.</mixed-citation>
</ref>
<ref id="ref-80">
<label>80</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>P.</given-names> 
<surname>Wu</surname></string-name>, <string-name>
<given-names>Y.</given-names> 
<surname>Yang</surname></string-name> and <string-name>
<given-names>X.</given-names> 
<surname>Li</surname></string-name>
</person-group>, &#x201C;
<article-title>Stegnet: Mega image steganography capacity with deep convolutional network</article-title>,&#x201D; 
<source>Future Internet</source>, vol. 
<volume>10</volume>, no. 
<issue>6</issue>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>15</lpage>, 
<year>2018</year>.</mixed-citation>
</ref>
<ref id="ref-81">
<label>81</label><mixed-citation publication-type="journal">
<person-group person-group-type="author"><string-name>
<given-names>K. A.</given-names> 
<surname>Zhang</surname></string-name>, <string-name>
<given-names>A.</given-names> 
<surname>Cuesta-Infante</surname></string-name>, <string-name>
<given-names>L.</given-names> 
<surname>Xu</surname></string-name> and <string-name>
<given-names>K.</given-names> 
<surname>Veeramachaneni</surname></string-name>
</person-group>, &#x201C;
<article-title>SteganoGAN: High capacity image steganography with GANs</article-title>,&#x201D; 
<source>ArXiv Preprint arXiv:1901.03892</source>, pp. 
<fpage>1</fpage>&#x2013;
<lpage>11</lpage>, 
<year>2019</year>.</mixed-citation>
</ref>
</ref-list>
</back>
</article>