一种大容量的可逆RGB图像信息隐藏算法

该文介绍并分析了RGB图像的直方图特性,详细阐述了直方图的峰值点和零值点的特点和直方图平移对图像的影响。在此基础上,根据视觉特性的特点,提出了一种新的RGB图像信息隐藏算法:一种大容量的可逆RGB图像信息隐藏算法。该算法基于直方图平移和视觉特性,能解决当前基于直方图平移算法的低隐藏容量难点。实验结果及分析表明,该算法易于实现,有很好的隐蔽性并对隐藏容量有较大提高。     

一种大容量的可逆RGB图像信息隐藏算法

该文介绍并分析了RGB图像的直方图特性,详细阐述了直方图的峰值点和零值点的特点和直方图平移对图像的影响。在此基础上,根据视觉特性的特点,提出了一种新的RGB图像信息隐藏算法：一种大容量的可逆RGB图像信息隐藏算法。该算法基于直方图平移和视觉特性,能解决当前基于直方图平移算法的低隐藏容量难点。实验结果及分析表明,该算法易于实现,有很好的隐蔽性并对隐藏容量有较大提高。     

基于混沌系统的图像可逆信息隐藏算法

为了提高图像可逆信息隐藏算法的安全性、透明性、嵌入容量,提出了一种基于混沌系统的图像可逆信息隐藏算法.该隐藏算法通过将载体图像直方图峰值点与其两侧多个连续零值点之间建立关系的方式,实现在载体图像的单个峰值点嵌入多个秘密信息位,以保证较高的透明性和较大的嵌入容量.为了保证嵌入载体图像内的秘密信息的安全性,采用混沌系统对秘...     

基于不同扫描顺序差值的可逆信息隐藏算法

为实现敏感图像的大容量可逆信息隐藏,提出一种基于图像相邻像素差值的大容量无损隐藏算法。通过将图像分块,对每个分块按照不同的扫描顺序计算差值,对差值序列进行比较,选取最优扫描顺序生成的差值直方图。从差值直方图中选取2个最大峰值点,每个峰值点选取最近的多个零值点,在峰值像素点插入多位秘密信息,从而实现图像大容量的可逆信息隐藏。仿真结果表明,该算法能根据不同分块图像的像素分布动态选择最优扫描顺序,且利用双峰值多零点嵌入,在嵌入隐秘信息后的峰值信噪比相差不大的情况下,可大幅提高隐写容量。     

基于图像块像素差的大容量无损信息隐藏算法

为使提取嵌入的秘密信息后能无损恢复原始载体图像,提出一种基于图像块相邻像素差的大容量无损信息隐藏算法。将原始载体图像进行分块,并按一定顺序扫描图像块得到一系列像素序列,通过计算每个序列中相邻像素的差值得到差值直方图,从中选择2个最大峰值点将秘密信息嵌入。实验结果表明,与其他无损嵌入算法相比,该算法在保证较好不可见性的情况下,信息嵌入容量较大,峰值信噪比较高。     

用于实现图像对比度增强的可逆数据隐藏算法

针对已有算法嵌入率低、算法过程复杂等问题,提出一种新的可逆数据隐藏算法。算法为了提高信息隐藏率,首先选取直方图中值点两侧的峰值进行数据嵌入。在多次嵌入之后,算法选择中值点位置嵌入所有峰值信息,由于中值点在嵌入后可以直接定位,因此可以实现可逆嵌入与恢复,从而不需要已有算法最低有效位的替换过程,减少了算法过程的复杂性。算法在两个图像集上进行性能测试,先与已有算法进行数据嵌入量比较,接着与MATLAB中3个对比度增强函数进行比较,用于评估算法的嵌入容量以及对比度增强后的图像质量。实验结果表明,所提算法在实现可逆数据隐藏和对比度增强的同时,嵌入容量有较大的提高。     

基于差值直方图的简单高效可逆信息隐藏方法

提出一种基于图像相邻像素差值直方图的可逆信息隐藏方法,运用该方法同时提高了信息嵌入容量和嵌入信息后的图像质量。首先对原始图像进行分块、扫描并求取差值直方图,然后在分块图像的差值直方图中选取最高的两个峰值点并向两个方向移位来产生空缺用于信息嵌入。算法充分利用了自然图像的相邻相似特性,同时提高了基于直方图的信息隐藏方案的峰值点数目和峰值点高度,从而大大提高信息嵌入容量。此外,算法在信息嵌入前对待嵌入信息的预处理使得在嵌入同样容量的信息时,对载体图像的影响更小,具有更好的嵌入后图像质量。     

一种基于三像素点分块的信息隐藏算法*

提出了一种新的空域隐藏算法。该算法利用三像素值之间的大小关系来隐藏信息,将载体图像分成包含三像素的小块,修改第一、第三像素值来调整大小关系;另外对秘密图像进行了Arnold置乱预处理,利用混沌序列进行间隔隐藏。实验表明,该算法实现容易、隐藏量大、安全性和不可见性好,当嵌入率达到98.8%,峰值信噪比PSNR＞38 dB。     

