A Cover-Independent Deep Image Hiding Method Based on Domain Attention Mechanism

Recently,deep image-hiding techniques have attracted considerable attention in covert communication and high-capacity information hiding.However,these approaches have some limitations.For example,a cover image lacks self-adaptability,information leakage,or weak concealment.To address these issues,this study proposes a universal and adaptable image-hiding method.First,a domain attention mechanism is designed by combining the Atrous convolution,which makes better use of the relationship between the secret image domain and the cover image domain.Second,to improve perceived human similarity,perceptual loss is incorporated into the training process.The experimental results are promising,with the proposed method achieving an average pixel discrepancy(APD)of 1.83 and a peak signal-to-noise ratio(PSNR)value of 40.72 dB between the cover and stego images,indicative of its high-quality output.Furthermore,the structural similarity index measure(SSIM)reaches 0.985 while the learned perceptual image patch similarity(LPIPS)remarkably registers at 0.0001.Moreover,self-testing and cross-experiments demonstrate the model’s adaptability and generalization in unknown hidden spaces,making it suitable for diverse computer vision tasks.

Image Hiding with High Robustness Based on Dynamic Region Attention in the Wavelet Domain

Hidden capacity,concealment,security,and robustness are essential indicators of hiding algorithms.Currently,hiding algorithms tend to focus on algorithmic capacity,concealment,and security but often overlook the robustness of the algorithms.In practical applications,the container can suffer from damage caused by noise,cropping,and other attacks during transmission,resulting in challenging or even impossible complete recovery of the secret image.An image hiding algorithm based on dynamic region attention in the multi-scale wavelet domain is proposed to address this issue and enhance the robustness of hiding algorithms.In this proposed algorithm,a secret image of size 256×256 is first decomposed using an eight-level Haar wavelet transform.The wavelet transform generates one coefficient in the approximation component and twenty-four detail bands,which are then embedded into the carrier image via a hiding network.During the recovery process,the container image is divided into four non-overlapping parts,each employed to reconstruct a low-resolution secret image.These lowresolution secret images are combined using densemodules to obtain a high-quality secret image.The experimental results showed that even under destructive attacks on the container image,the proposed algorithm is successful in recovering a high-quality secret image,indicating that the algorithm exhibits a high degree of robustness against various attacks.The proposed algorithm effectively addresses the robustness issue by incorporating both spatial and channel attention mechanisms in the multi-scale wavelet domain,making it suitable for practical applications.In conclusion,the image hiding algorithm introduced in this study offers significant improvements in robustness compared to existing algorithms.Its ability to recover high-quality secret images even in the presence of destructive attacksmakes it an attractive option for various applications.Further research and experimentation can explore the algorithm’s performance under different scenarios and expand its potential applications.

Image Hiding Algorithm in Discrete Cosine Transform Domain Based on Grey Prediction and Grey Relational Analysis

Traditional information hiding algorithms cannot maintain a good balance of capacity,invisibility and robustness.In this paper,a novel blind colour image information hiding algorithm based on grey prediction and grey relational analysis in the Discrete Cosine Transform(DCT) domain is proposed.First,this algorithm compresses the secret image losslessly based on the improved grey prediction GM(1,1)(IGM) model.It then chooses the blocks of rich texture in the cover image as the embedding regions using Double-dimension Grey Relational Analysis(DGRA).Finally,it adaptively embeds the compressed secret bits stream into the DCT domain mid-frequency coefficients,which are decided by those blocks' Double-Dimension Grey Correlation Degree(DGCD) and Human Visual System(HVS).This method can ensure an adequate balance between invisibility,capacity and robustness.Experimental results show that the proposed algorithm is robust against JPEG compression(46.724 6 dB when the compression quality factor is 90%),Gaussian noise(45.531 3 dB when the parameter is(0,0.000 5)) etc.,and it is a blind information hiding algorithm that can be extracted without an original carrier.

An Image Encryption Method Based on Bit Plane Hiding Technology

A novel image hiding method based on the correlation analysis of bit plane is described in this paper. Firstly, based on the correlation analysis, different bit plane of a secret image is hided in different bit plane of several different open images. And then a new hiding image is acquired by a nesting ＂Exclusive-OR＂ operation on those images obtained from the first step. At last, by employing image fusion technique, the final hiding result is achieved. The experimental result shows that the method proposed in this paper is effec rive.

The Hiding Characteristic of F-interior Hiding Image and Its Applications

By using function one direction S-rough sets,the concept of F-interior hiding image is presented; the theorem of F-interior hiding and the recognition criteria of interior hiding are proposed; and the applications of F-interior hiding image are given. F-interior hiding image is a new application area of function S-rough sets,and function S-rough sets is a new theory and new tools for iconology research.

Reversible data hiding in encrypted images based on additive secret sharing and additive joint coding using an intelligent predictor

Reversible data hiding in encrypted images(RDHEI)is essential for safeguarding sensitive information within the encrypted domain.In this study,we propose an intelligent pixel predictor based on a residual group block and a spatial attention module,showing superior pixel prediction performance compared to existing predictors.Additionally,we introduce an adaptive joint coding method that leverages bit-plane characteristics and intra-block pixel correlations to maximize embedding space,outperforming single coding approaches.The image owner employs the presented intelligent predictor to forecast the original image,followed by encryption through additive secret sharing before conveying the encrypted image to data hiders.Subsequently,data hiders encrypt secret data and embed them within the encrypted image before transmitting the image to the receiver.The receiver can extract secret data and recover the original image losslessly,with the processes of data extraction and image recovery being separable.Our innovative approach combines an intelligent predictor with additive secret sharing,achieving reversible data embedding and extraction while ensuring security and lossless recovery.Experimental results demonstrate that the predictor performs well and has a substantial embedding capacity.For the Lena image,the number of prediction errors within the range of[-5,5]is as high as 242500 and our predictor achieves an embedding capacity of 4.39 bpp.

High capacity reversible data hiding in encrypted images based on adaptive quadtree partitioning and MSB prediction

To improve the embedding capacity of reversible data hiding in encrypted images(RDH-EI),a new RDH-EI scheme is proposed based on adaptive quadtree partitioning and most significant bit(MSB)prediction.First,according to the smoothness of the image,the image is partitioned into blocks based on adaptive quadtree partitioning,and then blocks of different sizes are encrypted and scrambled at the block level to resist the analysis of the encrypted images.In the data embedding stage,the adaptive MSB prediction method proposed by Wang and He(2022)is improved by taking the upper-left pixel in the block as the target pixel,to predict other pixels to free up more embedding space.To the best of our knowledge,quadtree partitioning is first applied to RDH-EI.Simulation results show that the proposed method is reversible and separable,and that its average embedding capacity is improved.For gray images with a size of 512×512,the average embedding capacity is increased by 25565 bits.For all smooth images with improved embedding capacity,the average embedding capacity is increased by about 35530 bits.