<?xml version="1.0" encoding="utf-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">INFORMATICA</journal-id>
<journal-title-group><journal-title>Informatica</journal-title></journal-title-group>
<issn pub-type="epub">1822-8844</issn>
<issn pub-type="ppub">0868-4952</issn>
<issn-l>0868-4952</issn-l>
<publisher>
<publisher-name>Vilnius University</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">INFOR422</article-id>
<article-id pub-id-type="doi">10.15388/20-INFOR422</article-id>
<article-categories><subj-group subj-group-type="heading">
<subject>Research Article</subject></subj-group></article-categories>
<title-group>
<article-title>A Reversible Data Hiding Based on Histogram Shifting of Prediction Errors for Two-Tier Medical Images</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Huang</surname><given-names>Li-Chin</given-names></name><email xlink:href="lsb55239@gmail.com">lsb55239@gmail.com</email><xref ref-type="aff" rid="j_infor422_aff_001">1</xref><bio>
<p><bold>L.-C. Huang</bold> received the BS degree in computer science from Providence University, Taiwan, in 1993 and MS degree in information management from Chaoyang University of Technology (CYUT), Taichung, Taiwan, in 2001, and the PhD degree in computer and information science from National Chung Hsing University (NCHU), Taiwan, in 2001. Her current research interests include information security, cryptography, medical image, data hiding, network, security, big data, and mobile communications.</p></bio>
</contrib>
<contrib contrib-type="author">
<name><surname>Chiou</surname><given-names>Shu-Fen</given-names></name><email xlink:href="fen057@gmail.com">fen057@gmail.com</email><xref ref-type="aff" rid="j_infor422_aff_002">2</xref><bio>
<p><bold>S.-F. Chiou</bold> received a BBA degree in information management from National Taichung Institute of Technology, Taichung, Taiwan, ROC, in 2004. She studied MS degree in computer science and engineering from National Chung Hsing University for one year, and she started to pursue the PhD degree. She received a PhD in computer science and engineering from National Chung Hsing University, in 2012. She is currently an assistant professor of Department of Information Management, National Taichung University of Science and Technology. Her current research interests include information security, network security, data hiding, text mining and big data analysis.</p></bio>
</contrib>
<contrib contrib-type="author">
<name><surname>Hwang</surname><given-names>Min-Shiang</given-names></name><email xlink:href="mshwang@asia.edu.tw">mshwang@asia.edu.tw</email><xref ref-type="aff" rid="j_infor422_aff_003">3</xref><xref ref-type="aff" rid="j_infor422_aff_004">4</xref><xref ref-type="corresp" rid="cor1">∗</xref><bio>
<p><bold>M.-S. Hwang</bold> received MS degree in industrial engineering from National Tsing Hua University, Taiwan, in 1988, and his PhD degree in computer and information science from National Chiao Tung University, Taiwan, in 1995. He was a professor and chairman of the Department of Management Information Systems, NCHU, during 2003–2009. He was also a visiting professor with University of California (UC), Riverside and UC. Davis (USA) during 2009–2010. He was a distinguished professor of Department of Management Information Systems, NCHU, during 2007–2011. He obtained the 1997, 1998, 1999, 2000, and 2001 Excellent Research Award of National Science Council (Taiwan). Dr. Hwang was a dean of college of Computer Science, Asia University (AU), Taichung, Taiwan. He is currently a chair professor with Department of Computer Science and Information Engineering, AU. His current research interests include information security, electronic commerce, database and data security, cryptography, image compression, and mobile computing. Dr. Hwang has published over 300+ articles on the above research fields in international journals.</p></bio>
</contrib>
<aff id="j_infor422_aff_001"><label>1</label>Department of Information Management, <institution>Executive Yuan</institution>, Taipei 10058, <country>Taiwan</country></aff>
<aff id="j_infor422_aff_002"><label>2</label>Department of Department of Information Management, <institution>National Taichung University of Science and Technology</institution>, <country>Taiwan</country></aff>
<aff id="j_infor422_aff_003"><label>3</label>Department of Computer Science &amp; Information Engineering, <institution>Asia University</institution>, Taichung 41354, <country>Taiwan</country></aff>
<aff id="j_infor422_aff_004"><label>4</label>Department of Medical Research, China Medical University Hospital, <institution>China Medical University</institution>, Taichung 40402, <country>Taiwan</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>∗</label>Corresponding author.</corresp>
</author-notes>
<pub-date pub-type="ppub"><year>2021</year></pub-date>
<pub-date pub-type="epub"><day>22</day><month>6</month><year>2020</year></pub-date>
<volume>32</volume><issue>1</issue><fpage>69</fpage><lpage>84</lpage>
<history>
<date date-type="received"><month>9</month><year>2018</year></date>
<date date-type="accepted"><month>5</month><year>2020</year></date>
</history>
<permissions><copyright-statement>© 2021 Vilnius University</copyright-statement><copyright-year>2021</copyright-year>
<license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
<license-p>Open access article under the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/">CC BY</ext-link> license.</license-p></license></permissions>
<abstract>
<p>Clinics and hospitals have already adopted more technological resources to provide a faster and more precise diagnostic for patients, health care providers, and institutes of medicine. Security issues get more and more important in medical services via communication resources such as Wireless-Fidelity (Wi-Fi), third generation of mobile telecommunications technology (3G), and other mobile devices to connect medical systems from anywhere. Furthermore, cloud-based medical systems allow users to access archived medical images from anywhere. In order to protect medical images, lossless data hiding methods are efficient and easy techniques. In this paper, we present a data hiding of two-tier medical images based on histogram shifting of prediction errors. The median histogram shifting technique and prediction error schemes as the two-tier hiding have high capacity and PSNR in 16-bit medical images.</p>
</abstract>
<kwd-group>
<label>Key words</label>
<kwd>lossless data embedding</kwd>
<kwd>reversible data hiding</kwd>
<kwd>histogram</kwd>
<kwd>prediction</kwd>
<kwd>medical image</kwd>
</kwd-group>
<funding-group>
<award-group>
<funding-source xlink:href="https://doi.org/10.13039/501100004663">Ministry of Science and Technology, Taiwan</funding-source>
<award-id>MOST 106-2221-E-468-002</award-id>
</award-group>
<funding-statement>This work was partially supported by the Ministry of Science and Technology, Taiwan, under grant MOST 106-2221-E-468-002. </funding-statement>
</funding-group>
</article-meta>
</front>
<body>
<sec id="j_infor422_s_001">
<label>1</label>
<title>Introduction</title>
<p>Mobile and digital media are getting more and more popular on Internet and cloud services. In social networks, many multi-media such as images, videos, and audios are produced by different aspects of the human activities. Moreover, telemedicine applies telecommunication and information technology to offer clinical health care from a distance. In critical care and emergency situations, health informatics, medical, and imaging data are transmitted from doctors and healthcare professionals to discuss patient issues. Therefore, E-Healthcare data management plays a crucial role in modern hospitals. Over Internet and cloud services, digitized healthcare systems have provided easy access, viewing and sharing of digitized medical images to patients, doctors, medical professionals, health care providers, and institutes of medicine. Medical images may provide for teleconferences among clinicians, interdisciplinary exchanges between radiologists for consultative purposes, and distant learning of medical personnel. For illegal purposes used for insurance, for example, digital medical malignant nodule images may be modified on lung parenchyma in chest CT scan images. Therefore, data hiding schemes (Wang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_035">2017</xref>; Huang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_016">2017</xref>; Li <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_022">2018</xref>; Wang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_036">2018</xref>) are much simpler and cheaper than an intrusion detection system (Huang and Hwang, <xref ref-type="bibr" rid="j_infor422_ref_011">2012</xref>) to protect security and privacy of images by image with an unique digital identity.</p>
<p>Reversible data hiding schemes (Li <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_021">2016</xref>; Huang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_013">2013a</xref>; Chen and Guo, <xref ref-type="bibr" rid="j_infor422_ref_004">2020</xref>; Kim <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_018">2009</xref>) (RDH) are applied to embed secrets inside an image as a stego-image with minimal distortion. After the secrets are retrieved from a stego-image at the extraction stage, the original images can be reconstructed exactly. The major applications of RDH are authentication, diagnostic image, military imagery, astronomical images, satellite, and artwork preservation. Shi <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor422_ref_028">2016</xref>) classified RDH techniques into six categories: histogram shifting, image compressing (e.g., JPEG), semi-fragile authentication, image contrast enhancement, encrypted images, and RDH based on audio and video. In general, there are two types of popular RDH techniques: histogram shifting (HS) (Thodi and Rodriguez, <xref ref-type="bibr" rid="j_infor422_ref_030">2007</xref>; Hong <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_009">2008</xref>) and difference expansion (DE). In 2006, Ni <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor422_ref_025">2006</xref>) proposed the first HS-based RDH by modifying the generated histogram. Some extensions of Ni et al.’s HS-based RDH methods proposed such as block-based HS (Fallahpour and Sedaaghi, <xref ref-type="bibr" rid="j_infor422_ref_007">2007</xref>), difference-histogram (Lee <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_020">2006</xref>), high-frequency IWT coefficients (Xuan <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_041">2007</xref>; Huang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_016">2017</xref>). In 2002, Tian (<xref ref-type="bibr" rid="j_infor422_ref_031">2002</xref>) proposed a high capacity DE method. Furthermore, DE has been developed in three species: integer-to-integer transformation (Qiu <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_026">2016</xref>), prediction-error expansion (PEE) (Dragoi and Coltuc, <xref ref-type="bibr" rid="j_infor422_ref_006">2015</xref>), and adaptive embedding (Hong <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_010">2015</xref>). There are three approaches in image compressing: RDH with quantized DCT coefficients modification (Huang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_015">2016</xref>), RDH with quantization table modification (Wang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_034">2013</xref>), RDH with Huffman table modification (Wu and Deng, <xref ref-type="bibr" rid="j_infor422_ref_037">2011</xref>). In 2003, Vleeschouwer <italic>et al.</italic> (<xref ref-type="bibr" rid="j_infor422_ref_033">2003</xref>) presented the first robust RDH based on the correlations among the neighbouring pixels. In general, the approaches of contrast enhancement RDH applied some functionalities such as histogram bin expansion operations to improve the visual quality. There are four RDH approaches with contrast enhancement: method by histogram bin expansion (Wu <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_039">2015a</xref>), method with contrast enhancement for medical images (Wu <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_040">2015b</xref>), method with the controlled contrast enhancement (Gao and Shi, <xref ref-type="bibr" rid="j_infor422_ref_008">2015</xref>), and automatic contrast enhancement method (Kim <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_019">2015</xref>). Due to protection of the privacy of data and enabling the cloud server to easily manage the data, more and more researchers study reversible data hiding in encrypted images. The techniques of encrypted images are divided into three types: vacating room before encryption (Cao <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_002">2016</xref>), vacating room after encryption (Zhang, <xref ref-type="bibr" rid="j_infor422_ref_042">2011</xref>), and reversible image transformation (Zhang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_044">2016</xref>).</p>
<fig id="j_infor422_fig_001">
<label>Fig. 1</label>
<caption>
<p>The image I is partioned into a set of <inline-formula id="j_infor422_ineq_001"><alternatives>
<mml:math><mml:mn>2</mml:mn><mml:mo>×</mml:mo><mml:mn>2</mml:mn></mml:math>
<tex-math><![CDATA[$2\times 2$]]></tex-math></alternatives></inline-formula> overlapping blocks.</p>
</caption>
<graphic xlink:href="infor422_g001.jpg"/>
</fig>
<p>Considering resource sharing data in Cloud computing environments, stego-images may be disturbed by various techniques such as a chaotic Hénon function to obtain encrypted images (Huang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_014">2013b</xref>). Abbasy and Shanmugam (<xref ref-type="bibr" rid="j_infor422_ref_001">2011</xref>) presented biological aspects of the DNA to increase the level of data confidentiality among clients. Some other authors (Zhang, <xref ref-type="bibr" rid="j_infor422_ref_043">2012</xref>; Surekha and Swamy, <xref ref-type="bibr" rid="j_infor422_ref_029">2013</xref>) converted stego-images into encryption data transferred to public Cloud environments. Based on prediction error expansion, a predictive value is calculated by predictors. Then the secret bit-stream will be embedded into the cover image according to the expansion of the difference between a pixel and its predictive values.</p>
<p>Most of image data hiding techniques (Huang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_012">2012</xref>; Wu <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_038">2009</xref>; Zhang S. <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_045">2016</xref>; Jana <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_017">2016</xref>) are developed in 2D images. However, many medical images are produced and processed (Tseng and Huang, <xref ref-type="bibr" rid="j_infor422_ref_032">2010</xref>) as stacks of slices such as CT, MRI, and PET. These slices can be used to generate 3D image volumetric information. Thus, it is important to apply data hiding in 3D images efficiently. Recently, for digital media it is getting more and more important to apply data hiding to the quality of compressed video. Shanableh (<xref ref-type="bibr" rid="j_infor422_ref_027">2012</xref>) applied data hiding schemes to embed secrets into a compressed video bit stream for copyright protection.</p>
<p>In this paper, two-tier structures, histogram-shifting of median and prediction error, are utilized to embed secret messages. The rest of this paper is presented as follows. The second section demonstrates our method. The fourth section shows the outcome of the experiments. Conclusions are presented in the last section.</p>
</sec>
<sec id="j_infor422_s_002">
<label>2</label>
<title>Proposed Method</title>
<p>In this paper, we apply a block median preservation technique (Luo <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_023">2011</xref>), a prediction-based reversible hiding method (Chang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_003">2012</xref>), and a histogram-based overflow/underflow process (Huang <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_014">2013b</xref>) to embed n bits of secret messages for each block in gray level images. Adopting overlapping blocks partition and a histogram-based overflow/underflow process, the capacity can be improved. Two-tier data hiding will be adopted to embed messages. The detail of a two-tier data hiding scheme is described as follows.</p>
<sec id="j_infor422_s_003">
<label>2.1</label>
<title>Data Embedding</title>
<p>At first, we partition image I into a set of <inline-formula id="j_infor422_ineq_002"><alternatives>
<mml:math><mml:mn>2</mml:mn><mml:mo>×</mml:mo><mml:mn>2</mml:mn></mml:math>
<tex-math><![CDATA[$2\times 2$]]></tex-math></alternatives></inline-formula> sized overlapping blocks as embed blocks shown in Fig. <xref rid="j_infor422_fig_001">1</xref> Then, each overlapping block embeds secret bits by two tier data hider repeatedly. The detail describes as follows Fig. <xref rid="j_infor422_fig_002">2</xref>.</p>
<sec id="j_infor422_s_004">
<label>2.1.1</label>
<title>Tier-1 Data Hiding</title>
<p>In the tier-1 data hiding, we adopt the histogram shifting method (Luo <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_023">2011</xref>) by adjusting the peak point to zero points of the image histogram. The tier-1 data hiding consists of four steps: constructing difference, classifying block type, emptying peak points, and embedding data.</p>
<p><bold>Step 1:</bold> Construct difference</p>
<fig id="j_infor422_fig_002">
<label>Fig. 2</label>
<caption>
<p>Diagram for the framework of two-tier medical image data hiding based on histogram shifting of prediction errors at the sender side.</p>
</caption>
<graphic xlink:href="infor422_g002.jpg"/>
</fig>
<p>At this step, we find median values of each block. Let four pixel values <inline-formula id="j_infor422_ineq_003"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">v</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">j</mml:mi></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${v_{j}}$]]></tex-math></alternatives></inline-formula>, where <inline-formula id="j_infor422_ineq_004"><alternatives>
<mml:math><mml:mn>1</mml:mn><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">j</mml:mi><mml:mo>⩽</mml:mo><mml:mn>4</mml:mn></mml:math>
<tex-math><![CDATA[$1\leqslant j\leqslant 4$]]></tex-math></alternatives></inline-formula>, be retrieved from each difference block. Then these pixel values are sorted in an ascending order <inline-formula id="j_infor422_ineq_005"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>⩽</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>⩽</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>⩽</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${s_{1}}\leqslant {s_{2}}\leqslant {s_{3}}\leqslant {s_{4}}$]]></tex-math></alternatives></inline-formula> . The median of <inline-formula id="j_infor422_ineq_006"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">v</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">m</mml:mi></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${v_{m}}$]]></tex-math></alternatives></inline-formula> is defined as 
<disp-formula id="j_infor422_eq_001">
<alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi mathvariant="italic">v</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mrow><mml:mo fence="true" stretchy="false">⌊</mml:mo><mml:mstyle displaystyle="false"><mml:mfrac><mml:mrow><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mstyle><mml:mo fence="true" stretchy="false">⌋</mml:mo></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="1em"/><mml:mtext>where</mml:mtext><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">p</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mspace width="2.5pt"/><mml:mtext>and</mml:mtext><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">q</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ {v_{m}}={s_{\lfloor \frac{p\times q}{2}\rfloor }},\hspace{1em}\text{where}\hspace{2.5pt}p=2\hspace{2.5pt}\text{and}\hspace{2.5pt}q=2.\]]]></tex-math></alternatives>
</disp-formula> 
In order to construct a difference histogram in the block, we will compute the difference between <inline-formula id="j_infor422_ineq_007"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">v</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">m</mml:mi></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${v_{m}}$]]></tex-math></alternatives></inline-formula> and the other <inline-formula id="j_infor422_ineq_008"><alternatives>
<mml:math><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:math>
<tex-math><![CDATA[$(p\times q)-1$]]></tex-math></alternatives></inline-formula> pixels as follows: 
<disp-formula id="j_infor422_eq_002">
<label>(1)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">v</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">v</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">m</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="1em"/><mml:mtext>where</mml:mtext><mml:mspace width="2.5pt"/><mml:mn>1</mml:mn><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">k</mml:mi><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">k</mml:mi><mml:mo stretchy="false">≠</mml:mo><mml:mi mathvariant="italic">m</mml:mi><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ {d_{k}}={v_{k}}-{v_{m}},\hspace{1em}\text{where}\hspace{2.5pt}1\leqslant k\leqslant p\times q,\hspace{2.5pt}k\ne m.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p><bold>Step 2:</bold> Classify block type</p>
<p>In this step, all blocks will be classified into two types, Type I and Type II. Let <inline-formula id="j_infor422_ineq_009"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${n_{L}}$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor422_ineq_010"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${n_{0}}$]]></tex-math></alternatives></inline-formula> and <inline-formula id="j_infor422_ineq_011"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">R</mml:mi></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${n_{R}}$]]></tex-math></alternatives></inline-formula> be the numbers of pixel values, which are smaller, equal and larger than <inline-formula id="j_infor422_ineq_012"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">v</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">m</mml:mi></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${v_{m}}$]]></tex-math></alternatives></inline-formula> in a block, respectively. Therefore, we will obtain <inline-formula id="j_infor422_ineq_013"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">R</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi></mml:math>
<tex-math><![CDATA[${n_{L}}+{n_{R}}+{n_{0}}=p\times q$]]></tex-math></alternatives></inline-formula> where <italic>p</italic> and <italic>q</italic> are equal to 2. So each block will be labelled with the type number for embedding at this stage. In other words, different kinds of block types will be processed by different embedding procedure.</p>
<p><bold>Step 3:</bold> Empty peak points</p>
<p>Embedding level (EL) is a parameter to adjusting capacity by histogram shifting. Let EL = <italic>i</italic>, the bins of <inline-formula id="j_infor422_ineq_014"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>±</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>±</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>±</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo>+</mml:mo><mml:mn>3</mml:mn><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo><mml:mo>…</mml:mo><mml:mo mathvariant="normal">,</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>±</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mi mathvariant="italic">i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${b_{\pm (i+1)}},{b_{\pm (i+2)}},{b_{\pm (i+3)}},\dots ,{b_{\pm (2i+1)}}$]]></tex-math></alternatives></inline-formula> will be emptied by shifting the bins [<inline-formula id="j_infor422_ineq_015"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>−</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>−</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mtext mathvariant="italic">bit</mml:mtext><mml:mi mathvariant="normal">ˍ</mml:mi><mml:mtext mathvariant="italic">depth</mml:mtext><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${b_{-(i+1)}},{b_{-({2^{\textit{bit}\_ \textit{depth}-1}}-1)}}$]]></tex-math></alternatives></inline-formula>] leftward and [<inline-formula id="j_infor422_ineq_016"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>+</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>+</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mtext mathvariant="italic">bit</mml:mtext><mml:mi mathvariant="normal">ˍ</mml:mi><mml:mtext mathvariant="italic">depth</mml:mtext><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${b_{+(i+1)}},{b_{+({2^{\textit{bit}\_ \textit{depth}-1}})}}$]]></tex-math></alternatives></inline-formula>] rightward where the histogram bins are denoted by <inline-formula id="j_infor422_ineq_017"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>−</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mtext mathvariant="italic">bit</mml:mtext><mml:mi mathvariant="normal">ˍ</mml:mi><mml:mtext mathvariant="italic">depth</mml:mtext><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo><mml:mo>…</mml:mo><mml:mo mathvariant="normal">,</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo><mml:mo>…</mml:mo><mml:mo mathvariant="normal">,</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>+</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mtext mathvariant="italic">bit</mml:mtext><mml:mi mathvariant="normal">ˍ</mml:mi><mml:mtext mathvariant="italic">depth</mml:mtext><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${b_{-({2^{\textit{bit}\_ \textit{depth}-1}}-1)}},\dots ,{b_{0}},\dots ,{b_{+({2^{\textit{bit}\_ \textit{depth}-1}}-1)}}$]]></tex-math></alternatives></inline-formula>. For instance, <inline-formula id="j_infor422_ineq_018"><alternatives>
<mml:math><mml:mi mathvariant="italic">i</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:math>
<tex-math><![CDATA[$i=2$]]></tex-math></alternatives></inline-formula> and bit-depth = 8 will empty the bins <inline-formula id="j_infor422_ineq_019"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>±</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${b_{\pm 3}}$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor422_ineq_020"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>±</mml:mo><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${b_{\pm 4}}$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor422_ineq_021"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>±</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${b_{\pm 5}}$]]></tex-math></alternatives></inline-formula> by shifting the bins <inline-formula id="j_infor422_ineq_022"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mo>−</mml:mo><mml:mn>3</mml:mn><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">t</mml:mi><mml:mo>⩽</mml:mo><mml:mo>−</mml:mo><mml:mn>127</mml:mn></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${b_{-3\leqslant t\leqslant -127}}$]]></tex-math></alternatives></inline-formula> leftward and the bins <inline-formula id="j_infor422_ineq_023"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">b</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">t</mml:mi><mml:mo>⩽</mml:mo><mml:mn>128</mml:mn></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${b_{3\leqslant t\leqslant 128}}$]]></tex-math></alternatives></inline-formula> rightward. These operations are described by the formula as follows: 
<disp-formula id="j_infor422_eq_003">
<label>(2)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable columnspacing="4.0pt" equalrows="false" columnlines="none" equalcolumns="false" columnalign="left left"><mml:mtr><mml:mtd class="array"><mml:msub><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msub><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal">&gt;</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msub><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mo>−</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msub><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal">&lt;</mml:mo><mml:mo>−</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msub><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>otherwise</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ {d^{\prime }_{k}}=\left\{\begin{array}{l@{\hskip4.0pt}l}{d_{k}}+\textit{EL}+1\hspace{1em}& \text{if}\hspace{2.5pt}{d_{k}}>\textit{EL},\\ {} {d_{k}}-\textit{EL}-1\hspace{1em}& \text{if}\hspace{2.5pt}{d_{k}}<-\textit{EL},\\ {} {d_{k}}\hspace{1em}& \text{otherwise},\end{array}\right.\]]]></tex-math></alternatives>
</disp-formula> 
where <inline-formula id="j_infor422_ineq_024"><alternatives>
<mml:math><mml:mn>1</mml:mn><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">k</mml:mi><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi></mml:math>
<tex-math><![CDATA[$1\leqslant k\leqslant p\times q$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor422_ineq_025"><alternatives>
<mml:math><mml:mi mathvariant="italic">k</mml:mi><mml:mo stretchy="false">≠</mml:mo><mml:mi mathvariant="italic">m</mml:mi></mml:math>
<tex-math><![CDATA[$k\ne m$]]></tex-math></alternatives></inline-formula>. 
<disp-formula id="j_infor422_eq_004">
<label>(3)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">j</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable columnspacing="4.0pt" equalrows="false" columnlines="none" equalcolumns="false" columnalign="left left"><mml:mtr><mml:mtd class="array"><mml:msub><mml:mrow><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">j</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msub><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">j</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo mathvariant="normal">&gt;</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msub><mml:mrow><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">j</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msub><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">j</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo mathvariant="normal">&lt;</mml:mo><mml:mo>−</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msub><mml:mrow><mml:mi mathvariant="italic">s</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">j</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>otherwise</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ {s^{\prime }_{k}}(i,j)=\left\{\begin{array}{l@{\hskip4.0pt}l}{s_{k}}(i,j)+\textit{EL}+1\hspace{1em}& \text{if}\hspace{2.5pt}{d_{k}}(i,j)>\textit{EL},\\ {} {s_{k}}(i,j)-\textit{EL}-1\hspace{1em}& \text{if}\hspace{2.5pt}{d_{k}}(i,j)<-\textit{EL},\\ {} {s_{k}}(i,j)\hspace{1em}& \text{otherwise},\end{array}\right.\]]]></tex-math></alternatives>
</disp-formula> 
where <inline-formula id="j_infor422_ineq_026"><alternatives>
<mml:math><mml:mn>1</mml:mn><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">k</mml:mi><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi></mml:math>
<tex-math><![CDATA[$1\leqslant k\leqslant p\times q$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor422_ineq_027"><alternatives>
<mml:math><mml:mi mathvariant="italic">k</mml:mi><mml:mo stretchy="false">≠</mml:mo><mml:mi mathvariant="italic">m</mml:mi></mml:math>
<tex-math><![CDATA[$k\ne m$]]></tex-math></alternatives></inline-formula>.</p>
<p><bold>Step 4:</bold> Embed data</p>
<p>In this step, we apply histogram shifting to differentiate types of blocks. The strategies of the secret embedding are demonstrated as follows:</p>
<p><bold>(1) Type I.</bold></p>
<p>The definition of Type I is 
<disp-formula id="j_infor422_eq_005">
<label>(4)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo fence="true" maxsize="2.03em" minsize="2.03em">⌊</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac><mml:mrow><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mstyle><mml:mo fence="true" maxsize="2.03em" minsize="2.03em">⌋</mml:mo><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="1em"/><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="1em"/><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">R</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo fence="true" maxsize="2.03em" minsize="2.03em">⌊</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac><mml:mrow><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mstyle><mml:mo fence="true" maxsize="2.03em" minsize="2.03em">⌋</mml:mo><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ {n_{L}}=\bigg\lfloor \frac{p\times q}{2}\bigg\rfloor -1,\hspace{1em}{n_{0}}=1,\hspace{1em}{n_{R}}=\bigg\lfloor \frac{p\times q}{2}\bigg\rfloor .\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>The secrets will be embedded as Eq. (<xref rid="j_infor422_eq_005">4</xref>) repeatedly. 
<disp-formula id="j_infor422_eq_006">
<label>(5)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable columnspacing="4.0pt" equalrows="false" columnlines="none" equalcolumns="false" columnalign="left left"><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo>+</mml:mo><mml:mi mathvariant="italic">w</mml:mi><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>−</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo>−</mml:mo><mml:mi mathvariant="italic">w</mml:mi><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mo>−</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ {d^{\prime\prime }_{k}}=\left\{\begin{array}{l@{\hskip4.0pt}l}{d^{\prime }_{k}}+\textit{EL}+w\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime }_{k}}=\textit{EL},\\ {} {d^{\prime }_{k}}-\textit{EL}-w\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime }_{k}}=-\textit{EL},\end{array}\right.\]]]></tex-math></alternatives>
</disp-formula> 
where <inline-formula id="j_infor422_ineq_028"><alternatives>
<mml:math><mml:mn>1</mml:mn><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">k</mml:mi><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi></mml:math>
<tex-math><![CDATA[$1\leqslant k\leqslant p\times q$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor422_ineq_029"><alternatives>
<mml:math><mml:mi mathvariant="italic">k</mml:mi><mml:mo stretchy="false">≠</mml:mo><mml:mi mathvariant="italic">m</mml:mi></mml:math>
<tex-math><![CDATA[$k\ne m$]]></tex-math></alternatives></inline-formula>.</p>
<p><bold>(2) Type II-1.</bold></p>
<p>The definition of block Type II-1 is presented as follows: 
<disp-formula id="j_infor422_eq_007">
<label>(6)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable equalrows="false" equalcolumns="false" columnalign="left"><mml:mtr><mml:mtd class="array"><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>⩾</mml:mo><mml:mn>2</mml:mn><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:mn>0</mml:mn><mml:mo>⩽</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">R</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:msub><mml:mo>⩽</mml:mo><mml:mo fence="true" maxsize="2.03em" minsize="2.03em">⌊</mml:mo><mml:mstyle displaystyle="false"><mml:mfrac><mml:mrow><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mstyle><mml:mo fence="true" maxsize="2.03em" minsize="2.03em">⌋</mml:mo><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ \left\{\begin{array}{l}{n_{0}}\geqslant 2,\\ {} 0\leqslant {n_{R}}={n_{L}}\leqslant \bigg\lfloor \frac{(p\times q)-{n_{0}}}{2}\bigg\rfloor .\end{array}\right.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>We will apply Eq. (<xref rid="j_infor422_eq_007">6</xref>) to embed secrets <italic>w</italic> repeatedly. 
<disp-formula id="j_infor422_eq_008">
<label>(7)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable columnspacing="4.0pt" equalrows="false" columnlines="none" equalcolumns="false" columnalign="left left"><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="italic">t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">v</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">m</mml:mi></mml:mrow></mml:msub><mml:mspace width="2.5pt"/><mml:mtext>and</mml:mtext><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">w</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">v</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">m</mml:mi></mml:mrow></mml:msub><mml:mspace width="2.5pt"/><mml:mtext>and</mml:mtext><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">w</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ {d^{\prime\prime }_{k}}=\left\{\begin{array}{l@{\hskip4.0pt}l}{d^{\prime }_{k}}+{(-1)^{t+1}}\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime }_{k}}={v_{m}}\hspace{2.5pt}\text{and}\hspace{2.5pt}w=1,\\ {} {d^{\prime }_{k}}\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime }_{k}}={v_{m}}\hspace{2.5pt}\text{and}\hspace{2.5pt}w=0,\end{array}\right.\]]]></tex-math></alternatives>
</disp-formula> 
where <inline-formula id="j_infor422_ineq_030"><alternatives>
<mml:math><mml:mn>1</mml:mn><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">k</mml:mi><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi></mml:math>
<tex-math><![CDATA[$1\leqslant k\leqslant p\times q$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor422_ineq_031"><alternatives>
<mml:math><mml:mi mathvariant="italic">k</mml:mi><mml:mo stretchy="false">≠</mml:mo><mml:mi mathvariant="italic">m</mml:mi></mml:math>
<tex-math><![CDATA[$k\ne m$]]></tex-math></alternatives></inline-formula>. t is the number of <inline-formula id="j_infor422_ineq_032"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${n_{0}}$]]></tex-math></alternatives></inline-formula> and <inline-formula id="j_infor422_ineq_033"><alternatives>
<mml:math><mml:mi mathvariant="italic">t</mml:mi><mml:mo>⩾</mml:mo><mml:mn>2</mml:mn></mml:math>
<tex-math><![CDATA[$t\geqslant 2$]]></tex-math></alternatives></inline-formula>. In other words, the first one will not be applied to the formula (<xref rid="j_infor422_eq_007">6</xref>) to embed a bit.</p>
<p><bold>(3) Type II-2.</bold></p>
<p>In a Type II-2 block, the definition is demonstrated as 
<disp-formula id="j_infor422_eq_009">
<label>(8)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt"><mml:mtr><mml:mtd class="align-odd"/><mml:mtd class="align-even"><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable equalrows="false" equalcolumns="false" columnalign="left"><mml:mtr><mml:mtd class="array"><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>⩾</mml:mo><mml:mn>2</mml:mn><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:mn>0</mml:mn><mml:mo>⩽</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal">&lt;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">R</mml:mi></mml:mrow></mml:msub><mml:mo>⩽</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[\begin{aligned}{}& \left\{\begin{array}{l}{n_{0}}\geqslant 2,\\ {} 0\leqslant {n_{L}}<{n_{R}}\leqslant (p\times q)-{n_{0}},\end{array}\right.\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_infor422_eq_010">
<label>(9)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt"><mml:mtr><mml:mtd class="align-odd"/><mml:mtd class="align-even"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable columnspacing="4.0pt" equalrows="false" columnlines="none" equalcolumns="false" columnalign="left left"><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">w</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">t</mml:mi><mml:mo mathvariant="normal">&lt;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">R</mml:mi></mml:mrow></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="italic">t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">w</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">t</mml:mi><mml:mo>⩾</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">R</mml:mi></mml:mrow></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">w</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[\begin{aligned}{}& {d^{\prime\prime }_{k}}=\left\{\begin{array}{l@{\hskip4.0pt}l}{d^{\prime }_{k}}-1\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime }_{k}}=0,\hspace{2.5pt}w=1,\hspace{2.5pt}t<{n_{R}}-{n_{L}},\\ {} {d^{\prime }_{k}}+{(-1)^{t+1}}\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime }_{k}}=0,\hspace{2.5pt}w=1,\hspace{2.5pt}t\geqslant {n_{R}}-{n_{L}},\\ {} {d^{\prime }_{k}}\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime }_{k}}=0,\hspace{2.5pt}w=0,\end{array}\right.\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
where <inline-formula id="j_infor422_ineq_034"><alternatives>
<mml:math><mml:mn>1</mml:mn><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">k</mml:mi><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi></mml:math>
<tex-math><![CDATA[$1\leqslant k\leqslant p\times q$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor422_ineq_035"><alternatives>
<mml:math><mml:mi mathvariant="italic">k</mml:mi><mml:mo stretchy="false">≠</mml:mo><mml:mi mathvariant="italic">m</mml:mi></mml:math>
<tex-math><![CDATA[$k\ne m$]]></tex-math></alternatives></inline-formula>. t is the number of <inline-formula id="j_infor422_ineq_036"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${n_{0}}$]]></tex-math></alternatives></inline-formula>.</p>
<p><bold>(4) Type II-3.</bold></p>
<p>In a Type II-3 block, the definition is demonstrated as 
<disp-formula id="j_infor422_eq_011">
<label>(10)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt"><mml:mtr><mml:mtd class="align-odd"/><mml:mtd class="align-even"><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable equalrows="false" equalcolumns="false" columnalign="left"><mml:mtr><mml:mtd class="array"><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>⩾</mml:mo><mml:mn>2</mml:mn><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:mn>0</mml:mn><mml:mo>⩽</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">R</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal">&lt;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:msub><mml:mo>⩽</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[\begin{aligned}{}& \left\{\begin{array}{l}{n_{0}}\geqslant 2,\\ {} 0\leqslant {n_{R}}<{n_{L}}\leqslant (p\times q)-{n_{0}},\end{array}\right.\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_infor422_eq_012">
<label>(11)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt"><mml:mtr><mml:mtd class="align-odd"/><mml:mtd class="align-even"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable columnspacing="4.0pt" equalrows="false" columnlines="none" equalcolumns="false" columnalign="left left"><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">w</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">t</mml:mi><mml:mo>⩽</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">R</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>−</mml:mo><mml:msup><mml:mrow><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="italic">t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">w</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">t</mml:mi><mml:mo mathvariant="normal">&gt;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">R</mml:mi></mml:mrow></mml:msub><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">w</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[\begin{aligned}{}& {d^{\prime\prime }_{k}}=\left\{\begin{array}{l@{\hskip4.0pt}l}{d^{\prime }_{k}}+1\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime }_{k}}=0,\hspace{2.5pt}w=1,\hspace{2.5pt}t\leqslant {n_{L}}-{n_{R}},\\ {} {d^{\prime }_{k}}-{(-1)^{t+1}}\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime }_{k}}=0,\hspace{2.5pt}w=1,\hspace{2.5pt}t>{n_{L}}-{n_{R}},\\ {} {d^{\prime }_{k}}\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime }_{k}}=0,\hspace{2.5pt}w=0,\end{array}\right.\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
where <inline-formula id="j_infor422_ineq_037"><alternatives>
<mml:math><mml:mn>1</mml:mn><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">k</mml:mi><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi></mml:math>
<tex-math><![CDATA[$1\leqslant k\leqslant p\times q$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor422_ineq_038"><alternatives>
<mml:math><mml:mi mathvariant="italic">k</mml:mi><mml:mo stretchy="false">≠</mml:mo><mml:mi mathvariant="italic">m</mml:mi></mml:math>
<tex-math><![CDATA[$k\ne m$]]></tex-math></alternatives></inline-formula>. t is the number of <inline-formula id="j_infor422_ineq_039"><alternatives>
<mml:math><mml:msub><mml:mrow><mml:mi mathvariant="italic">n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math>
<tex-math><![CDATA[${n_{0}}$]]></tex-math></alternatives></inline-formula>.</p>
</sec>
<sec id="j_infor422_s_005">
<label>2.1.2</label>
<title>Tier-2 Data Hiding</title>
<p>In order to adjust the quality of stego-image, we apply threshold in the embedding process. Let a set of <inline-formula id="j_infor422_ineq_040"><alternatives>
<mml:math><mml:mn>2</mml:mn><mml:mo>×</mml:mo><mml:mn>2</mml:mn></mml:math>
<tex-math><![CDATA[$2\times 2$]]></tex-math></alternatives></inline-formula> sized block have four elements <inline-formula id="j_infor422_ineq_041"><alternatives>
<mml:math><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">a</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">b</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">c</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">d</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math>
<tex-math><![CDATA[$(a,b,c,d)$]]></tex-math></alternatives></inline-formula> shown in Fig. <xref rid="j_infor422_fig_001">1</xref>. Assume the difference value (DV) is <inline-formula id="j_infor422_ineq_042"><alternatives>
<mml:math><mml:msubsup><mml:mrow><mml:mo largeop="false" movablelimits="false">∑</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="italic">t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msubsup><mml:mo stretchy="false">|</mml:mo><mml:msub><mml:mrow><mml:mtext>element</mml:mtext></mml:mrow><mml:mrow><mml:mi mathvariant="italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mrow><mml:mtext>element</mml:mtext></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">|</mml:mo></mml:math>
<tex-math><![CDATA[${\textstyle\sum _{t=1}^{3}}|{\text{element}_{i}}-{\text{element}_{4}}|$]]></tex-math></alternatives></inline-formula>. When DV ⩽ threshold, the Tier-2 data hiding will be performed. The details of Tier-2 data hiding are described as follows.</p>
<p><bold>Step 1:</bold> Compute the prediction pixel value 
<disp-formula id="j_infor422_eq_013">
<label>(12)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mo stretchy="false">ˆ</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable columnspacing="4.0pt" equalrows="false" columnlines="none" equalcolumns="false" columnalign="left left"><mml:mtr><mml:mtd class="array"><mml:mo movablelimits="false">min</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">c</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">d</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">b</mml:mi><mml:mo>⩾</mml:mo><mml:mo movablelimits="false">max</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">c</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">d</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:mo movablelimits="false">max</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">c</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">d</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">b</mml:mi><mml:mo>⩽</mml:mo><mml:mo movablelimits="false">min</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">c</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">d</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:mi mathvariant="italic">c</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="italic">d</mml:mi><mml:mo>−</mml:mo><mml:mi mathvariant="italic">b</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>otherwise</mml:mtext><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ \hat{p}=\left\{\begin{array}{l@{\hskip4.0pt}l}\min (c,d),\hspace{1em}& \text{if}\hspace{2.5pt}b\geqslant \max (c,d),\\ {} \max (c,d),\hspace{1em}& \text{if}\hspace{2.5pt}b\leqslant \min (c,d),\\ {} c+d-b,\hspace{1em}& \text{otherwise}.\end{array}\right.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p><bold>Step 2:</bold> Compute the prediction error <italic>e</italic></p>
<p>Let predict pixel <italic>p</italic> be an element <italic>a</italic> 
<disp-formula id="j_infor422_eq_014">
<label>(13)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mi mathvariant="italic">e</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>−</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mo stretchy="false">ˆ</mml:mo></mml:mover><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ e=p-\hat{p}.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p><bold>Step 3:</bold> Data embedding 
<disp-formula id="j_infor422_eq_015">
<label>(14)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mover accent="true"><mml:mrow><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mo stretchy="false">˜</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mo stretchy="false">ˆ</mml:mo></mml:mover><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mo>×</mml:mo><mml:mi mathvariant="italic">e</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="italic">w</mml:mi><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ \tilde{p}=\hat{p}+2\times e+w,\]]]></tex-math></alternatives>
</disp-formula> 
where <italic>w</italic> is the secret bit.</p>
<p><bold>Step 4:</bold> Overflow/Underflow process</p>
<p>In order to restore the cover image correctly, we process the overflow/underflow by the shifting histogram from the embedding stage without a location map or compression (Kim <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_018">2009</xref>). At first, we compute the utilization rate of the medical image which consists of intensity rate and underflow/overflow rate. In order to get the intensity rate, we divide the range of intensity by 2 to the power of bit depth. The range of intensity is the difference in the intensity of the cover image between max value and min value. Bit depth is the image quality expressing how many unique shades are available. Images with higher bit depths are able to encode more intensities because there are combinations of 0’s and 1’s available. 
<disp-formula id="j_infor422_eq_016">
<label>(15)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt"><mml:mtr><mml:mtd class="align-odd"/><mml:mtd class="align-even"><mml:mtext>Intensity rate</mml:mtext><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac><mml:mrow><mml:mtext>The range of intensity</mml:mtext></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:msup><mml:mrow/><mml:mrow><mml:mtext>bit</mml:mtext><mml:mi mathvariant="normal">ˍ</mml:mi><mml:mtext>depth</mml:mtext></mml:mrow></mml:msup></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mstyle><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[\begin{aligned}{}& \text{Intensity rate}=\frac{\text{The range of intensity}}{{2^{{^{\text{bit}\_ \text{depth}}}}}},\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_infor422_eq_017">
<label>(16)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt"><mml:mtr><mml:mtd class="align-odd"/><mml:mtd class="align-even"><mml:mtext>Underflow</mml:mtext><mml:mo mathvariant="normal" stretchy="false">/</mml:mo><mml:mtext>Overflow rate</mml:mtext><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac><mml:mrow><mml:mtext>Value of under flow</mml:mtext><mml:mo mathvariant="normal" stretchy="false">/</mml:mo><mml:mtext>overflow</mml:mtext></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mtext>bit</mml:mtext><mml:mi mathvariant="normal">ˍ</mml:mi><mml:mtext>depth</mml:mtext></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mstyle><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[\begin{aligned}{}& \text{Underflow}/\text{Overflow rate}=\frac{\text{Value of under flow}/\text{overflow}}{{2^{\text{bit}\_ \text{depth}}}},\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_infor422_eq_018">
<label>(17)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt"><mml:mtr><mml:mtd class="align-odd"/><mml:mtd class="align-even"><mml:mtext>The utilization rate</mml:mtext><mml:mo>=</mml:mo><mml:mo stretchy="false">|</mml:mo><mml:mtext>intensity rate</mml:mtext><mml:mo stretchy="false">|</mml:mo><mml:mo>+</mml:mo><mml:mo stretchy="false">|</mml:mo><mml:mtext>underflow</mml:mtext><mml:mo mathvariant="normal" stretchy="false">/</mml:mo><mml:mtext>overflow rate</mml:mtext><mml:mo stretchy="false">|</mml:mo><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[\begin{aligned}{}& \text{The utilization rate}=|\text{intensity rate}|+|\text{underflow}/\text{overflow rate}|.\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>Further, we adjust image histograms to prevent overflow/underflow problems. On low underflow/overflow rates of high bit-depth medical images, unsinged bit images will produce underflow problems.</p>
<p>Because modern medical devices provide high quality images, medical images can range from 0 to 65535 for a 16-bit image. Therefore, the utilization rate of 16-bit depth is lower than 8-bit depth shown in equations (<xref rid="j_infor422_eq_016">15</xref>), (<xref rid="j_infor422_eq_017">16</xref>). In other words, we can utilize empty histogram bin to process overflow/underflow problem by shifting histogram of the whole image.</p>
<p>In respect of preserving boundary pixels, our method can restore the original-image from the stego-image successfully. Thus, the boundary pixels will be preserved. After the process of embedding, our method also can preserve the boundary pixels shown in Fig. <xref rid="j_infor422_fig_005">5</xref>. The 16-bit depth unsigned images are tested with threshold 21. In Fig. <xref rid="j_infor422_fig_005">5</xref>(b) and (c) the preserved boundary of the medical image when EL are changed from 5 to 20 is shown. In the same way, another test of the preserved boundary is shown in Fig. <xref rid="j_infor422_fig_005">5</xref>(e), (f).</p>
</sec>
</sec>
<sec id="j_infor422_s_006">
<label>2.2</label>
<title>Data Extraction</title>
<fig id="j_infor422_fig_003">
<label>Fig. 3</label>
<caption>
<p>Diagram for the framework of two-tier medical image data extraction based on histogram shifting of prediction errors at receiver side.</p>
</caption>
<graphic xlink:href="infor422_g003.jpg"/>
</fig>
<p>In order to extract data, we need the embedding level and overflow/underflow distance as parameters. The data extraction will extract secret messages correctly and restore the stego-image back to the original without any distortions, described in detail below as shown in Fig. <xref rid="j_infor422_fig_003">3</xref> Similar to the data embedding process, we partition the stego-image into overlaying blocks with <inline-formula id="j_infor422_ineq_043"><alternatives>
<mml:math><mml:mn>2</mml:mn><mml:mo>×</mml:mo><mml:mn>2</mml:mn></mml:math>
<tex-math><![CDATA[$2\times 2$]]></tex-math></alternatives></inline-formula> block-size at the first step. The extraction process comes in the reverse direction of the embedding. Thus, the start block of the extraction comes from the right side of the bottom image. At the same time, the extrication direction follows the principle of right-to-left and bottom-to-top. After the block partition, each block will perform two tier data extraction to obtain secrets repeatedly. The detail is described as follows.</p>
<sec id="j_infor422_s_007">
<label>2.2.1</label>
<title>Tier-2 Data Extraction</title>
<p>In tier-2 data extraction, we perform the extraction of prediction-based reversible data hiding method. There are four stages: inverting overflow/underflow process, predicting pixel value, predicting error <italic>e</italic>, and extracting secrets. At the first stage, we adopt histogram shifting with distance overflow/underflow to invert overflow/underflow process. At the predict pixel value stage, we construct a difference block like in the Tier-1 data hiding, step 2. Then we apply the formula (<xref rid="j_infor422_eq_012">11</xref>) to obtain the predicted pixel value <inline-formula id="j_infor422_ineq_044"><alternatives>
<mml:math><mml:mover accent="true"><mml:mrow><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mo stretchy="false">ˆ</mml:mo></mml:mover></mml:math>
<tex-math><![CDATA[$\hat{p}$]]></tex-math></alternatives></inline-formula>. And we get the extracted pixel <inline-formula id="j_infor422_ineq_045"><alternatives>
<mml:math><mml:mover accent="true"><mml:mrow><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mo stretchy="false">˜</mml:mo></mml:mover></mml:math>
<tex-math><![CDATA[$\tilde{p}$]]></tex-math></alternatives></inline-formula> at the left-top element of a <inline-formula id="j_infor422_ineq_046"><alternatives>
<mml:math><mml:mn>2</mml:mn><mml:mo>×</mml:mo><mml:mn>2</mml:mn></mml:math>
<tex-math><![CDATA[$2\times 2$]]></tex-math></alternatives></inline-formula> block. Then the formula (<xref rid="j_infor422_eq_013">12</xref>) is adopted to obtain predicted error <inline-formula id="j_infor422_ineq_047"><alternatives>
<mml:math><mml:msup><mml:mrow><mml:mi mathvariant="italic">e</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msup></mml:math>
<tex-math><![CDATA[${e^{\prime }}$]]></tex-math></alternatives></inline-formula> in predicted error <inline-formula id="j_infor422_ineq_048"><alternatives>
<mml:math><mml:msup><mml:mrow><mml:mi mathvariant="italic">e</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msup></mml:math>
<tex-math><![CDATA[${e^{\prime }}$]]></tex-math></alternatives></inline-formula> stage. The stage of extracting secrets applies <inline-formula id="j_infor422_ineq_049"><alternatives>
<mml:math><mml:msup><mml:mrow><mml:mi mathvariant="italic">e</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msup></mml:math>
<tex-math><![CDATA[${e^{\prime }}$]]></tex-math></alternatives></inline-formula> to compute the original pixel by <inline-formula id="j_infor422_ineq_050"><alternatives>
<mml:math><mml:mi mathvariant="italic">p</mml:mi><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mo stretchy="false">ˆ</mml:mo></mml:mover><mml:mo>+</mml:mo><mml:mo fence="true" stretchy="false">⌊</mml:mo><mml:mstyle displaystyle="false"><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="italic">e</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:mstyle><mml:mo fence="true" stretchy="false">⌋</mml:mo></mml:math>
<tex-math><![CDATA[$p=\hat{p}+\lfloor \frac{{e^{\prime }}}{2}\rfloor $]]></tex-math></alternatives></inline-formula>. And the secret bit is extracted by <inline-formula id="j_infor422_ineq_051"><alternatives>
<mml:math><mml:mi mathvariant="italic">w</mml:mi><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mo stretchy="false">˜</mml:mo></mml:mover><mml:mo>−</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mo stretchy="false">ˆ</mml:mo></mml:mover><mml:mo>−</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo>×</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>−</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi mathvariant="italic">p</mml:mi></mml:mrow><mml:mo stretchy="false">˜</mml:mo></mml:mover><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math>
<tex-math><![CDATA[$w=\tilde{p}-\hat{p}-(2\times (p-\tilde{p}))$]]></tex-math></alternatives></inline-formula>. After extracting secrets, we restore the intermediate image block <inline-formula id="j_infor422_ineq_052"><alternatives>
<mml:math><mml:msup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mo>‴</mml:mo></mml:mrow></mml:msup></mml:math>
<tex-math><![CDATA[${d^{\prime\prime\prime }}$]]></tex-math></alternatives></inline-formula> for tier-2 data extraction.</p>
</sec>
<sec id="j_infor422_s_008">
<label>2.2.2</label>
<title>Tier-1 Data Extraction</title>
<p>There are three stages: extracting secrets, inversing histogram shifting, and inversing empty bin in tier-2 data extraction demonstrated as follows.</p>
<p><bold>a.</bold> Extracting secrets</p>
<p>In order to extract secrets and restore the original image, we apply histogram shifting to the intermediate image block from tier-1 data extraction at this stage. Let the elements of the intermediate block be <inline-formula id="j_infor422_ineq_053"><alternatives>
<mml:math><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>‴</mml:mo></mml:mrow></mml:msubsup></mml:math>
<tex-math><![CDATA[${d^{\prime\prime\prime }_{k}}$]]></tex-math></alternatives></inline-formula>, where <inline-formula id="j_infor422_ineq_054"><alternatives>
<mml:math><mml:mn>1</mml:mn><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">k</mml:mi><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi></mml:math>
<tex-math><![CDATA[$1\leqslant k\leqslant p\times q$]]></tex-math></alternatives></inline-formula>, <inline-formula id="j_infor422_ineq_055"><alternatives>
<mml:math><mml:mi mathvariant="italic">k</mml:mi><mml:mo stretchy="false">≠</mml:mo><mml:mi mathvariant="italic">m</mml:mi></mml:math>
<tex-math><![CDATA[$k\ne m$]]></tex-math></alternatives></inline-formula>. Set EL = 0 and scan all elements <inline-formula id="j_infor422_ineq_056"><alternatives>
<mml:math><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>‴</mml:mo></mml:mrow></mml:msubsup></mml:math>
<tex-math><![CDATA[${d^{\prime\prime\prime }_{k}}$]]></tex-math></alternatives></inline-formula>. If <inline-formula id="j_infor422_ineq_057"><alternatives>
<mml:math><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>‴</mml:mo></mml:mrow></mml:msubsup></mml:math>
<tex-math><![CDATA[${d^{\prime\prime\prime }_{k}}$]]></tex-math></alternatives></inline-formula> is equal to 1 or −1, a secret bit 1 will be extracted. If <inline-formula id="j_infor422_ineq_058"><alternatives>
<mml:math><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>‴</mml:mo></mml:mrow></mml:msubsup></mml:math>
<tex-math><![CDATA[${d^{\prime\prime\prime }_{k}}$]]></tex-math></alternatives></inline-formula> is equal to 0, a secret bit is 0. 
<disp-formula id="j_infor422_eq_019">
<label>(18)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mi mathvariant="italic">w</mml:mi><mml:mo>=</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable columnspacing="4.0pt" equalrows="false" columnlines="none" equalcolumns="false" columnalign="left left"><mml:mtr><mml:mtd class="array"><mml:mn>1</mml:mn><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo stretchy="false">∈</mml:mo><mml:mo fence="true" stretchy="false">{</mml:mo><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal">,</mml:mo><mml:mn>1</mml:mn><mml:mo fence="true" stretchy="false">}</mml:mo><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:mn>0</mml:mn><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ w=\left\{\begin{array}{l@{\hskip4.0pt}l}1\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime\prime }_{k}}\in \{-1,1\},\\ {} 0\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime\prime }_{k}}=0.\end{array}\right.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>Next step, repeat n times when EL is equal to <italic>n</italic>. In the case EL = 1, <inline-formula id="j_infor422_ineq_059"><alternatives>
<mml:math><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>‴</mml:mo></mml:mrow></mml:msubsup></mml:math>
<tex-math><![CDATA[${d^{\prime\prime\prime }_{k}}$]]></tex-math></alternatives></inline-formula> is ±3 and will extract secret bit “1”. And <inline-formula id="j_infor422_ineq_060"><alternatives>
<mml:math><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>‴</mml:mo></mml:mrow></mml:msubsup></mml:math>
<tex-math><![CDATA[${d^{\prime\prime\prime }_{k}}$]]></tex-math></alternatives></inline-formula> is ±2 and will extract secret bit “0”. In the case EL = 2, <inline-formula id="j_infor422_ineq_061"><alternatives>
<mml:math><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>‴</mml:mo></mml:mrow></mml:msubsup></mml:math>
<tex-math><![CDATA[${d^{\prime\prime\prime }_{k}}$]]></tex-math></alternatives></inline-formula> is ±5 and will extract secret bit “1”. And <inline-formula id="j_infor422_ineq_062"><alternatives>
<mml:math><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>‴</mml:mo></mml:mrow></mml:msubsup></mml:math>
<tex-math><![CDATA[${d^{\prime\prime\prime }_{k}}$]]></tex-math></alternatives></inline-formula> is ±4 and will extract secret bit “0”.</p>
<p><bold>b.</bold> Inversing histogram shifting</p>
<p>According to Embedding level (EL), there are different strategies to inverse histogram described as follows.</p>
<p>If EL = 0, 
<disp-formula id="j_infor422_eq_020">
<label>(19)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable columnspacing="4.0pt" equalrows="false" columnlines="none" equalcolumns="false" columnalign="left left"><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ {d^{\prime }_{k}}=\left\{\begin{array}{l@{\hskip4.0pt}l}{d^{\prime\prime }_{k}}+1\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime\prime }_{k}}=-1,\\ {} {d^{\prime\prime }_{k}}-1\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime\prime }_{k}}=1,\\ {} {d^{\prime\prime }_{k}}\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime\prime }_{k}}=0.\end{array}\right.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>If EL &gt; 0, 
<disp-formula id="j_infor422_eq_021">
<label>(20)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable columnspacing="4.0pt" equalrows="false" columnlines="none" equalcolumns="false" columnalign="left left"><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>−</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>−</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mi mathvariant="italic">E</mml:mi><mml:mi mathvariant="italic">L</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mo>−</mml:mo><mml:mn>2</mml:mn><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi mathvariant="italic">E</mml:mi><mml:mi mathvariant="italic">L</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>″</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mo>−</mml:mo><mml:mn>2</mml:mn><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ {d^{\prime }_{k}}=\left\{\begin{array}{l@{\hskip4.0pt}l}{d^{\prime\prime }_{k}}-\textit{EL}\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime\prime }_{k}}=2\textit{EL},\\ {} {d^{\prime\prime }_{k}}-\textit{EL}-1\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime\prime }_{k}}=2EL+1,\\ {} {d^{\prime\prime }_{k}}+\textit{EL}\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime\prime }_{k}}=-2\textit{EL},\\ {} {d^{\prime\prime }_{k}}+EL+1\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime\prime }_{k}}=-2\textit{EL}+1.\end{array}\right.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p><bold>c.</bold> Inversing empty bin</p>
<p>If EL is greater than 0, we perform the inversion of empty bin according to the following formula: 
<disp-formula id="j_infor422_eq_022">
<label>(21)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable columnspacing="4.0pt" equalrows="false" columnlines="none" equalcolumns="false" columnalign="left left"><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>−</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo mathvariant="normal">&gt;</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>if</mml:mtext><mml:mspace width="2.5pt"/><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mo mathvariant="normal">&lt;</mml:mo><mml:mtext mathvariant="italic">EL</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array"><mml:msubsup><mml:mrow><mml:mi mathvariant="italic">d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">k</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msubsup><mml:mspace width="1em"/></mml:mtd><mml:mtd class="array"><mml:mtext>otherwise</mml:mtext><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced><mml:mspace width="1em"/><mml:mtext>where</mml:mtext><mml:mspace width="2.5pt"/><mml:mn>1</mml:mn><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">k</mml:mi><mml:mo>⩽</mml:mo><mml:mi mathvariant="italic">p</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">q</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mspace width="2.5pt"/><mml:mi mathvariant="italic">k</mml:mi><mml:mo stretchy="false">≠</mml:mo><mml:mi mathvariant="italic">m</mml:mi><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[ {d_{k}}=\left\{\begin{array}{l@{\hskip4.0pt}l}{d^{\prime }_{k}}-\textit{EL}\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime }_{k}}>\textit{EL},\\ {} {d^{\prime }_{k}}+\textit{EL}\hspace{1em}& \text{if}\hspace{2.5pt}{d^{\prime }_{k}}<\textit{EL},\\ {} {d^{\prime }_{k}}\hspace{1em}& \text{otherwise},\end{array}\right.\hspace{1em}\text{where}\hspace{2.5pt}1\leqslant k\leqslant p\times q,\hspace{2.5pt}k\ne m.\]]]></tex-math></alternatives>
</disp-formula>
</p>
<p>After inversing empty bin, we add a median value of a block to elements of the block. Finally, we construct each block as the original image.</p>
</sec>
</sec>
</sec>
<sec id="j_infor422_s_009">
<label>3</label>
<title>Experimental Results</title>
<p>In this paper, we demonstrate two-tier medical images data hiding based on histogram shifting of prediction errors to experiment on medical images with DICOM. The peak signal-to-noise ratio (PSNR) is applied to measure the quality. 
<disp-formula id="j_infor422_eq_023">
<label>(22)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt"><mml:mtr><mml:mtd class="align-odd"/><mml:mtd class="align-even"><mml:mtext mathvariant="italic">PSNR</mml:mtext><mml:mo>=</mml:mo><mml:mn>10</mml:mn><mml:mo>×</mml:mo><mml:msub><mml:mrow><mml:mo movablelimits="false">log</mml:mo></mml:mrow><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub><mml:mstyle displaystyle="true"><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mn>255</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mtext mathvariant="italic">MSE</mml:mtext></mml:mrow></mml:mfrac></mml:mstyle><mml:mspace width="2.5pt"/><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mtext>dB</mml:mtext><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[\begin{aligned}{}& \textit{PSNR}=10\times {\log _{10}}\frac{{255^{2}}}{\textit{MSE}}\hspace{2.5pt}(\text{dB}),\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
<disp-formula id="j_infor422_eq_024">
<label>(23)</label><alternatives>
<mml:math display="block"><mml:mtable displaystyle="true" columnalign="right left" columnspacing="0pt"><mml:mtr><mml:mtd class="align-odd"/><mml:mtd class="align-even"><mml:mtext mathvariant="italic">MSE</mml:mtext><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="italic">W</mml:mi><mml:mo>×</mml:mo><mml:mi mathvariant="italic">H</mml:mi></mml:mrow></mml:mfrac></mml:mstyle>
<mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mstyle displaystyle="true"><mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle></mml:mrow><mml:mrow><mml:mi mathvariant="italic">i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="italic">W</mml:mi></mml:mrow></mml:munderover>
<mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mstyle displaystyle="true"><mml:mo largeop="true" movablelimits="false">∑</mml:mo></mml:mstyle></mml:mrow><mml:mrow><mml:mi mathvariant="italic">j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="italic">H</mml:mi></mml:mrow></mml:munderover><mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">(</mml:mo><mml:mi mathvariant="italic">I</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">j</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="italic">I</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">j</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo mathvariant="normal" fence="true" maxsize="1.19em" minsize="1.19em">)</mml:mo><mml:mo mathvariant="normal">,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math>
<tex-math><![CDATA[\[\begin{aligned}{}& \textit{MSE}=\frac{1}{W\times H}{\sum \limits_{i=1}^{W}}{\sum \limits_{j=1}^{H}}\big(I(i,j)-{I^{\prime }}{(i,j)^{2}}\big),\end{aligned}\]]]></tex-math></alternatives>
</disp-formula>
where <italic>W</italic> and <italic>H</italic> are the width and the height of the test image. <inline-formula id="j_infor422_ineq_063"><alternatives>
<mml:math><mml:mi mathvariant="italic">I</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">j</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math>
<tex-math><![CDATA[$I(i,j)$]]></tex-math></alternatives></inline-formula> and <inline-formula id="j_infor422_ineq_064"><alternatives>
<mml:math><mml:msup><mml:mrow><mml:mi mathvariant="italic">I</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msup><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">j</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math>
<tex-math><![CDATA[${I^{\prime }}(i,j)$]]></tex-math></alternatives></inline-formula> are two pixel values of the cover image and stego-image at the location <inline-formula id="j_infor422_ineq_065"><alternatives>
<mml:math><mml:mo mathvariant="normal" fence="true" stretchy="false">(</mml:mo><mml:mi mathvariant="italic">i</mml:mi><mml:mo mathvariant="normal">,</mml:mo><mml:mi mathvariant="italic">j</mml:mi><mml:mo mathvariant="normal" fence="true" stretchy="false">)</mml:mo></mml:math>
<tex-math><![CDATA[$(i,j)$]]></tex-math></alternatives></inline-formula>. We test on 16-bit depth CT medical image shown in Fig. <xref rid="j_infor422_fig_004">4</xref>. In Table <xref rid="j_infor422_tab_001">1</xref>, we set the embedding level to 1. Different kinds of threshold result in capacity and PSNR. Obviously, the more threshold T, the more capacity. The more threshold, the smaller PSNR. On the contrary, we set the threshold to 21 and various embedding levels in Table <xref rid="j_infor422_tab_002">2</xref>. The greater the embedding level E, the more capacity, and the smaller PSNR. In Table <xref rid="j_infor422_tab_003">3</xref>, we set an embedding level and threshold to 21. The largest of bpp is 2.641178445 and the PSNR is 63.24405029.</p>
<fig id="j_infor422_fig_004">
<label>Fig. 4</label>
<caption>
<p>(a) CT image with signed <inline-formula id="j_infor422_ineq_066"><alternatives>
<mml:math><mml:mn>429</mml:mn><mml:mo>×</mml:mo><mml:mn>512</mml:mn></mml:math>
<tex-math><![CDATA[$429\times 512$]]></tex-math></alternatives></inline-formula> (b) CT image with signed <inline-formula id="j_infor422_ineq_067"><alternatives>
<mml:math><mml:mn>547</mml:mn><mml:mo>×</mml:mo><mml:mn>512</mml:mn></mml:math>
<tex-math><![CDATA[$547\times 512$]]></tex-math></alternatives></inline-formula> (c) CT image with signed <inline-formula id="j_infor422_ineq_068"><alternatives>
<mml:math><mml:mn>350</mml:mn><mml:mo>×</mml:mo><mml:mn>512</mml:mn></mml:math>
<tex-math><![CDATA[$350\times 512$]]></tex-math></alternatives></inline-formula>.</p>
</caption>
<graphic xlink:href="infor422_g004.jpg"/>
</fig>
<table-wrap id="j_infor422_tab_001">
<label>Table 1</label>
<caption>
<p>The results for a signed 16-bit grayscale medical image.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Image name from the national cancer imaging archive</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Image size</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Embedding level</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Threshold</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Capacity</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">bpp</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">PSNR</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.2.dcm</td>
<td style="vertical-align: top; text-align: left">350 × 512</td>
<td style="vertical-align: top; text-align: left">1</td>
<td style="vertical-align: top; text-align: left">1</td>
<td style="vertical-align: top; text-align: left">99,633</td>
<td style="vertical-align: top; text-align: left">0.555987723</td>
<td style="vertical-align: top; text-align: left">81.92740097</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">6</td>
<td style="vertical-align: top; text-align: left">120,508</td>
<td style="vertical-align: top; text-align: left">0.672477679</td>
<td style="vertical-align: top; text-align: left">79.74795677</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">11</td>
<td style="vertical-align: top; text-align: left">150,878</td>
<td style="vertical-align: top; text-align: left">0.841953125</td>
<td style="vertical-align: top; text-align: left">77.48244098</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">16</td>
<td style="vertical-align: top; text-align: left">179,047</td>
<td style="vertical-align: top; text-align: left">0.999146205</td>
<td style="vertical-align: top; text-align: left">75.77926976</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">21</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">197,696</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">1.103214286</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">74.64371168</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="j_infor422_tab_002">
<label>Table 2</label>
<caption>
<p>The results for an unsigned 16-bit grayscale medical image with different embedding levels.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Image name from the national cancer imaging archive</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Image size</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Embedding level</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Threshold</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Capacity</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">bpp</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">PSNR</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.2.dcm</td>
<td style="vertical-align: top; text-align: left">350 × 512</td>
<td style="vertical-align: top; text-align: left">1</td>
<td style="vertical-align: top; text-align: left">21</td>
<td style="vertical-align: top; text-align: left">197,696</td>
<td style="vertical-align: top; text-align: left">1.103214286</td>
<td style="vertical-align: top; text-align: left">74.64371168</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">6</td>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">304,972</td>
<td style="vertical-align: top; text-align: left">1.701852679</td>
<td style="vertical-align: top; text-align: left">68.91926164</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">11</td>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">365,123</td>
<td style="vertical-align: top; text-align: left">2.037516741</td>
<td style="vertical-align: top; text-align: left">66.1103813</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">16</td>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">406,108</td>
<td style="vertical-align: top; text-align: left">2.266227679</td>
<td style="vertical-align: top; text-align: left">64.16268337</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">21</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">434,770</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">2.426171875</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">62.72562295</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="j_infor422_tab_003">
<label>Table 3</label>
<caption>
<p>The results for a signed 16-bit grayscale medical image.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Image name from the national cancer imaging archive</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Image size</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Embedding level</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Threshold</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Capacity</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">bpp</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">PSNR</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.159.dcm</td>
<td style="vertical-align: top; text-align: left">395 × 512</td>
<td style="vertical-align: top; text-align: left">21</td>
<td style="vertical-align: top; text-align: left">21</td>
<td style="vertical-align: top; text-align: left">501,905</td>
<td style="vertical-align: top; text-align: left">2.481729628</td>
<td style="vertical-align: top; text-align: left">62.81406295</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.1207.dcm</td>
<td style="vertical-align: top; text-align: left">429 × 512</td>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">574,925</td>
<td style="vertical-align: top; text-align: left">2.617483428</td>
<td style="vertical-align: top; text-align: left">63.33996413</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.1210.dcm</td>
<td style="vertical-align: top; text-align: left">429 × 512</td>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">515,352</td>
<td style="vertical-align: top; text-align: left">2.346263112</td>
<td style="vertical-align: top; text-align: left">62.08233045</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.1278.dcm</td>
<td style="vertical-align: top; text-align: left">444 × 512</td>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">526,871</td>
<td style="vertical-align: top; text-align: left">2.317668743</td>
<td style="vertical-align: top; text-align: left">62.05008477</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.1280.dcm</td>
<td style="vertical-align: top; text-align: left">444 × 512</td>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">589,797</td>
<td style="vertical-align: top; text-align: left">2.594475823</td>
<td style="vertical-align: top; text-align: left">63.22757547</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.157.dcm</td>
<td style="vertical-align: top; text-align: left">395 × 512</td>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">455,072</td>
<td style="vertical-align: top; text-align: left">2.250158228</td>
<td style="vertical-align: top; text-align: left">61.92850025</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.1141.dcm</td>
<td style="vertical-align: top; text-align: left">458 × 512</td>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">555,916</td>
<td style="vertical-align: top; text-align: left">2.370684361</td>
<td style="vertical-align: top; text-align: left">62.12956713</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">1.3.6.1.4.1.9328.50.14.1908.dcm</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">547 × 512</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">739,699</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">2.641178445</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">63.24405029</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In this paper, we also used Lena and airplane with 8-bit depth <inline-formula id="j_infor422_ineq_069"><alternatives>
<mml:math><mml:mn>512</mml:mn><mml:mo>×</mml:mo><mml:mn>512</mml:mn></mml:math>
<tex-math><![CDATA[$512\times 512$]]></tex-math></alternatives></inline-formula> image shown in Fig. <xref rid="j_infor422_fig_006">6</xref>. Let the threshold be 1 and the embedding level be 1–4. When bpp is 1.299938202 in the Lena image, the PSNR will be 26.39720695. Because of overflow/underflow processing, the stego-image of Lena will be shifted and the pixels will have poor PSNR. Owing to histogram shifting of the whole image, the most of the image shape will be preserved as shown in Fig. <xref rid="j_infor422_fig_005">5</xref> and Table <xref rid="j_infor422_tab_004">4</xref>. In Fig. <xref rid="j_infor422_fig_007">7</xref>, we compare a 16-bit grayscale medical image and 8 bit images. We compare the method of median and prediction shown in Table <xref rid="j_infor422_tab_005">5</xref>. Our method has more capacity at the same PSNR.</p>
<fig id="j_infor422_fig_005">
<label>Fig. 5</label>
<caption>
<p>The result for boundary preserving with EL 5 and 20.</p>
</caption>
<graphic xlink:href="infor422_g005.jpg"/>
</fig>
<fig id="j_infor422_fig_006">
<label>Fig. 6</label>
<caption>
<p>Two cover images with stego-images: (a), (b) Lena (c), (d) F-16.</p>
</caption>
<graphic xlink:href="infor422_g006.jpg"/>
</fig>
<table-wrap id="j_infor422_tab_004">
<label>Table 4</label>
<caption>
<p>The results for Lena and airplane with 8-bit depth.</p>
</caption>
<table>
<thead>
<tr>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Image name from the national cancer imaging archive</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Image size</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Embedding level</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Threshold</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Capacity</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">bpp</td>
<td style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">PSNR</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">Lena</td>
<td style="vertical-align: top; text-align: left">512 × 512</td>
<td style="vertical-align: top; text-align: left">1</td>
<td style="vertical-align: top; text-align: left">1</td>
<td style="vertical-align: top; text-align: left">158,702</td>
<td style="vertical-align: top; text-align: left">0.605400085</td>
<td style="vertical-align: top; text-align: left">33.63540908</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">2</td>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">230,835</td>
<td style="vertical-align: top; text-align: left">0.880565643</td>
<td style="vertical-align: top; text-align: left">30.32126065</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">3</td>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">290,965</td>
<td style="vertical-align: top; text-align: left">1.109943390</td>
<td style="vertical-align: top; text-align: left">28.06630698</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">4</td>
<td style="vertical-align: top; text-align: left"/>
<td style="vertical-align: top; text-align: left">340,771</td>
<td style="vertical-align: top; text-align: left">1.299938202</td>
<td style="vertical-align: top; text-align: left">26.39720695</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">Airplane</td>
<td style="vertical-align: top; text-align: left">512 × 512</td>
<td style="vertical-align: top; text-align: left">1</td>
<td style="vertical-align: top; text-align: left">1</td>
<td style="vertical-align: top; text-align: left">241,027</td>
<td style="vertical-align: top; text-align: left">0.919445038</td>
<td style="vertical-align: top; text-align: left">34.05170498</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">2</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin"/>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">324,556</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">1.238082886</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">31.01245276</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="j_infor422_fig_007">
<label>Fig. 7</label>
<caption>
<p>The results for a 16-bit grayscale medical Image and a 8-bit image.</p>
</caption>
<graphic xlink:href="infor422_g007.jpg"/>
</fig>
<table-wrap id="j_infor422_tab_005">
<label>Table 5</label>
<caption>
<p>The results for the comparison of median and prediction methods.</p>
</caption>
<table>
<thead>
<tr>
<td rowspan="2" style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Image name from the national cancer imaging archive</td>
<td rowspan="2" style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Image size</td>
<td colspan="2" style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Median</td>
<td colspan="2" style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Prediction</td>
<td colspan="2" style="vertical-align: top; text-align: left; border-top: solid thin; border-bottom: solid thin">Our method</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Capacity</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">PSNR</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Capacity</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">PSNR</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">Capacity</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">PSNR</td>
</tr>
</thead>
<tbody>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.159</td>
<td style="vertical-align: top; text-align: left">395 × 512</td>
<td style="vertical-align: top; text-align: left">0.71</td>
<td style="vertical-align: top; text-align: left">69.9889</td>
<td style="vertical-align: top; text-align: left">0.99</td>
<td style="vertical-align: top; text-align: left">69.1440</td>
<td style="vertical-align: top; text-align: left">1.68</td>
<td style="vertical-align: top; text-align: left">69.6712</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.1207</td>
<td style="vertical-align: top; text-align: left">429 × 512</td>
<td style="vertical-align: top; text-align: left">0.71</td>
<td style="vertical-align: top; text-align: left">69.6336</td>
<td style="vertical-align: top; text-align: left">0.99</td>
<td style="vertical-align: top; text-align: left">69.2379</td>
<td style="vertical-align: top; text-align: left">1.88</td>
<td style="vertical-align: top; text-align: left">69.9551</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.1280</td>
<td style="vertical-align: top; text-align: left">444 × 512</td>
<td style="vertical-align: top; text-align: left">0.71</td>
<td style="vertical-align: top; text-align: left">69</td>
<td style="vertical-align: top; text-align: left">0.98</td>
<td style="vertical-align: top; text-align: left">69.747</td>
<td style="vertical-align: top; text-align: left">1.84</td>
<td style="vertical-align: top; text-align: left">69.8189</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.1210</td>
<td style="vertical-align: top; text-align: left">429 × 512</td>
<td style="vertical-align: top; text-align: left">0.72</td>
<td style="vertical-align: top; text-align: left">73.6699</td>
<td style="vertical-align: top; text-align: left">0.96</td>
<td style="vertical-align: top; text-align: left">73.396</td>
<td style="vertical-align: top; text-align: left">1.02</td>
<td style="vertical-align: top; text-align: left">73.3560</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.1278</td>
<td style="vertical-align: top; text-align: left">444 × 512</td>
<td style="vertical-align: top; text-align: left">0.73</td>
<td style="vertical-align: top; text-align: left">73.3000</td>
<td style="vertical-align: top; text-align: left">0.952</td>
<td style="vertical-align: top; text-align: left">73.063</td>
<td style="vertical-align: top; text-align: left">1.01</td>
<td style="vertical-align: top; text-align: left">73.1843</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left">1.3.6.1.4.1.9328.50.14.157</td>
<td style="vertical-align: top; text-align: left">395 × 512</td>
<td style="vertical-align: top; text-align: left">0.73</td>
<td style="vertical-align: top; text-align: left">73.3590</td>
<td style="vertical-align: top; text-align: left">0.96</td>
<td style="vertical-align: top; text-align: left">73.077</td>
<td style="vertical-align: top; text-align: left">0.96</td>
<td style="vertical-align: top; text-align: left">73.073</td>
</tr>
<tr>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">1.3.6.1.4.1.9328.50.14.1141</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">458 × 512</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">0.73</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">73.7324</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">0.96</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">73.727</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">1.04</td>
<td style="vertical-align: top; text-align: left; border-bottom: solid thin">73.459</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="j_infor422_s_010">
<label>4</label>
<title>Security Aspects</title>
<p>The embedding algorithm is used to embed the secret data into the cover image as a stego-image. Stego-images are transmitted over the Internet. If stego-images are altered or destroyed due to certain attacks, our method has the basic characteristics of data hiding to protect secret data. Because the secret data is hidden in the cover image, it is difficult for the human visual system to detect any unperceivable secret data.</p>
<p>In our method, there are two layers of block median retention technology and a predictive reversible hiding method to hide secret data. Therefore, our method is a technique that resists the attack of this technique without parameters such as threshold, EL and overflow/underflow methods. We also applied 2 × 2 overlapping blocks to partition the image. If a hacker changes the secure covert image over the network, the secure covert image cannot be extracted correctly.</p>
</sec>
<sec id="j_infor422_s_011">
<label>5</label>
<title>Conclusion</title>
<p>We have proposed the data hiding of two-tier medical images based on histogram shifting of prediction error. The median histogram shifting technique and prediction error schemes as the two-tier hiding have high capacity and PSNR in 16-bit medical images. The overlapping block partitions have also been adopted in this scheme, and it has performed well. At the Tier-1 data hider, the median histogram shifting technique is based on a multi-level histogram shifting mechanism. Due to adopting two types of embedding strategies, the block medians are able to be preserved. Therefore, the stego-image utilizes these block medians to convert the stego image to the original image successfully. At the Tier-2 data hider, the prediction error scheme applies a pre-determined threshold and the absolute difference of the neighbouring pixels to decide whether the current pixel is embeddable.</p>
</sec>
</body>
<back>
<ack id="j_infor422_ack_001">
<title>Acknowledgements</title>
<p>In this paper, we adopt medical images from the cancer imaging archive (NBIA, <xref ref-type="bibr" rid="j_infor422_ref_024">2018</xref>) and thank National Cancer Institute for providing the CT image data for this study for free. Most of the medical devices provide 16 or more bits of image information at each pixel (Culjat <italic>et al.</italic>, <xref ref-type="bibr" rid="j_infor422_ref_005">2012</xref>). Therefore, a very large number of histogram is empty. Those histograms can be utilized to process overflow/underflow problems.</p></ack>
<ref-list id="j_infor422_reflist_001">
<title>References</title>
<ref id="j_infor422_ref_001">
<mixed-citation publication-type="chapter"><string-name><surname>Abbasy</surname>, <given-names>M.R.</given-names></string-name>, <string-name><surname>Shanmugam</surname>, <given-names>B.</given-names></string-name> (2011). <chapter-title>Enabling data hiding for resource sharing in cloud computing environments based on DNA sequences</chapter-title>. In: <chapter-title>IEEE World Congress on Services</chapter-title>, pp. <fpage>385</fpage>–<lpage>390</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_002">
<mixed-citation publication-type="journal"><string-name><surname>Cao</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Du</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Wei</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Meng</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Guo</surname>, <given-names>X.</given-names></string-name> (<year>2016</year>). <article-title>High capacity reversible data hiding in encrypted images by patch-level sparse representation</article-title>. <source>IEEE Transactions on Cybernetics</source>, <volume>46</volume>, <fpage>1132</fpage>–<lpage>1143</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_003">
<mixed-citation publication-type="journal"><string-name><surname>Chang</surname>, <given-names>C.C.</given-names></string-name>, <string-name><surname>Huang</surname>, <given-names>Y.H.</given-names></string-name>, <string-name><surname>Tsai</surname>, <given-names>H.Y.</given-names></string-name>, <string-name><surname>Qin</surname>, <given-names>C.</given-names></string-name> (<year>2012</year>). <article-title>Prediction-based reversible data hiding using the difference of neighboring pixels</article-title>. <source>International Journal of Electronics and Communications</source>, <volume>66</volume>, <fpage>758</fpage>–<lpage>766</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_004">
<mixed-citation publication-type="journal"><string-name><surname>Chen</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Guo</surname>, <given-names>W.</given-names></string-name> (<year>2020</year>). <article-title>Reversible data hiding scheme based on fully exploiting the orientation combinations of dual stego-images</article-title>. <source>International Journal of Network Security</source>, <volume>22</volume>, <fpage>126</fpage>–<lpage>135</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_005">
<mixed-citation publication-type="book"><string-name><surname>Culjat</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Singh</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Lee</surname>, <given-names>H.</given-names></string-name> (<year>2012</year>). <source>Medical Devices: Surgical and Image-Guided Technologies</source>. <publisher-name>Wiley</publisher-name>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_006">
<mixed-citation publication-type="journal"><string-name><surname>Dragoi</surname>, <given-names>I.C.</given-names></string-name>, <string-name><surname>Coltuc</surname>, <given-names>D.</given-names></string-name> (<year>2015</year>). <article-title>On local prediction based reversible watermarking</article-title>. <source>IEEE Transactions on Image Processing</source>, <volume>24</volume>, <fpage>1244</fpage>–<lpage>1246</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_007">
<mixed-citation publication-type="journal"><string-name><surname>Fallahpour</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Sedaaghi</surname>, <given-names>M.H.</given-names></string-name> (<year>2007</year>). <article-title>High capacity lossless data hiding based on histogram modification</article-title>. <source>IEICE Electronics Express</source>, <volume>4</volume>, <fpage>205</fpage>–<lpage>210</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_008">
<mixed-citation publication-type="journal"><string-name><surname>Gao</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Shi</surname>, <given-names>Y.Q.</given-names></string-name> (<year>2015</year>). <article-title>Reversible data hiding using controlled contrast enhancement and integer wavelet transform</article-title>. <source>IEEE Signal Processing Letters</source>, <volume>22</volume>, <fpage>2078</fpage>–<lpage>2082</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_009">
<mixed-citation publication-type="journal"><string-name><surname>Hong</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>T.S.</given-names></string-name>, <string-name><surname>Shiu</surname>, <given-names>C.W.</given-names></string-name> (<year>2008</year>). <article-title>Reversible data hiding based on histogram shifting of predict errors</article-title>. <source>International Workshop on Geoscience and Remote Sensing</source>, <volume>2</volume>, <fpage>578</fpage>–<lpage>581</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_010">
<mixed-citation publication-type="journal"><string-name><surname>Hong</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>T.S.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>J.</given-names></string-name> (<year>2015</year>). <article-title>Reversible data hiding using Delaunay triangulation and selective embedment</article-title>. <source>Information Sciences</source>, <volume>308</volume>, <fpage>140</fpage>–<lpage>154</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_011">
<mixed-citation publication-type="journal"><string-name><surname>Huang</surname>, <given-names>L.C.</given-names></string-name>, <string-name><surname>Hwang</surname>, <given-names>M.S.</given-names></string-name> (<year>2012</year>). <article-title>Study of an intrusion detection system</article-title>. <source>Journal of Electronic Science and Technology</source>, <volume>10</volume>, <fpage>77</fpage>–<lpage>83</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_012">
<mixed-citation publication-type="journal"><string-name><surname>Huang</surname>, <given-names>L.C.</given-names></string-name>, <string-name><surname>Tseng</surname>, <given-names>L.Y.</given-names></string-name>, <string-name><surname>Hwang</surname>, <given-names>M.S.</given-names></string-name> (<year>2012</year>). <article-title>The study of data hiding in medical image</article-title>. <source>International Journal of Network Security</source>, <volume>14</volume>, <fpage>243</fpage>–<lpage>251</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_013">
<mixed-citation publication-type="journal"><string-name><surname>Huang</surname>, <given-names>L.C.</given-names></string-name>, <string-name><surname>Hwang</surname>, <given-names>M.S.</given-names></string-name>, <string-name><surname>Tseng</surname>, <given-names>L.Y.</given-names></string-name> (<year>2013</year>a). <article-title>Reversible and high-capacity data hiding in high quality medical images</article-title>. <source>KSII Transactions on Internet and Information Systems</source>, <volume>7</volume>, <fpage>132</fpage>–<lpage>148</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_014">
<mixed-citation publication-type="journal"><string-name><surname>Huang</surname>, <given-names>L.C.</given-names></string-name>, <string-name><surname>Hwang</surname>, <given-names>M.S.</given-names></string-name>, <string-name><surname>Tseng</surname>, <given-names>L.Y.</given-names></string-name> (<year>2013</year>b). <article-title>Reversible data hiding for medical images in cloud computing environments based on Chaotic Hénon map</article-title>. <source>Journal of Electronic Science and Technology</source>, <volume>11</volume>, <fpage>230</fpage>–<lpage>236</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_015">
<mixed-citation publication-type="journal"><string-name><surname>Huang</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Qu</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Kim</surname>, <given-names>H.J.</given-names></string-name>, <string-name><surname>Huang</surname>, <given-names>J.</given-names></string-name> (<year>2016</year>). <article-title>Reversible data hiding in JPEG images</article-title>. <source>IEEE Transactions on Circuits and Systems for Video Technology</source>, <volume>26</volume>, <fpage>1610</fpage>–<lpage>1621</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_016">
<mixed-citation publication-type="journal"><string-name><surname>Huang</surname>, <given-names>L.C.</given-names></string-name>, <string-name><surname>Feng</surname>, <given-names>T.H.</given-names></string-name>, <string-name><surname>Hwang</surname>, <given-names>M.S.</given-names></string-name> (<year>2017</year>). <article-title>A new lossless embedding techniques based on HDWT</article-title>. <source>IETE Technical Review</source>, <volume>34</volume>, <fpage>40</fpage>–<lpage>47</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_017">
<mixed-citation publication-type="journal"><string-name><surname>Jana</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Giri</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Mondal</surname>, <given-names>S.K.</given-names></string-name> (<year>2016</year>). <article-title>Dual-Image based reversible data hiding scheme using pixel value difference expansion</article-title>. <source>International Journal of Network Security</source>, <volume>18</volume>, <fpage>633</fpage>–<lpage>643</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_018">
<mixed-citation publication-type="journal"><string-name><surname>Kim</surname>, <given-names>K.S.</given-names></string-name>, <string-name><surname>Lee</surname>, <given-names>M.J.</given-names></string-name>, <string-name><surname>Lee</surname>, <given-names>H.Y.</given-names></string-name>, <string-name><surname>Lee</surname>, <given-names>H.K.</given-names></string-name> (<year>2009</year>). <article-title>Reversible data hiding exploiting spatial correlation between sub-sampled images</article-title>. <source>Pattern Recognit</source>, <volume>42</volume>, <fpage>3083</fpage>–<lpage>3096</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_019">
<mixed-citation publication-type="other"><string-name><surname>Kim</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Lussi</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Qu</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Kim</surname>, <given-names>H.J.</given-names></string-name> (2015). Automatic contrast enhancement using reversible data hiding. In: <italic>Proc. IEEE International Workshop on Information Forensics and Security</italic>, 1–5.</mixed-citation>
</ref>
<ref id="j_infor422_ref_020">
<mixed-citation publication-type="chapter"><string-name><surname>Lee</surname>, <given-names>S.K.</given-names></string-name>, <string-name><surname>Suh</surname>, <given-names>Y.H.</given-names></string-name>, <string-name><surname>Ho</surname>, <given-names>Y.S.</given-names></string-name> (<year>2006</year>). <chapter-title>Reversible image authentication based on watermarking</chapter-title>. In: <source>Proceedings of the IEEE International Conference on Multimedia and Expo</source>, pp. <fpage>1321</fpage>–<lpage>1324</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_021">
<mixed-citation publication-type="journal"><string-name><surname>Li</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Mao</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Chang</surname>, <given-names>C.C.</given-names></string-name> (<year>2016</year>). <article-title>A reversible data hiding scheme based on IWT and the Sudoku method</article-title>. <source>International Journal of Network Security</source>, <volume>18</volume>, <fpage>410</fpage>–<lpage>419</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_022">
<mixed-citation publication-type="journal"><string-name><surname>Li</surname>, <given-names>J.J.</given-names></string-name>, <string-name><surname>Wu</surname>, <given-names>Y.H.</given-names></string-name>, <string-name><surname>Lee</surname>, <given-names>C.F.</given-names></string-name>, <string-name><surname>Chang</surname>, <given-names>C.C.</given-names></string-name> (<year>2018</year>). <article-title>Generalized PVO-K embedding technique for reversible data hiding</article-title>. <source>International Journal of Network Security</source>, <volume>20</volume>, <fpage>65</fpage>–<lpage>77</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_023">
<mixed-citation publication-type="journal"><string-name><surname>Luo</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>F.X.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Huang</surname>, <given-names>Z.L.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>P.H.</given-names></string-name> (<year>2011</year>). <article-title>Reversible data hiding based on block median preservation</article-title>. <source>Information Sciences</source>, <volume>181</volume>, <fpage>308</fpage>–<lpage>328</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_024">
<mixed-citation publication-type="other">National Cancer Institute, National Biomedical Imaging Archive (NBIA) (2018). Institute, National Biomedical Imaging Archive (NBIA). <uri>https://imaging.nci.nih.gov/</uri> (accessed March 2 2018).</mixed-citation>
</ref>
<ref id="j_infor422_ref_025">
<mixed-citation publication-type="journal"><string-name><surname>Ni</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Shi</surname>, <given-names>Y.Q.</given-names></string-name>, <string-name><surname>Ansari</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Su</surname>, <given-names>W.</given-names></string-name> (<year>2006</year>). <article-title>Reversible data hiding</article-title>. <source>IEEE Transactions on Circuits and Systems for Video Technology</source>, <volume>16</volume>, <fpage>354</fpage>–<lpage>362</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_026">
<mixed-citation publication-type="journal"><string-name><surname>Qiu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Qian</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>L.</given-names></string-name> (<year>2016</year>). <article-title>Adaptive reversible data hiding by extending the generalized integer transformation</article-title>. <source>IEEE Signal Processing Letters</source>, <volume>23</volume>, <fpage>130</fpage>–<lpage>134</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_027">
<mixed-citation publication-type="journal"><string-name><surname>Shanableh</surname>, <given-names>T.</given-names></string-name> (<year>2012</year>). <article-title>Data hiding in MPEG video files using multivariate regression and flexible macroblock ordering</article-title>. <source>IEEE Transactions on Information Forensics and Security</source>, <volume>7</volume>, <fpage>455</fpage>–<lpage>464</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_028">
<mixed-citation publication-type="journal"><string-name><surname>Shi</surname>, <given-names>Y.Q.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Wu</surname>, <given-names>H.T.</given-names></string-name>, <string-name><surname>Ma</surname>, <given-names>B.</given-names></string-name> (<year>2016</year>). <article-title>Reversible data hiding: Advances in the past two decades</article-title>. <source>IEEE Access</source>, <volume>4</volume>, <fpage>3210</fpage>–<lpage>3237</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_029">
<mixed-citation publication-type="journal"><string-name><surname>Surekha</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Swamy</surname>, <given-names>G.N.</given-names></string-name> (<year>2013</year>). <article-title>Sensitive digital image watermarking for copyright protection</article-title>. <source>International Journal of Network Security</source>, <volume>15</volume>, <fpage>113</fpage>–<lpage>121</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_030">
<mixed-citation publication-type="journal"><string-name><surname>Thodi</surname>, <given-names>D.M.</given-names></string-name>, <string-name><surname>Rodriguez</surname>, <given-names>J.J.</given-names></string-name> (<year>2007</year>). <article-title>Expansion embedding techniques for reversible watermarking</article-title>. <source>IEEE Transactions on Image Processing</source>, <volume>6</volume>, <fpage>721</fpage>–<lpage>730</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_031">
<mixed-citation publication-type="chapter"><string-name><surname>Tian</surname>, <given-names>J.</given-names></string-name> (<year>2002</year>). <chapter-title>Wavelet-based reversible watermarking for authentication</chapter-title>. In: <source>Proceedings SPIE 4675, Security and Watermarking of Multimedia Contents</source>, <volume>IV</volume>, <fpage>679</fpage>–<lpage>690</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_032">
<mixed-citation publication-type="chapter"><string-name><surname>Tseng</surname>, <given-names>L.Y.</given-names></string-name>, <string-name><surname>Huang</surname>, <given-names>L.C.</given-names></string-name> (<year>2010</year>). <chapter-title>Automatic fissure detection in CT images based on the genetic algorithm</chapter-title>. In: <source>Proceedings of the International Conference on Machine Learning and Cybernetics</source>, Vol. <volume>5</volume>, pp. <fpage>2583</fpage>–<lpage>2588</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_033">
<mixed-citation publication-type="journal"><string-name><surname>Vleeschouwer</surname>, <given-names>C.D.</given-names></string-name>, <string-name><surname>Delaigle</surname>, <given-names>J.F.</given-names></string-name>, <string-name><surname>Macq</surname>, <given-names>B.</given-names></string-name> (<year>2003</year>). <article-title>Circular interpretation of bijective transformations in lossless watermarking for media asset management</article-title>. <source>IEEE Transactions on Multimedia</source>, <volume>5</volume>, <fpage>97</fpage>–<lpage>105</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_034">
<mixed-citation publication-type="journal"><string-name><surname>Wang</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Lu</surname>, <given-names>Z.M.</given-names></string-name>, <string-name><surname>Hu</surname>, <given-names>Y.J.</given-names></string-name> (<year>2013</year>). <article-title>A high capacity lossless data hiding scheme for JPEG images</article-title>. <source>Journal of Systems and Software</source>, <volume>86</volume>, <fpage>1965</fpage>–<lpage>1975</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_035">
<mixed-citation publication-type="journal"><string-name><surname>Wang</surname>, <given-names>Y.L.</given-names></string-name>, <string-name><surname>Shen</surname>, <given-names>J.J.</given-names></string-name>, <string-name><surname>Hwang</surname>, <given-names>M.S.</given-names></string-name> (<year>2017</year>). <article-title>An improved dual image-based reversible hiding technique using LSB matching</article-title>. <source>International Journal of Network Security</source>, <volume>19</volume>, <fpage>858</fpage>–<lpage>862</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_036">
<mixed-citation publication-type="journal"><string-name><surname>Wang</surname>, <given-names>Y.L.</given-names></string-name>, <string-name><surname>Shen</surname>, <given-names>J.J.</given-names></string-name>, <string-name><surname>Hwang</surname>, <given-names>M.S.</given-names></string-name> (<year>2018</year>). <article-title>A survey of reversible data hiding for VQ-compressed images</article-title>. <source>International Journal of Network Security</source>, <volume>20</volume>, <fpage>1</fpage>–<lpage>8</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_037">
<mixed-citation publication-type="chapter"><string-name><surname>Wu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Deng</surname>, <given-names>R.H.</given-names></string-name> (<year>2011</year>). <chapter-title>Zero-error watermarking on JPEG images by shuffling Huffman tree nodes</chapter-title>. In: <source>Proceedings of the IEEE Visual Communications and Image Processing</source>, pp. <fpage>1</fpage>–<lpage>4</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_038">
<mixed-citation publication-type="journal"><string-name><surname>Wu</surname>, <given-names>C.C.</given-names></string-name>, <string-name><surname>Hwang</surname>, <given-names>M.S.</given-names></string-name>, <string-name><surname>Kao</surname>, <given-names>S.J.</given-names></string-name> (<year>2009</year>). <article-title>A new approach to the secret image sharing with steganography and authentication</article-title>. <source>Imaging Science Journal</source>, <volume>57</volume>, <fpage>140</fpage>–<lpage>151</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_039">
<mixed-citation publication-type="journal"><string-name><surname>Wu</surname>, <given-names>H.T.</given-names></string-name>, <string-name><surname>Dugelay</surname>, <given-names>J.L.</given-names></string-name>, <string-name><surname>Shi</surname>, <given-names>Y.Q.</given-names></string-name> (<year>2015</year>a). <article-title>Reversible image data hiding with contrast enhancement</article-title>. <source>IEEE Transactions on Signal Processing</source>, <volume>22</volume>, <fpage>81</fpage>–<lpage>85</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_040">
<mixed-citation publication-type="journal"><string-name><surname>Wu</surname>, <given-names>H.T.</given-names></string-name>, <string-name><surname>Huang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Shi</surname>, <given-names>Y.Q.</given-names></string-name> (<year>2015</year>b). <article-title>A reversible data hiding method with contrast enhancement for medical images</article-title>. <source>Journal of Visual Communication and Image Representation</source>, <volume>31</volume>, <fpage>146</fpage>–<lpage>153</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_041">
<mixed-citation publication-type="other"><string-name><surname>Xuan</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Shi</surname>, <given-names>Y.Q.</given-names></string-name>, <string-name><surname>Chai</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Cui</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Ni</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Tong</surname>, <given-names>X.</given-names></string-name> (2007). Optimum histogram pair based image lossless data embedding. <italic>International Workshop on Digital Watermarking</italic>, 264–278.</mixed-citation>
</ref>
<ref id="j_infor422_ref_042">
<mixed-citation publication-type="journal"><string-name><surname>Zhang</surname>, <given-names>X.</given-names></string-name> (<year>2011</year>). <article-title>Reversible data hiding in encrypted image</article-title>. <source>IEEE Signal Processing Letters</source>, <volume>18</volume>, <fpage>255</fpage>–<lpage>258</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_043">
<mixed-citation publication-type="journal"><string-name><surname>Zhang</surname>, <given-names>X.</given-names></string-name> (<year>2012</year>). <article-title>Separable reversible data hiding in encrypted image</article-title>. <source>IEEE Transactions on Information Forensics and Security</source>, <volume>7</volume>, <fpage>826</fpage>–<lpage>832</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_044">
<mixed-citation publication-type="journal"><string-name><surname>Zhang</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Hou</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>N.</given-names></string-name> (<year>2016</year>). <article-title>Reversible data hiding in encrypted image by reversible image transforming</article-title>. <source>IEEE Transactions on Multimedia</source>, <volume>18</volume>, <fpage>1469</fpage>–<lpage>1479</lpage>.</mixed-citation>
</ref>
<ref id="j_infor422_ref_045">
<mixed-citation publication-type="journal"><string-name><surname>Zhang</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Gao</surname>, <given-names>T.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>L.</given-names></string-name> (<year>2016</year>). <article-title>A reversible data hiding scheme based on histogram modification in integer DWT domain for BTC compressed images</article-title>. <source>International Journal of Network Security</source>, <volume>18</volume>, <fpage>718</fpage>–<lpage>727</lpage>.</mixed-citation>
</ref>
</ref-list>
</back>
</article>