基于中值预测的四轮嵌入可逆信息隐藏算法

传统基于预测误差直方图平移的可逆信息隐藏算法大多通过固定顺序来扫描原始图像,从而进行数据嵌入,这种方式没有考虑图像本身的纹理信息,导致无效移位像素点较多,伪装图像视觉质量较差。为解决该问题,提出一种基于中值预测的四轮嵌入可逆信息隐藏算法,以在提高嵌入容量的同时降低伪装图像的失真率。利用相邻像素之间具有较强相关性的特点,在较小的误差值处聚集大量像素点,以得到更陡峭的预测误差直方图并提高嵌入容量。对每个像素点定义复杂度,根据复杂度的高低对预测误差进行排序,优先在图像平滑区域嵌入数据,从而有效减少无效移位像素点个数,降低伪装图像的失真率。实验结果表明,该算法的最大嵌入率可以达到0.3 bpp,在0.1 bpp的嵌入率下峰值信噪比高达55.15 dB,与非对称直方图算法、误差直方图移位算法等相比,其具有较高的嵌入容量和较小的视觉失真率。     

图像信息隐藏不可感知性指标研究

分析目前衡量信息隐藏算法不可感知性指标的不足之处,根据人类视觉特性,提出一种新的有原始载体图像作对照时的视觉不可感知性评价指标,该指标综合考虑了载体图像的背景照度、背景纹理复杂性、空间位置及其方向性对视觉掩蔽效应的影响,试验证明该指标能比峰值信噪比及加权峰值信噪比更好地衡量隐藏信息的不可感知性.它不但能评价灰度图像,而且能评价二值图像,解决了灰度图像与二值图像不能使用同一评价指标的问题.     

Reversible data hiding scheme based on neighboring pixel differences

In this paper, we propose a reversible data hiding algorithm for grayscale images. Specifically, our algorithm is based on the histogram modification technique. The premise of this algorithm is that a histogram is constructed from the differences between each pixel and its neighbors. In the data embedding process, a modified histogram shifting scheme is used to embed a secret message into the pixels whose pixel difference is located at the peak value within the histogram. Experimental results show that our algorithm can achieve higher embedding capacity and imperceptible distortion. Performance comparisons with other existing algorithms are also provided to demonstrate the feasibility of our proposed algorithm in reversible data hiding.     

Three-dimensional histogram shifting for reversible data hiding

Histogram shifting is an important method of reversible data hiding. However, every pixel, difference, or prediction-error is respectively changed to hide a data bit in the traditional histogram shifting, which constrains the capacity-distortion embedding performance. An efficient three-dimensional histogram shifting is proposed for reversible data hiding in this paper. Take H.264 videos as covers to show this method. In a 4 × 4 quantized discrete cosine transform luminance block, which is not inferred by others, three alternating current coefficients are selected randomly as an embeddable group. According to the different values of the selected coefficient groups, they could be divided into different sets. Data could be hidden according to these sets. In the traditional histogram shifting, only one information bit could be hidden with at most one modification of one coefficient, whereas two data bits could be hidden at the same cost by using the proposed scheme. The superiority of the presented technique is verified through experiments.     

Lossless data hiding for absolute moment block truncation coding using histogram modification

This paper presents a lossless data hiding method for an absolute moment block truncation coding (AMBTC) images, which is a compressed grayscale image. It is not easy to hide secret data in an AMBTC-compressed image because it is composed of bit planes. Thus, it is very sensitive to change some pixels. Nevertheless, to improve the hiding capacity, we present an efficient extension of the histogram modification technique by counting the coefficients of the bit planes in each 4 × 4 block. In addition, our proposed scheme has low complexity and achieves a high embedding capacity with the good perceptual quality compared to the prior arts. In an experiment, we verified our proposed data hiding scheme through the comparison with previous methods.     

结合层次结构和直方图平移的无损数据隐藏

针对现有基于差值直方图方法利用原始图像结构关系上的不足,提出了一种基于层次结构和差值直方图平移的无损数据隐藏方法RDH-HSDHS。RDH-HSDHS利用原始图像数据块中像素的差值形成直方图,充分利用图像中相邻像素间的相关性嵌入数据,为了进一步利用数据块中的参考像素进行数据嵌入,将参考像素组成新的图像进行下一层水印嵌入,直到当前层的嵌入容量小于解码所需的附加信息的长度或隐秘图像质量小于给定阈值。实验仿真结果表明,RDH-HSDHS能较好利用原始图像的全局和局部特性,在嵌入容量和隐秘图像质量之间达到较好的折中,在隐秘图像质量超过30 dB的同时,嵌入容量大于0.75 bit/pixel。另外,与相似方法的性能比较证明了提出方法的优势。该方法能有效应用于高质量需求的图像载体中进行信息隐藏。     

Multilevel reversible data hiding based on histogram modification of difference images

