![]() |
BMP | AMBTC | DCT | DWT |
CR | 1 | 4 | 10-40 | 4-40 |
CS | Fastest | Fast | Slower | Slowest |
RSB | Wide | Narrow | Narrower | Narrowest |
IQ | Best | Good | Quite Good | Better |
Eradication and eventually cure of the HIV virus from the infected individual should be the primary goal in all HIV therapy. This has yet to be achieved, however development of broadly neutralizing antibodies (bNabs) and eCD4-Ig and its related particles are promising therapeutic alternatives to eliminate the HIV virus from the host. Past studies have found superior protectivity and efficacy eradicating the HIV virus with the use of eCD4-Igs over bNabs, which has proposed the antibody-dependent cell-mediated cytotoxicity (ADCC) effect as one of the key-factors for antibody design. In this study, we evaluated the dynamics of the HIV virus, CD4 T-cells, and eCD4-Ig in humans using a gene-therapy approach which has been evaluated in primates previously. We utilized a mathematical model to investigate the relationship between eCD4-Ig levels, ADCC effects, and the neutralization effect on HIV elimination. In addition, a balance between ADCC and viral neutralization effect of eCD4-Ig has been investigated in order to understand the condition of which HIV eliminating antibodies needs to satisfy. Our analysis indicated some level of ADCC effect, which was missing from ART, was required for viral elimination. The results will be helpful in designing future drugs or therapeutic strategies.
Citation: Tae Jin Lee, Jose A. Vazquez, Arni S. R. Srinivasa Rao. Mathematical modeling of impact of eCD4-Ig molecule in control and management of HIV within a host[J]. Mathematical Biosciences and Engineering, 2021, 18(5): 6887-6906. doi: 10.3934/mbe.2021342
[1] | Srikanth Umakanthan, Vijay Kumar Chattu, Anu V Ranade, Debasmita Das, Abhishekh Basavarajegowda, Maryann Bukelo . A rapid review of recent advances in diagnosis, treatment and vaccination for COVID-19. AIMS Public Health, 2021, 8(1): 137-153. doi: 10.3934/publichealth.2021011 |
[2] | María D Figueroa-Pizano, Alma C Campa-Mada, Elizabeth Carvajal-Millan, Karla G Martinez-Robinson, Agustin Rascon Chu . The underlying mechanisms for severe COVID-19 progression in people with diabetes mellitus: a critical review. AIMS Public Health, 2021, 8(4): 720-742. doi: 10.3934/publichealth.2021057 |
[3] | Musyoka Kinyili, Justin B Munyakazi, Abdulaziz YA Mukhtar . Mathematical modeling and impact analysis of the use of COVID Alert SA app. AIMS Public Health, 2022, 9(1): 106-128. doi: 10.3934/publichealth.2022009 |
[4] | Ashok Chakraborty, Anil Diwan, Vinod Arora, Yogesh Thakur, Vijetha Chiniga, Jay Tatake, Rajesh Pandey, Preetam Holkar, Neelam Holkar, Bethany Pond . Mechanism of Antiviral Activities of Nanoviricide's Platform Technology based Biopolymer (NV-CoV-2). AIMS Public Health, 2022, 9(2): 415-422. doi: 10.3934/publichealth.2022028 |
[5] | Akari Miyazaki, Naoko Kumada Deguchi, Tomoko Omiya . Difficulties and distress experienced by Japanese public health nurses specializing in quarantine services when dealing with COVID-19: A qualitative study in peri-urban municipality. AIMS Public Health, 2023, 10(2): 235-251. doi: 10.3934/publichealth.2023018 |
[6] | Christos Sikaras, Ioannis Ilias, Athanasios Tselebis, Argyro Pachi, Sofia Zyga, Maria Tsironi, Andrea Paola Rojas Gil, Aspasia Panagiotou . Nursing staff fatigue and burnout during the COVID-19 pandemic in Greece. AIMS Public Health, 2022, 9(1): 94-105. doi: 10.3934/publichealth.2022008 |
[7] | Kelly Graff, Ye Ji Choi, Lori Silveira, Christiana Smith, Lisa Abuogi, Lisa Ross DeCamp, Jane Jarjour, Chloe Friedman, Meredith A. Ware, Jill L Kaar . Lessons learned for preventing health disparities in future pandemics: the role of social vulnerabilities among children diagnosed with severe COVID-19 early in the pandemic. AIMS Public Health, 2025, 12(1): 124-136. doi: 10.3934/publichealth.2025009 |
[8] | Elizabeth Dean, Margot Skinner, Homer Peng-Ming Yu, Alice YM Jones, Rik Gosselink, Anne Söderlund . Why COVID-19 strengthens the case to scale up assault on non-communicable diseases: role of health professionals including physical therapists in mitigating pandemic waves. AIMS Public Health, 2021, 8(2): 369-375. doi: 10.3934/publichealth.2021028 |
[9] | Thiresia Sikioti, Afroditi Zartaloudi, Despoina Pappa, Polyxeni Mangoulia, Evangelos C. Fradelos, Freideriki Eleni Kourti, Ioannis Koutelekos, Evangelos Dousis, Nikoletta Margari, Areti Stavropoulou, Eleni Evangelou, Chrysoula Dafogianni . Stress and burnout among Greek critical care nurses during the COVID-19 pandemic. AIMS Public Health, 2023, 10(4): 755-774. doi: 10.3934/publichealth.2023051 |
[10] | Mario Coccia . Sources, diffusion and prediction in COVID-19 pandemic: lessons learned to face next health emergency. AIMS Public Health, 2023, 10(1): 145-168. doi: 10.3934/publichealth.2023012 |
Eradication and eventually cure of the HIV virus from the infected individual should be the primary goal in all HIV therapy. This has yet to be achieved, however development of broadly neutralizing antibodies (bNabs) and eCD4-Ig and its related particles are promising therapeutic alternatives to eliminate the HIV virus from the host. Past studies have found superior protectivity and efficacy eradicating the HIV virus with the use of eCD4-Igs over bNabs, which has proposed the antibody-dependent cell-mediated cytotoxicity (ADCC) effect as one of the key-factors for antibody design. In this study, we evaluated the dynamics of the HIV virus, CD4 T-cells, and eCD4-Ig in humans using a gene-therapy approach which has been evaluated in primates previously. We utilized a mathematical model to investigate the relationship between eCD4-Ig levels, ADCC effects, and the neutralization effect on HIV elimination. In addition, a balance between ADCC and viral neutralization effect of eCD4-Ig has been investigated in order to understand the condition of which HIV eliminating antibodies needs to satisfy. Our analysis indicated some level of ADCC effect, which was missing from ART, was required for viral elimination. The results will be helpful in designing future drugs or therapeutic strategies.
At present, compared with massive multimedia information, the computer storage resources and network bandwidth provided by hardware technology are limited after all, which makes the storage and transmission of information a thorny problem. It is unrealistic to solve this problem by simply increasing memory capacity, channel bandwidth and processing speed of computer. Effective image compression is the basis of all kinds of dynamic image compression and transmission. Image compression can reduce the amount of data by lowering the redundancy and irrelevance of formatted image data.
Most of the images in the network are stored and transmitted in the form of compression. Compression is the process of representing data in a compact form rather than in its original or incompact form [1]. Lossy compression is much more easy to achieve, and because of the limitations of human vision it can get better compression ratios compared with loseless compression. Compressed images have the advantages of simple calculation and low distortion rate. The most common methods of compression transforms include AMBTC [2], Discrete Cosine Transform (DCT) [3] and Discrete Wavelet Transform (DWT) [4].
AMBTC is an improvement of Block Truncation Coding (BTC) technology. Compared with BTC, the compression process of AMBTC is faster [5]. And the image quality after AMBTC compression is relatively better. Compared with other compression techniques, AMBTC has the advantages of fast coding speed, low computational cost and real-time implementation. Furthermore, it is insensitive to channel error and can obtain satisfactory image quality, so it is widely used. The comparison of bitmap (BMP) image and compression methods based on AMBTC, DCT, and DWT are shown in the Table 1, where Compression Method (CM), Evaluating Indicator (EI), Compression Ratio (CR), Compression Speed (CS), Storage Bandwidth (RSB), and Image Quality (IQ) are included in the table.
![]() |
BMP | AMBTC | DCT | DWT |
CR | 1 | 4 | 10-40 | 4-40 |
CS | Fastest | Fast | Slower | Slowest |
RSB | Wide | Narrow | Narrower | Narrowest |
IQ | Best | Good | Quite Good | Better |
AMBTC is a lossy data compression algorithm for gray images. Because of its simple physical implementation and quick encoding and decoding ability, AMBTC was once widely used in broadcasting and television. It has been introduced into color image compression, namely color unit compression. Although the latest research using Progressive and Iterative Approximation for Least Square (LSPIA) fitting has been able to achieve lossless video compression [6], video compression based on AMBTC is still of great significance. In the military industry field, especially in the field of aviation and aerospace, many factors need to be considered, such as CR, CS, RSB and IQ. In order to reduce energy consumption and improve processing speed, spacecraft should choose compression algorithm with narrow bandwidth, fast computational speed and satisfactory image quality. In addition, binary images require narrow bandwidth, but the image quality is not desirable. On the contrary, color images have the satisfactory quality but require wide bandwidth. Due to the excellent characteristics of image compression based on AMBTC, it can quickly pass back important images. The research on the key technologies of AMBTC image secret sharing is expected to promote the development of fast secret image transmission in the fields of edge computing, aerospace and Unmanned Aerial Vehicle (UAV).
As the visual basis of human perception of the world, image is an important means to obtain, express and transfer information. Through the analysis of images, automated carp species identification [7], palmprint identification [8], energy management [9], prediction of rainfall time series [10] and so on can be realized. With the wide application and rapid development of network and multimedia technology, digital images become easy to obtain, transmit and modify. The security of digital images has attracted more and more attention of scientists and engineers [11]. Images can be transmitted by computers, mobile phones or other communication devices. Therefore, in the process of storage and transmission, they may be stolen. Consequently, image encryption is particularly important [12]. Nonlinear technology of multiple images encryption scheme has become a hot topic, and the encryption scheme based on Latin squares can reduce the time complexity and improve the performance of image encryption [13].
In 1979, Shamir [14] and Blakley [15] proposed the concept of secret sharing for the first time. The (k,n) threshold secret sharing sheme means that a secret is divided into n pieces, when collecting any k or more shares can recover the secret. However, we cannot decrypt when less than k stego images are obtained, and no information about the secret will be revealed.
In 1994, Naor and Shamir [16] proposed the VSS scheme, the key advantage of which is stacking-to-see. According to the basic principle of implementation, VSS can be roughly divided into codebook-based VSS [17] and Random Grid (RG)-based VSS (RGVSS) [18,19]. The encryption of binary secret image based on RG was first proposed by Kafri and Keren [20]. Subsequently, compared with codebook-based VSS, RGVSS has attracted much more attention owing to its superiority in no pixel expansion, easy to implement and no codebook design. However, VSS generally cannot achieve the lossless recovery of secret image, so the follow-up research is devoted to improving the recovery quality of secret image [21,22,24,25]. And even the threshold was extended later [23]. The latest research [26] has been able to achieve satisfactory quality and imperceptibility.
The VSS has the following advantages:
● It has the characteristic of loss tolerance. Even if some shadow images are lost, the secret image can be recovered successfully.
● Prevent the abuse of power caused by excessive concentration.
● The attacker must obtain enough shadow images to recover the secret image, which ensures the security and integrity.
● Without increasing the risk, the reliability of the system is increased.
At present, there are less research on secret sharing of compressed images, although most of the images transmitted on the network are compressed. Yang and Wu considered secret sharing of AMBTC images [5,27,28,29], which plays an important role in the compressed domain for secret sharing applications. Their schemes extend Ou and Sun's scheme [30] from (2,n) threshold to (k,n) threshold. Furthermore, the scheme proposed by Yang and Wu realizes authentication and reversibility, in which reversibility means that the cover images can also be recovered. Reversible cover images play an important role in law enforcement and medical diagnosis [31]. Nevertheless, the schemes they proposed exist the problems of pixel expansion and stego images looking the same to the naked eye, which is not convenient to manage.
In general, the major challenges are as follows:
● At present, a large number of images need to be transmitted. Especially in the scene which requires high-speed of image transmission, it is particularly important to compress the image before transmission.
● Images can be transmitted by computers, mobile phones or other communication devices. Therefore, in the process of storage and transmission, images may be easily stolen.
● The current secret sharing scheme of AMBTC compressed image has the problems of pixel expansion and the stego images are the same visually, which is inconvenient to manage them.
The main contributions of the AMBTC-based RGVSS scheme with meaningful shadows proposed in this paper are as follows:
● AMBTC compression is used before secret image sharing to reduce the amount of information to be transmitted and shared.
● Even if the attacker get several stego images, he doesn't know any information about the secret image. Thus the security of the secret image is guaranteed.
● The quality of both the recovered secret image and the recovered cover images is satisfactory. The stego images are meaningful and there is no pixel expansion, which is convenient for the management of stego images and is conducive to saving storage space.
The rest of the paper is organized as follows. Section 2 briefly introduces the basic concept of AMBTC, and presents the compression and decompression process of it. Meanwhile, section 2 also simply introduces the VSS. In section 3, our scheme is given in more details, and the theoretical analysis of the proposed scheme is provided. The experimental results and the analysis of the experimental data are demonstrated in section 4. Finally, concluding remarks are given in section 5.
AMBTC is a lossy data compression algorithm for gray image. Because of its simple physical implementation and fast processing, it was once widely used in broadcasting and television [33]. It has been introduced into color image compression, namely color unit compression [32]. In the field of military industry, especially in the field of aviation and aerospace, many factors need to be considered, such as bandwidth, computing time, complexity and image quality. In order to reduce energy consumption and improve processing speed, we should choose a compression algorithm with narrow bandwidth, low computational complexity and high image quality applying to the field of aviation and aerospace. Compared with DCT and DWT, the image quality of AMBTC is relatively poor, but the computational complexity is much lower. Weighing multiple indicators, the performance of AMBTC compression algorithm is better than other compression algorithms. In 1997, the United States used it for image compression of Mars Pathfinder.
AMBTC is a fast image compression algorithm that processes pictures in units of blocks. In each block, the original mean value and standard deviation are kept while the gray levels are reduced to achieve the purpose of compression. If the 4×4 block is used as the basic unit and 8-bit integers are used for transmission or storage, this algorithm can achieve a 4:1 compression ratio. If larger blocks are used, higher compression ratio can be obtained, but the image quality will be reduced accordingly. And after AMBTC compression, the image storage format is BMP.
In this paper, AMBTC compression is used to reduce the information need to be hidden in the process of secret sharing of gray image. Traditional VSS scheme needs to share gray image, while the scheme in this paper only needs to share binary image of the same size.
BTC is a block based lossy compression technology for gray image in most cases, which uses quantization levels to reduce the number of gray pixels to be stored in each block. When the AMBTC technology is used to compress the image, each image is divided into non overlapping blocks with t×t pixels, the value of t is usually taken as 4. In the i-th block of the image, the average pixel value of this block is calculated as
Vi=t×t∑j=1xi,jt×t | (2.1) |
The generation standard of bitmap is as follows: if xi,j≤Vi, the corresponding position in bitmap is marked as "0"; otherwise, the corresponding position in bitmap is marked as "1". Note that q is the number of "1" in the bitmap, and the formulas for calculating the two quantization levels are shown in Eq (2.3) and Eq (2.2) respectively.
Hi=∑xi,j≥Vixi,jq | (2.2) |
Li=∑xi,j≤Vixi,jt×t−q | (2.3) |
Then the i-th block is compressed into two quantization levels and the bitmap.
In the decompression phase, if the quantization levels and bitmaps are obtained at the same time, the corresponding blocks can be restored by replacing "0" in the bitmap with low quantization levels Li and "1" with high quantization levels Hi.
VSS [34] can be recovered without any relevant cryptographic knowledge, and the recovery process is simple. According to the basic principle of implementation, VSS can be roughly divided into codebook-based VSS and RG-based VSS. The scheme based on RG has the advantages of simple implementation and no pixel expansion, so the current research is mostly based on the implementation of it [35]. However, VSS generally cannot achieve the lossless recovery of secret images, so the follow-up research is devoted to improving the recovery quality of secret image [21,22,24,25]. The original visual secret sharing was proposed by Naor and Shamir in 1994 [16]. In threshold VSS, binary secret image is encrypted into random shadow images. When decrypting, more than k shadow images are superimposed, and the secret can be seen through vision. Its core idea is to decrypt through Human Vision System (HVS), without any encryption and decryption knowledge and computing equipment.
At present, VSS is mainly applied to binary image. Considering that the bitmap of AMBTC image can be regarded as a binary image, the bitmap information of the secret image can be hidden through the bitmap of different cover images to realize secret sharing.
Due to the excellent characteristics of AMBTC images, important images can be quickly passed back. Research on the key technology of AMBTC secret image sharing is expected to promote the development of important secret image fast transmission in the fields of edge computing, aerospace and drones.
However, all the schemes proposed in [5,27,28,29] with the pixel expansion, which will cause great pressure on storage and transmission. At the same time, the stego images of the four schemes are similar to the naked eye, and it is inconvenient to manage shadow images. In addition, the quality of the stego images varies when distributed to the participants, which may arouse the suspicion of attackers.
The goal of the proposed scheme is to solve the problems of pixel expansion and inconvenient shadow images management. First of all, the proposed scheme adopts VSS scheme based on RG, which does not produce pixel expansion at all. Secondly, for the (k,n) threshold sharing scheme, n cover images are used to generate n visually different stego images.
The proposed scheme includes three phases: (1) compression phase, (2) sharing phase, (3) recovery phase. Figure 1 demonstrates the framework of the proposed scheme. In addition, the notations used in this paper are introduced in Table 2.
Notations | Decriptions |
k | The minimum number of shadow images (bitmaps) need to be obtained in recovery phase. |
t | The number of stego shadow images actually obtained by the dealer in recovery phase. |
n | The number of cover images used in sharing phase and the total number of shadow images. |
t×t | The block size used in AMBTC compression. |
i | The i-th block of the image. |
SCi | Substitute the shadow images with L and H. |
M×N | The size of the bmp image. |
Vi | The average pixel value of the current block. |
Hi | In the current block, the high quantization level, in other words, the pixels higher than the average pixel value are averaged. |
Li | In the current block, the low quantization level, in other words, the pixel lower than the average pixel value are averaged. |
H | The set of Hi, and we save it with images. |
L | The set of Li, and we save it with images.. |
BMi,j | The value of the bitmap in the position of i,j. |
BM | The entire bitmap of the image. |
In compression phase, the secret image and the cover images are compressed by AMBTC algorithm to generate high and low quantization levels and bitmaps, as stated in 2.1.1. We will give a detailed description of the compression process in Algorithm 1.
Algorithm 1: The compression algorithm of secret image and cover images. |
Input: An original BMP image of size M×N. |
Output:BM, H and L. |
Step 1:Divide the picture into 4×4 blocks. |
Step 2:For each block (i,j)∈{(i,j)|1≤i≤M4,1≤j≤N4}, repeat Steps 3-4 (the commonly used image size is an integral multiple of four). |
Step 3: Calculate Vi of each block, take the average value of the pixel value less than Vi and the average value of the pixel value greater than Vi as L and H respectively. |
Step 4:The position of the pixel value less than Vi is recorded as "0", and greater than Vi is recorded as "1" in the bitmap. |
Step 5:Output BM, H and L. |
In this paper, shadow images refer to the binary images generated by embedding the information of secret image bitmap into the bitmaps of cover images, while stego images refer to the images generated by substituting the quantization levels of the cover image into the shadow images, denoted by SCi.
In compression phase, a secret image and n cover images are compressed into the bitmaps and quantization levels through the same compression process.
In sharing phase, for each pixel of the secret image bitmap, randomly choose k images from n cover images, and judge whether the XOR result of k images' BMi,j is equal to that of secret image BMi,j. If equal, change nothing. Otherwise, randomly choose one of the k cover images, and flip BMi,j of this image.
In recovery phase, as long as any k (0<k≤n) or more participants share their stego images, the bitmap of the recovered image is obtained when XOR decryption is applied. By replacing "0" and "1" in the bitmap with Hi and Li, we can get the decrypted image.
In sharing phase, the (k,n) threshold is realized by using n cover images, and any k of them embeded secret information can decrypt the secret image. The proposed scheme mainly realizes the sharing of bitmaps. For the sharing of each pixel value, randomly select k cover images. If the XOR result of their BMi,j is equal to the value of BMi,j of the secret image, no operation is performed; otherwise, one of the k images is randomly selected, and the BMi,j of it is reversed. Finally, H and L of each cover image generated in the compression process is substituted into the shadow images. Therefore, n stego images are generated, as described in Algorithm 2.
Algorithm 2: Bitmaps sharing algorithm. |
Input: BM of the secret image and BMs of n cover images. |
Output: SCi(i=1,2,⋯,n). |
Step 1:For each pixel of the secret image bitmap, repeat Steps 2-4. |
Step 2:Randomly select k of n cover images, and calculate the XOR result of their BMi,j. |
Step 3:If the result is equal to the BMi,j of the secret image, return to step 1. Otherwise, go to step 4. |
Step 4:Randomly select one of the k images in step 2, and flip its BMi,j. |
Step 5:Substitute H and L of each cover image generated in the compression process into the shadow images obtained in Step 4. |
Step 6:Output SCi(i=1,2,⋯,n). |
In recovery phase, the dealer obtains at least k stego images and takes the XOR result of the stego images' BM as the bitmap of the recovered image. Taking the shadow images as the bitmaps of the cover images and substituting H and L generated in the compression phase into them, the cover images can be recovered. The decrypted image can be obtained by replacing "0" with the low quantization level of the secret image obtained in the compression phase and "1" with the high quantization level, which is detailed in Algorithm 3.
Algorithm 3: Recovery algorithm of the secret image and cover images. |
Input: t(k≤t≤n) stego images, H and L of secret image and cover images. |
Output: The recovered image and n recovered cover images. |
Step 1:Take the XOR result of the t stego images' BM as the bitmap of the recovered image. |
Step 2:Take t shadow images as the bitmaps of the recovered cover images. |
Step 3: For t+1 bitmaps, replace the bitmaps with the corresponding H and L generated in the compression phase. |
Step 4:The gray srcret image and t cover images are recovered. |
Herein, analysis on the performance of the proposed scheme from visual quality and security is given as below. The contrast used in this paper refers to the evaluation of the similarity between the recovered image and the secret image and the clarity of human eye recognition, rather than the contrast of the image in traditional image processing.
Definition 1 (Contrast) The visual quality of the recovered image is evaluated by contrast, which determines the degree of recognition of the recovered image by human eyes. Compared with the secret image, the contrast α is defined as
α=P0−P11+P1=P(S′[AS0]=0)−P(S′[AS1]=0)1+P(S′[AS1]=0). | (3.1) |
Where P1(P0) denotes the probability that the black (white) area corresponding to the secret image be white in the recovered image. P0 is the probability that the white area decode correctly, and P1 is the probability that the black area decode incorrectly. The bigger α, the higher visual quality.
Theorem 1. (Correctness and security) The proposed scheme is an effective construction of VSS, and it meets the requirements of correctness and security.
Proof. The security of the proposed scheme is guaranteed by (k,n) threshold VSS scheme based on RG. Less than k secret images disclose no information of secret image bitmap. At the same time, bitmaps can be recovered losslessly when threshold is (k,k), and the slight degradation of image quality is only related to the compression itself. Therefore, the correctness of the scheme is realized.
The bitmaps of n cover images are uncorrelated, that is, pixels in the same position can be regarded as random values. Therefore, the contrast of the recovered image can refer to [35].
As proved in Chen and Tsao's scheme [35], the contrast of XOR results of w collected stego images is α=(2×(wk))/((2w+1)×(nk)−(wk)).
When 0≤w < k, α=0. Consequently, no secret image information will be divulged.
When k≤w≤n, α≥0. The numerator 2×(wk) is always greater than zero. Given n≥w, we have (2w+1)×(nk)=(2w+1)×(n(n−1)⋯(n−k+1))/(1×2×⋯×k)≥(wk)=(w(w−1)⋯(w−k+1))/(1×2×⋯×k). Therefore, the denominator (2w+1)×(nk)−(wk) is greater than zero, so is the contrast α, implying the secret information on the recovered result is recognizable.
We will present the experimental results and analyses to show the effectiveness and advantages of our scheme in this section. The secret image and the cover images used in this scheme are all uncompressed grayscale images with 512×512 pixels. In order to compare with the scheme proposed by Wu et al. [29] conveniently, we use the same cover images as their scheme, which are demonstrated in Figure 2(a)-2(h). And all the images used in our scheme are downloaded from USC-SIPI and CVG-UGR image databases.
An example of a (2,5) threshold is shown in Figure 3. Among them, Figure 3(a) shows the secret image, Figure 3(b)-3(f) show the five stego images, and Figure 3(g)-3(h) show the reconstructed images using 2 stego image with XOR recovery. Figure 3(b)-3(f) are generated by embedding the bitmap of secret image into the bitmaps of Figure 2(a)-2(e) using the VSS scheme. Simultaneously, we use the same evaluation indexes as the compared scheme to assess the quality of the stego images in Figure 3, which are illustrated in Table 4. The Peak Signal to Noise Ratio (PSNR) of original uncompressed cover images compared with AMBTC cover images is represented by PSNRA−O, the PSNR of original uncompressed images compared with AMBTC stego image is represented by PSNRS−O, and the PSNR of AMBTC cover image compared with AMBTC stego image is represented by PSNRS−A. In Wu et al. [29], PSNRA−O is approximately 29.4 dB and PSNRS−O is approximately 24.6 dB. The value of PSNR decreases by 4.8 dB because of the sharing process, while in our scheme only decreases by about 1.1 dB on average. Therefore, the visual quality of the stego images is much better in our scheme.
PSNR is used to evaluate the visual quality of stego images as well. The higher PSNR is, the better the image quality is. The PSNR of the stego images for (2, 2) threshold are shown in Table 3. We use Figure 2(a)-2(b), 2(c)-2(d), 2(e)-2(f) and 2(g)-2(h) as the cover images respectively. The PSNRS−A values of all the stego images are greater than 34 dB, which means that the proposed scheme can get better visual quality of stego images.
Cover images in Figure 2 | PSNRS−A(dB) of stego image 1 | PSNRS−A(dB) of stego image 2 |
(a) (b) | 35.0359 | 34.4229 |
(c) (d) | 34.7117 | 39.6069 |
(e) (f) | 36.8109 | 35.4058 |
(g) (h) | 34.8926 | 33.6556 |
Stego image | PSNRA−O | PSNRS−O | PSNRS−A | |||
Our method | Wu et al. [29] | Our method | Wu et al. [29] | Our method | Wu et al. [29] | |
1 | 32.8368 | 29.3867 | 32.2722 | 24.6240 | 39.0208 | 26.4169 |
2 | 34.5202 | 29.3867 | 33.4245 | 24.6231 | 38.3990 | 26.4100 |
3 | 35.2864 | 29.3867 | 34.0183 | 24.6551 | 38.6779 | 26.4324 |
4 | 41.1087 | 29.3867 | 39.4648 | 24.6125 | 43.6731 | 26.4180 |
5 | 35.9097 | 29.3867 | 35.0476 | 24.6051 | 40.8447 | 26.4001 |
Schemes | Key technique | ER | Stego image format | Pixel expansion | Reversible | Functionality |
Ref. [27] | VSS, AMBTC | 0.5 | AMBTC compressed | 16 times | Yes | SIS, steganography |
Ref. [5] | VSS, AMBTC | − | AMBTC compressed | 16 times | Yes, partial. | Stacking-to-see decryption |
Ref. [28] | PSIS, HMAC, AMBTC | 0.25 | AMBTC compressed | 2 times | Yes | SIS, authentication, steganography |
Ref. [29] | PSIS, HMAC, AMBTC | 0.25 | AMBTC compressed | 8 times | Yes, partial. | SIS, authentication, steganography |
Our | VSS, AMBTC | 0.5 | AMBTC compressed | No | Yes | SIS, steganography |
In order to compare with the scheme proposed by Wu et al. [29], we analyze the experiments of (2, 2) threshold and (2,5) threshold in detail above. Herein, we adopt PSNR and SSIM to evaluate the visual quality of the recovered secret image. In our scheme, (k,n) threshold are used to do the test of the proposed scheme, among which k and n both range from 2 to 8.
We have tested the influence of n on the quality of the recovered secret image when k is a constant, and the influence of k on the quality of the recovered secret image when n is a constant, as shown in Figure 4(a)-4(c).
We have tested that when k is constant, the impact of n changes on recovered secret image quality and when n is constant, the impact of k changes on recovered secret image, which is demonstrared in Figure 4(a)-4(c). Among them, Figure 4(a) shows when k is constant, the visual quality of the recovered secret image decreases as n increases. Figure 4(b) shows when n is constant, the visual quality of the recovered secret image increases as k increases. The content shown in Figure 4(c) is consistent with the experimental result of Figure 4(a) and 4(b).
In this subsection, we compare the proposed method with other related schemes, and the content is shown in Table 5. The reason why we choose the listed schemes is that they are all secret sharing schemes of AMBTC compression, and for several of them the key technology is VSS.
The same evaluation index ER(Embedding rate) is adopted to evaluate the embedding ability, which is calculated by Eq (4.1). It is obvious that ER is expected to be as large as possible. Compared with other methods, the proposed scheme has no pixel expansion, and after the sharing process, it can generate different stego images which is convenient for the management of these images. The scheme proposed by Yang and Wu et al. [27] requires the users to manage multiple shadows. With the increase of k and n, it is a more and more annoying disadvantage.
Owing to the fact that we employ the VSS, the pleasant advantage of our scheme is that the algorithm for the whole process is relatively simple and does not require a lot of calculations. Meanwhile, when the threshold is (k,k), the bitmap of secret image can be recovered losslessly, and the slight degradation of image quality is only related to the compression algorithm itself. In other cases, the decrypted image and the cover images can be recovered with satisfactory image quality. Meanwhile, the proposed scheme has no authentication capability, which will be the future work of our scheme.
ER=number of shared bitsnumber of bits in stego image | (4.1) |
The experimental results show that the quality of the stego images and the recovered secret image are better than the scheme proposed by Wu et al. [29]. And the value of ER is acceptable compared with other secret sharing schemes of AMBTC. Our scheme has total supremacy in the time cost, pixel expansion and meaningful shadows generation.
However, our scheme has no authentication capability. Moreover, we only do the secret image sharing of the AMBTC compressed image bitmap, and the quantization levels need to be saved by the dealer, which may cause security problems. In the future work, we will consider sharing the bitmap and quantization levels at the same time, as well as providing authentication function.
In this paper, an AMBTC-based visual secret image sharing scheme with meaningful shadows is proposed. Firstly, the secret image and n cover images are compressed into bitmaps and quantization levels. Then, in the sharing phase, the information of the secret image bitmap is hidden in the bitmaps of cover images. Finally, by obtaining enough shadow images, the secret image bitmap is recovered by XOR operation. There is no pixel expansion and the shadow images are meaningful, which are the biggest advantages of the paper. The experimental results and theoretical analysis prove the effectiveness of the proposed scheme, and the visual quality and security of the scheme are satisfactory.
However, only the bitmap of AMBTC compressed image is shared according to the principle of VSS, and the quantization levels need to be saved by the dealer, which may lead to security problems. Moreover, our scheme has no authentication capability. In the future, we will consider the sharing of the bitmap and quantization levels at the same time. Besides, we plan to provide authentication function in the future.
This work is supported by the Program of the National University of Defense Technology and the National Natural Science Foundation of China (Number: 61602491).
The authors declared that they have no conflict of interest, nor any commercial or associative interest conflict in relation to the submitted work.
[1] |
G Akudibillah, A Pandey, J Medlock, Maximizing the benefits of art and prep in resource-limited settings, Epidemiol. Infect., 145 (2017), 942–956. doi: 10.1017/S0950268816002958
![]() |
[2] |
James J. Steinhardt, Javier Guenaga, Hannah L. Turner, Krisha McKee, Mark K. Louder, Sijy O'Dell, et al., Rational design of a trispecific antibody targeting the HIV-1 env with elevated anti-viral activity, Nat. Commun., 9 (2018), 1–12. doi: 10.1038/s41467-017-02088-w
![]() |
[3] |
Marina Caskey, Broadly-neutralizing antibodies (bnabs) for the treatment and prevention of HIV infection, Curr. Opin. HIV AIDS, 15 (2020), 49. doi: 10.1097/COH.0000000000000600
![]() |
[4] |
Julia Niessl, Amy E Baxter, Pilar Mendoza, Mila Jankovic, Yehuda Z Cohen, Allison L Butler, et al., Combination anti-HIV-1 antibody therapy is associated with increased virus-specific T cell immunity, Nat. Med., 26 (2020), 222–227. doi: 10.1038/s41591-019-0747-1
![]() |
[5] |
Matthew R Gardner, Lisa M. Kattenhorn, Hema R. Kondur, Markus Von Schaewen, Tatyana Dorfman, Jessica J Chiang, et al., Aav-expressed ecd4-ig provides durable protection from multiple shiv challenges, Nature, 519 (2015), 87. doi: 10.1038/nature14264
![]() |
[6] |
V. G. Kramer, S. N. Byrareddy, The value of HIV protective epitope research for informed vaccine design against diverse viral pathogens, Expert Rev. Vaccines, 13 (2014), 935–937. doi: 10.1586/14760584.2014.928597
![]() |
[7] |
J. B. Munro, W. Mothes, Structure and dynamics of the native HIV-1 env trimer, J. Virol., 89 (2015), 5752–5755. doi: 10.1128/JVI.03187-14
![]() |
[8] |
J. D. Watkins, J. Diaz-Rodriguez, N. B. Siddappa, D. Corti, R. M. Ruprecht, Efficiency of neutralizing antibodies targeting the cd4-binding site: Influence of conformational masking by the v2 loop in r5-tropic clade c simian-human immunodeficiency virus, J. Virol., 85 (2011), 12811–12814. doi: 10.1128/JVI.05994-11
![]() |
[9] | R. Wyatt, J. Sodroski. The hiv-1 envelope glycoproteins: Fusogens, antigens, and immunogens, Science, 280 (1988), 1884–1888. |
[10] |
J. A. Hoxie, Toward an antibody-based HIV-1 vaccine, Annu. Rev. Med., 61 (2010), 135–152. doi: 10.1146/annurev.med.60.042507.164323
![]() |
[11] |
P. D. Kwong, R. Wyatt, J. Robinson, R. W. Sweet, J. Sodroski, W. A. Hendrickson, Structure of an hiv gp120 envelope glycoprotein in complex with the cd4 receptor and a neutralizing human antibody, Nature, 393 (1998), 648–659. doi: 10.1038/31405
![]() |
[12] |
J. B. Munro, J. Gorman, X. C. Ma, Z. Zhou, J. Arthos, D. R. Burton, et al., Conformational dynamics of single HIV-1 envelope trimers on the surface of native virions, Science, 346 (2014), 759–763. doi: 10.1126/science.1254426
![]() |
[13] |
M. Pancera, T. Q. Zhou, A. Druz, I. S. Georgiev, C. Soto, J. Gorman, et al., Structure and immune recognition of trimeric pre-fusion HIV-1 Env, Nature, 514 (2014), 455-461. doi: 10.1038/nature13808
![]() |
[14] |
R. P. Galimidi, J. S. Klein, M. S. Politzer, S. Y. Bai, M. S. Seaman, M. C. Nussenzweig, et al., Intra-spike crosslinking overcomes antibody evasion by HIV-1, Cell, 160 (2015), 433–446. doi: 10.1016/j.cell.2015.01.016
![]() |
[15] |
Dennis R. Burton, R. Anthony Williamson, Paul WHI Parren, Antibody and virus: Binding and neutralization, Virology, 270 (2000), 1–3. doi: 10.1006/viro.2000.0239
![]() |
[16] | M. E. Davis-Gardner, M. R. Gardner, B. Alfant, M. Farzan, ecd4-ig promotes adcc activity of sera from HIV-1-infected patients, PLoS Pathog., 13 (2017). |
[17] |
G. D. Tomaras, N. L. Yates, P. H. Liu, L. Qin, G. G. Fouda, L. L. Chavez, et al., Initial b-cell responses to transmitted human immunodeficiency virus type 1: Virion-binding immunoglobulin m (igm) and igg antibodies followed by plasma anti-gp41 antibodies with ineffective control of initial viremia, J. Virol., 82 (2008), 12449–12463. doi: 10.1128/JVI.01708-08
![]() |
[18] |
S. M. Ciupe, Mathematical model of multivalent virus-antibody complex formation in humans following acute and chronic HIV infections, J. Math. Biol., 71 (2015), 513–532. doi: 10.1007/s00285-014-0826-3
![]() |
[19] |
S. M. Ciupe, P. De Leenheer, T. B. Kepler, Paradoxical suppression of poly-specific broadly neutralizing antibodies in the presence of strain-specific neutralizing antibodies following HIV infection, J. Theor. Biol., 277 (2011), 55–66. doi: 10.1016/j.jtbi.2011.01.050
![]() |
[20] |
A. Murase, T. Sasaki, T. Kajiwara, Stability analysis of pathogen-immune interaction dynamics, J. Math. Biol., 51 (2005), 247–267. doi: 10.1007/s00285-005-0321-y
![]() |
[21] |
M. A. Nowak, C. R. M. Bangham, Population dynamics of immune responses to persistent viruses, Science, 272 (1996), 74–79. doi: 10.1126/science.272.5258.74
![]() |
[22] |
Ting Guo, Zhipeng Qiu, Libin Rong, Modeling the role of macrophages in HIV persistence during antiretroviral therapy, J. Math. Biol., 81 (2020), 369–402. doi: 10.1007/s00285-020-01513-x
![]() |
[23] |
A. S. R. S. Rao, Probabilities of therapeutic extinction of HIV, Appl. Math. Lett., 19 (2006), 80–86. doi: 10.1016/j.aml.2005.02.040
![]() |
[24] | N. K. Vaidya, R. M. Ribeiro, P. H. Liu, B. F. Haynes, G. D. Tomaras, A. S. Perelson, Correlation between anti-gp41 antibodies and virus infectivity decay during primary hiv-1 infection, Front. microbiol., 9 (2018). |
[25] | O. F. Brandenberg, C. Magnus, P. Rusert, H. F. Guenthard, R. R. Regoes, A. Trkola, Predicting HIV-1 transmission and antibody neutralization efficacy in vivo from stoichiometric parameters, PLoS Pathog., 13 (2017). |
[26] | A. S. R. S. Rao, K. Thomas, K. Sudhakar, R. Bhat, Improvement in survival of people living with HIV/aids and requirement for 1st-and 2nd-line art in India: A mathematical model, Notices Amer. Math. Soc., 4 (2012), 560–562. |
[27] | W. Cao, V. Mehraj, D. E. Kaufmann, T. S. Li, J. P. Routy, Elevation and persistence of cd8 t-cells in hiv infection: The achilles heel in the art era, JIAS, 19 (2016). |
[28] |
H. Mohri, S. Bonhoeffer, S. Monard, A. S. Perelson, D. D. Ho, Rapid turnover of T lymphocytes in SIV-infected rhesus macaques, Science, 279 (1998), 1223–1227. doi: 10.1126/science.279.5354.1223
![]() |
[29] |
A. S. Perelson, D. E. Kirschner, R. Deboer, Dynamics of HIV-infection of cd4+ T-cells, Math. Biosci., 114 (1993), 81–125. doi: 10.1016/0025-5564(93)90043-A
![]() |
[30] | M. Markowitz, M. Louie, A. Hurley, E. Sun, M. Di Mascio, A novel antiviral intervention results in more accurate assessment of human immunodeficiency virus type 1 replication dynamics and T-cell decay in vivo, J. Virol., 7 (2003), 5037–5038. |
[31] |
J. M. Conway, A. S. Perelson, Post-treatment control of HIV infection, PNAS, 112 (2015), 5467–5472. doi: 10.1073/pnas.1419162112
![]() |
[32] |
B. Ramratnam, S. Bonhoeffer, J. Binley, A. Hurley, L. Q. Zhang, J. E. Mittler, et al., Rapid production and clearance of HIV-1 and hepatitis c virus assessed by large volume plasma apheresis, Lancet, 354 (1999), 1782–1785. doi: 10.1016/S0140-6736(99)02035-8
![]() |
[33] |
L. E. Jones, A. S. Perelson, Transient viremia, plasma viral load, and reservoir replenishment in hiv-infected patients on antiretroviral therapy, J. Acquir. Immune Defic. Syndr., 45 (2007), 483–493. doi: 10.1097/QAI.0b013e3180654836
![]() |
[34] | L. B. Rong, A. S. Perelson, Modeling latently infected cell activation: Viral and latent reservoir persistence, and viral blips in HIV-infected patients on potent therapy, PLoS Comput. Biol., 5 (2009). |
[35] | D. S. Callaway, A. S. Perelson. HIV-1 infection and low steady state viral loads. Bull. Math. Biol., 64 (2002), 29–64. |
[36] |
J. Zalevsky, A. K. Chamberlain, H. M. Horton, S. Karki, I. W. L. Leung, T. J. Sproule, et al., Enhanced antibody half-life improves in vivo activity, Nat. Biotechnol., 28 (2010), 157–159. doi: 10.1038/nbt.1601
![]() |
1. | Yuyuan Sun, Ching-Nung Yang, Xuehu Yan, Yuliang Lu, Lei Sun, Robust secret image sharing scheme resistance to maliciously tampered shadows by AMBTC and quantization, 2022, 45, 1567133X, 119267, 10.1016/j.gep.2022.119267 | |
2. | Anju Yadav, Bhavna Saini, Vivek K. Verma, Vipin Pal, A joint medical image compression and encryption using AMBTC and hybrid chaotic system, 2021, 24, 0972-0529, 2233, 10.1080/09720529.2021.2011102 |
![]() |
BMP | AMBTC | DCT | DWT |
CR | 1 | 4 | 10-40 | 4-40 |
CS | Fastest | Fast | Slower | Slowest |
RSB | Wide | Narrow | Narrower | Narrowest |
IQ | Best | Good | Quite Good | Better |
Notations | Decriptions |
k | The minimum number of shadow images (bitmaps) need to be obtained in recovery phase. |
t | The number of stego shadow images actually obtained by the dealer in recovery phase. |
n | The number of cover images used in sharing phase and the total number of shadow images. |
t×t | The block size used in AMBTC compression. |
i | The i-th block of the image. |
SCi | Substitute the shadow images with L and H. |
M×N | The size of the bmp image. |
Vi | The average pixel value of the current block. |
Hi | In the current block, the high quantization level, in other words, the pixels higher than the average pixel value are averaged. |
Li | In the current block, the low quantization level, in other words, the pixel lower than the average pixel value are averaged. |
H | The set of Hi, and we save it with images. |
L | The set of Li, and we save it with images.. |
BMi,j | The value of the bitmap in the position of i,j. |
BM | The entire bitmap of the image. |
Algorithm 1: The compression algorithm of secret image and cover images. |
Input: An original BMP image of size M×N. |
Output:BM, H and L. |
Step 1:Divide the picture into 4×4 blocks. |
Step 2:For each block (i,j)∈{(i,j)|1≤i≤M4,1≤j≤N4}, repeat Steps 3-4 (the commonly used image size is an integral multiple of four). |
Step 3: Calculate Vi of each block, take the average value of the pixel value less than Vi and the average value of the pixel value greater than Vi as L and H respectively. |
Step 4:The position of the pixel value less than Vi is recorded as "0", and greater than Vi is recorded as "1" in the bitmap. |
Step 5:Output BM, H and L. |
Algorithm 2: Bitmaps sharing algorithm. |
Input: BM of the secret image and BMs of n cover images. |
Output: SCi(i=1,2,⋯,n). |
Step 1:For each pixel of the secret image bitmap, repeat Steps 2-4. |
Step 2:Randomly select k of n cover images, and calculate the XOR result of their BMi,j. |
Step 3:If the result is equal to the BMi,j of the secret image, return to step 1. Otherwise, go to step 4. |
Step 4:Randomly select one of the k images in step 2, and flip its BMi,j. |
Step 5:Substitute H and L of each cover image generated in the compression process into the shadow images obtained in Step 4. |
Step 6:Output SCi(i=1,2,⋯,n). |
Algorithm 3: Recovery algorithm of the secret image and cover images. |
Input: t(k≤t≤n) stego images, H and L of secret image and cover images. |
Output: The recovered image and n recovered cover images. |
Step 1:Take the XOR result of the t stego images' BM as the bitmap of the recovered image. |
Step 2:Take t shadow images as the bitmaps of the recovered cover images. |
Step 3: For t+1 bitmaps, replace the bitmaps with the corresponding H and L generated in the compression phase. |
Step 4:The gray srcret image and t cover images are recovered. |
Cover images in Figure 2 | PSNRS−A(dB) of stego image 1 | PSNRS−A(dB) of stego image 2 |
(a) (b) | 35.0359 | 34.4229 |
(c) (d) | 34.7117 | 39.6069 |
(e) (f) | 36.8109 | 35.4058 |
(g) (h) | 34.8926 | 33.6556 |
Stego image | PSNRA−O | PSNRS−O | PSNRS−A | |||
Our method | Wu et al. [29] | Our method | Wu et al. [29] | Our method | Wu et al. [29] | |
1 | 32.8368 | 29.3867 | 32.2722 | 24.6240 | 39.0208 | 26.4169 |
2 | 34.5202 | 29.3867 | 33.4245 | 24.6231 | 38.3990 | 26.4100 |
3 | 35.2864 | 29.3867 | 34.0183 | 24.6551 | 38.6779 | 26.4324 |
4 | 41.1087 | 29.3867 | 39.4648 | 24.6125 | 43.6731 | 26.4180 |
5 | 35.9097 | 29.3867 | 35.0476 | 24.6051 | 40.8447 | 26.4001 |
Schemes | Key technique | ER | Stego image format | Pixel expansion | Reversible | Functionality |
Ref. [27] | VSS, AMBTC | 0.5 | AMBTC compressed | 16 times | Yes | SIS, steganography |
Ref. [5] | VSS, AMBTC | − | AMBTC compressed | 16 times | Yes, partial. | Stacking-to-see decryption |
Ref. [28] | PSIS, HMAC, AMBTC | 0.25 | AMBTC compressed | 2 times | Yes | SIS, authentication, steganography |
Ref. [29] | PSIS, HMAC, AMBTC | 0.25 | AMBTC compressed | 8 times | Yes, partial. | SIS, authentication, steganography |
Our | VSS, AMBTC | 0.5 | AMBTC compressed | No | Yes | SIS, steganography |
![]() |
BMP | AMBTC | DCT | DWT |
CR | 1 | 4 | 10-40 | 4-40 |
CS | Fastest | Fast | Slower | Slowest |
RSB | Wide | Narrow | Narrower | Narrowest |
IQ | Best | Good | Quite Good | Better |
Notations | Decriptions |
k | The minimum number of shadow images (bitmaps) need to be obtained in recovery phase. |
t | The number of stego shadow images actually obtained by the dealer in recovery phase. |
n | The number of cover images used in sharing phase and the total number of shadow images. |
t×t | The block size used in AMBTC compression. |
i | The i-th block of the image. |
SCi | Substitute the shadow images with L and H. |
M×N | The size of the bmp image. |
Vi | The average pixel value of the current block. |
Hi | In the current block, the high quantization level, in other words, the pixels higher than the average pixel value are averaged. |
Li | In the current block, the low quantization level, in other words, the pixel lower than the average pixel value are averaged. |
H | The set of Hi, and we save it with images. |
L | The set of Li, and we save it with images.. |
BMi,j | The value of the bitmap in the position of i,j. |
BM | The entire bitmap of the image. |
Algorithm 1: The compression algorithm of secret image and cover images. |
Input: An original BMP image of size M×N. |
Output:BM, H and L. |
Step 1:Divide the picture into 4×4 blocks. |
Step 2:For each block (i,j)∈{(i,j)|1≤i≤M4,1≤j≤N4}, repeat Steps 3-4 (the commonly used image size is an integral multiple of four). |
Step 3: Calculate Vi of each block, take the average value of the pixel value less than Vi and the average value of the pixel value greater than Vi as L and H respectively. |
Step 4:The position of the pixel value less than Vi is recorded as "0", and greater than Vi is recorded as "1" in the bitmap. |
Step 5:Output BM, H and L. |
Algorithm 2: Bitmaps sharing algorithm. |
Input: BM of the secret image and BMs of n cover images. |
Output: SCi(i=1,2,⋯,n). |
Step 1:For each pixel of the secret image bitmap, repeat Steps 2-4. |
Step 2:Randomly select k of n cover images, and calculate the XOR result of their BMi,j. |
Step 3:If the result is equal to the BMi,j of the secret image, return to step 1. Otherwise, go to step 4. |
Step 4:Randomly select one of the k images in step 2, and flip its BMi,j. |
Step 5:Substitute H and L of each cover image generated in the compression process into the shadow images obtained in Step 4. |
Step 6:Output SCi(i=1,2,⋯,n). |
Algorithm 3: Recovery algorithm of the secret image and cover images. |
Input: t(k≤t≤n) stego images, H and L of secret image and cover images. |
Output: The recovered image and n recovered cover images. |
Step 1:Take the XOR result of the t stego images' BM as the bitmap of the recovered image. |
Step 2:Take t shadow images as the bitmaps of the recovered cover images. |
Step 3: For t+1 bitmaps, replace the bitmaps with the corresponding H and L generated in the compression phase. |
Step 4:The gray srcret image and t cover images are recovered. |
Cover images in Figure 2 | PSNRS−A(dB) of stego image 1 | PSNRS−A(dB) of stego image 2 |
(a) (b) | 35.0359 | 34.4229 |
(c) (d) | 34.7117 | 39.6069 |
(e) (f) | 36.8109 | 35.4058 |
(g) (h) | 34.8926 | 33.6556 |
Stego image | PSNRA−O | PSNRS−O | PSNRS−A | |||
Our method | Wu et al. [29] | Our method | Wu et al. [29] | Our method | Wu et al. [29] | |
1 | 32.8368 | 29.3867 | 32.2722 | 24.6240 | 39.0208 | 26.4169 |
2 | 34.5202 | 29.3867 | 33.4245 | 24.6231 | 38.3990 | 26.4100 |
3 | 35.2864 | 29.3867 | 34.0183 | 24.6551 | 38.6779 | 26.4324 |
4 | 41.1087 | 29.3867 | 39.4648 | 24.6125 | 43.6731 | 26.4180 |
5 | 35.9097 | 29.3867 | 35.0476 | 24.6051 | 40.8447 | 26.4001 |
Schemes | Key technique | ER | Stego image format | Pixel expansion | Reversible | Functionality |
Ref. [27] | VSS, AMBTC | 0.5 | AMBTC compressed | 16 times | Yes | SIS, steganography |
Ref. [5] | VSS, AMBTC | − | AMBTC compressed | 16 times | Yes, partial. | Stacking-to-see decryption |
Ref. [28] | PSIS, HMAC, AMBTC | 0.25 | AMBTC compressed | 2 times | Yes | SIS, authentication, steganography |
Ref. [29] | PSIS, HMAC, AMBTC | 0.25 | AMBTC compressed | 8 times | Yes, partial. | SIS, authentication, steganography |
Our | VSS, AMBTC | 0.5 | AMBTC compressed | No | Yes | SIS, steganography |