MXMengyao Xiao

Mengyao Xiao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mengyao Xiao has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • High-Capacity Reversible Data Hiding for JPEG Images Using Ternary Matrix Embedding

    by Mengyao Xiao, Xiaolong Li, Jian Li, Qingchao Jiang, Yao Zhao

    Reversible data hiding (RDH) for JPEG images, particularly those focusing on DCT coefficient modification, has garnered significant attention in recent years. Existing methods primarily select coefficients valued $\pm 1$ for expansion embedding to avoid significant file size increases caused by modifying zero-valued DCT coefficients. However, zero-valued coefficients, which constitute the majority of DCT coefficients, are more suitable for data embedding to reduce the shift distortion. To efficiently utilize zero-valued coefficients for high-capacity embedding while controlling the file size increment, this paper introduces a novel JPEG RDH method based on ternary matrix embedding, where ternary syndrome trellis codes (STC) is employed on selected zero-valued coefficients to minimize the expansion embedding distortion, and other non-zero-valued coefficients are shifted for reversibility. Furthermore, a novel DCT coefficients measurement strategy is proposed for coefficient selection to further reduce the shift distortion. Extensive experimental validations demonstrate the superiority of the proposed method in various evaluation criteria. Notably, the proposed method achieves more than twice the embedding capacity of some state-of-the-art methods at the same PSNR while maintaining file size increment within acceptable bounds.


  • Matrix Embedding Based Multiple Histograms Modification for Efficient Reversible Data Hiding

    by Xiang Li, Mengyao Xiao, Xiaolong Li, Shijun Xiang, Yao Zhao

    Recently, matrix embedding (ME), a well-known steganographic technique, has been employed in reversible data hiding (RDH) for the first time, improving the performance of single histogram modification (SHM) methods. In this letter, the ME-based RDH strategy is extended from SHM to the more effective multiple histograms modification (MHM) to further improve the reversible embedding performance. The capacity-distortion model is first established in the novel scenario. Then, some theoretical results for payload partition and expansion-bins-determination are given. Finally, based on the derived theoretical investigations, an efficient RDH method with low computational complexity is proposed. Experimental results show that the proposed method can achieve better visual quality compared to some state-of-the-art methods.


  • Open Access

    High-Quality Reversible Data Hiding Based on Multi-Embedding for Binary Images

    by Xiang Li, Xiaolong Li, Mengyao Xiao, Yao Zhao, Hsunfang Cho

    Unlike histogram-based reversible data hiding (RDH), the general distortion-based framework considers pixel-by-pixel distortions, which is a new research direction in RDH. The advantage of the general distortion-based RDH method is that it can enhance the visual quality of the marked image by embedding data into visually insensitive regions (e.g., edges and textures). In this paper, following this direction, a high-capacity RDH approach based on multi-embedding is proposed. The cover image is decoupled to select the embedding sequence that can better utilize texture pixels and reduce the size of the reconstruction information, and a multi-embedding strategy is proposed to embed the secret data along with the reconstruction information by matrix embedding. The experimental results demonstrate that the proposed method provides a superior visual quality and higher embedding capacity than some state-of-the-art RDH works for binary images. With an embedding capacity of 1000 bits, the proposed method achieves an average PSNR of 49.45 dB and an average SSIM of 0.9705 on the test images. This marks an improvement of 1.1 dB in PSNR and 0.0242 in SSIM compared to the latest state-of-the-art RDH method.


  • Reversible Data Hiding for JPEG Images With Adaptive Multiple Two-Dimensional Histogram and Mapping Generation

    by Shaowei Weng, Ye Zhou, Tiancong Zhang, Mengyao Xiao, Yao Zhao

    Reversible data hiding based on joint photographic experts group (JPEG) images has been extensively studied to enhance embedding performance in terms of visual quality and file size preservation at the desired payload. In this paper, an efficient adaptive RDH method for JPEG images with multiple two-dimensional (2D) histogram modification is proposed. Firstly, the proposed method proposes the block smoothness estimator and the band smoothness estimator, and then combines the two estimators to reduce the embedding distortion as much as possible at the desired payload. Instead of adopting a fixed 2D mapping or choosing one from several empirically-designed mappings for each 2D histogram, the proposed method designs an adaptive 2D mapping generation strategy to adaptively generate a large number of mappings with considering the local characteristics of histogram distribution. Since exhaustively searching for the optimal mapping achieving the highest embedding performance for each 2D histogram is time-consuming, an improved discrete particle swarm optimization is utilized in the proposed method to speed up the optimization process. Extensive experimental results also demonstrate the effectiveness of the proposed method in terms of visual quality and file size increment of the stego image.


  • Open Access

    A Novel Reversible Data Hiding Scheme Based on Pixel-Residual Histogram

    by Mengyao Xiao, Xiaolong Li, Yao Zhao, Bin Ma, Guodong Guo

    Prediction-error expansion (PEE) is the most popular reversible data hiding (RDH) technique due to its efficient capacity-distortion tradeoff. With the generated prediction-error histogram (PEH) and adaptively selected expansion bins, the image redundancy is well exploited by PEE. However, for the most widely used rhombus predictor, the rounding operation which groups different prediction-errors into one value is completely unnecessary. The embedding can be extended to a general case by removing the rounding operation, and more histogram bins can be derived for expansion with a new mapping mechanism. Therefore, in this article, instead of pixel prediction-error, we propose to compute the pixel residuals without the rounding operation, and a new embedding mechanism based on pixel-residual histogram (PRH) modification is devised. In PRH, four bins correspond to one bin in PEH. Then, different from the one-to-one mapping between the prediction-error and pixel modification, a four-to-one mapping between the pixel-residual and pixel modification is established, and the performance is optimized by adaptively selecting four expansion bin pairs for embedding. Since more modification selections are considered, better performance can be obtained. Moreover, the proposed scheme is extended to the two-dimensional (2D) histogram and multiple histograms based embedding, and the performance is further enhanced. The superiority of the proposed method is experimentally verified by comparing it with some state-of-the-art works.


  • General Distortion Based Reversible Data Hiding for Binary Covers

    by Mengyao Xiao, Xiaolong Li, Yao Zhao

    The problem of general distortion model for reversible data hiding (RDH) is investigated in this letter. Unlike previous RDH schemes that regard the cover image as a memoryless sequence and assign the same distortion for each pixel, in this work, the modification distortion is adaptively defined for each pixel for visual performance enhancement. The situation is totally different compared with the traditional RDH approaches, and the classical histogram based methods can not be utilized. To deal with this new and challenging problem, we then propose a two-steps embedding framework. Considering binary image as cover, firstly, some pixels are selected and losslessly compressed as the reconstruction information for image recovery. Then, with the adaptively defined distortion and by utilizing matrix embedding, the secret message and the reconstruction information are embedded into the cover. In this way, reversible embedding is realized while the total distortion is minimized. By comparing with some previous RDH schemes for binary covers, experimental results show that better visual performance is achieved by the proposed method.


  • General Framework to Reversible Data Hiding for JPEG Images With Multiple Two-Dimensional Histograms

    by Shaowei Weng, Ye Zhou, Tiancong Zhang, Mengyao Xiao, Yao Zhao

    In this paper, a general reversible data hiding (RDH) framework for joint photographic experts group (JPEG) images with multiple two dimensional histograms (2DHs) is proposed. Regardless of whether zero alternating current (AC) coefficients are included to join data embedding or only non-zero AC coefficients are applied, the performance in terms of visual quality and file size increment is improved by using the proposed framework. This framework is mainly composed of the following three parts: histogram generation, adaptive 2DH mapping selection, and improved discrete particle swarm optimization (IDPSO). Unlike existing 2DH-based JPEG RDH methods, in which a uniform threshold is utilized to construct multiple histograms, in histogram generation, thresholds for different histograms are adaptively assigned according to the local properties of histogram coefficients. As a result, as many coefficients in complex regions as possible are excluded from the construction of each histogram. We subtly design multiple 2DH mappings, and adaptively select 2DH mappings for different 2DHs based on their distribution characteristics. Through slight adjustments, each 2DH mapping can be employed in cases where either zero AC coefficients or only non-zero AC coefficients are used for data embedding. Adaptive threshold and 2DH mapping selection provide a better image quality at a given embedding capacity but inevitably cause considerable complexity cost. To significantly reduce the computational cost, we propose IDPSO by combining differential evolution. IDPSO has the advantages of rapid convergence speed as well as satisfactory qualities of the best solutions. With the help of differential evolution, IDPSO expands the diversity of particles and efficiently avoids local optimal trapping problems. The experimental results also demonstrate the effectiveness of the proposed method in terms of visual quality, file size increment and complexity cost.