Reversible data hiding has drawn considerable attention in recent years. Reversibility allows original media to be completely recovered from marked media without distortion after embedded message has been extracted. In this paper we propose a multilevel reversible data hiding scheme based on the difference image histogram modification that uses the peak point to hide messages. Through a joint imperceptibility and hiding capacity evaluation, we show that our proposed scheme uses a multilevel hiding strategy to achieve large hiding capacity and keep distortion low. Performance comparisons with other existing reversible hiding schemes are provided to demonstrate the validity of our proposed scheme.     

A reversible data hiding scheme using complementary embedding strategy

Obtaining good visual quality and high hiding capacity with reversible data hiding systems is a technically challenging problem. In this paper, we propose a simple reversible data hiding scheme that uses a complementary hiding strategy. The proposed method embeds one secret bit horizontally and vertically into one cover pixel of a grayscale cover image by decreasing odd-valued pixels and increasing even-valued pixels by one. Experimental results show that the hiding capacity measured by bit per pixel (bpp) of the proposed scheme is at least 1.21 bpp with a PSNR (peak signal-to-noise ratio) value greater than 52 dB for all standard test images. Especially in the case of four-layer embedding, the PSNR value of the proposed method is still greater than 51 dB at a hiding capacity of about 5 bpp for all standard test images. In addition, the proposed method is quite simple because it primarily uses additions and subtractions. These results indicate that the proposed scheme is superior to many existing reversible data hiding schemes introduced in the literature.     

Reversible data hiding for high quality images exploiting interpolation and direction order mechanism

Reversible data hiding can restore the original image from the stego image without any distortion after the embedded secret message is exactly extracted. In this paper, a novel, reversible, data hiding scheme for high quality images is proposed in spatial domain. To increase embedding capacity and enhance image quality, the proposed scheme classifies all pixels as wall pixels and non-wall pixels. For wall pixel, the interpolation error is used to embed secret data over the interpolation prediction method. In contrast, the difference value between the non-wall pixel and its parent pixel, which is defined by the direction order, is computed to hide secret data based on the histogram shifting. The experimental results demonstrate that our scheme provides a larger payload and a better image quality than some existing schemes. Moreover, the performance of the proposed scheme is more stable for different images.     

图像分区选择的像素值排序可逆数据隐藏

目的 基于像素值排序（PVO）的数据隐藏算法因其高保真的优越性受到广泛重视,并不断得到改进。本文提出一种图像分区选择思想,以进一步充分利用图像的嵌入空间,改善PVO算法的嵌入性能,提高载秘图像的信噪比。方法 原始PVO算法通常采用预测差值“1”进行数据隐藏,对平滑像素组有较好的利用率和隐蔽性,而对毛躁像素组隐秘性能明显下降,算法性能与图像像素分布情况密切相关。本文在PVO算法基础上提出图像分区选择的思想,首先,将原始图像分为若干区域,然后按移位率从小到大的顺序依次选择图像区域;其次,在每个区域中选择合适的嵌入预测误差;最后,按顺序在被选区域利用该区域的最优嵌入差值完成信息嵌入。结果 假设将图像划分为8×8个区域,对本文算法与原始PVO算法进行比较,当嵌入量为1×10⁴ bit时,Elaine图像的移位率由81.59%降为74.40%,载秘图像的峰值信噪比（PSNR）值由55.388 2提高为56.996 9,提高了1.608 7,采用其他图像并就不同嵌入量进行实验,各图像PSNR值均表现出不同程度的提高。其次,将图像分别划分为2×2、4×4、8×8、16×16个分区,当嵌入量为1×10⁴ bit时,Lena图像PSNR由原始PVO的59.204 6逐渐增加至60.846 9,其他图像在不同嵌入量时PSNR均随着分区数的增加而有不同程度的提高。结论 本文提出的基于图像分区选择的改进PVO算法,可根据像素分布情况增加对嵌入空间的利用,在相同嵌入量情况下,改进后的算法能够获得更高的PSNR值;在一定分区数量条件范围内,分区数量与图像PSNR值表现出正相关性,随着分区数量的增加,图像PSNR值随之增加;本文方法在一定程度上改善了嵌入容量,弥补了因分区数量增加带来的辅助信息增加的问题。     

基于高7位平面嵌入的灰度图像可逆数据隐藏算法

现有基于直方图平移的可逆数据隐藏算法都致力于提高嵌入率,而忽略了算法所产生边界图的大小;数量较大的边界图将不能够有效存储进而影响算法的实施。本文对现有典型算法存在的这一问题进行分析,并给出了解决方法。最后本文提出了基于高7位平面嵌入的灰度图像可逆数据隐藏算法,与传统可逆数据隐藏算法使用全部位平面进行数据嵌入不同,本文所提出的算法使用高7位平面当做数据载体。由高7位平面构成的载体图像具有像素值分布更加集中的特点,因而使用该载体图像进行可逆数据嵌入能够有效的控制边界图大小并且明显的提高嵌入率。实验结果表明,本文所提出的算法在提高嵌入率的同时,还能使嵌入附加数据的图像具有高的峰值信噪比值。