自适应的密文彩色图像可逆数据隐藏算法

为了提高直方图平移算法嵌入率和图像感知质量,提出一种自适应的密文彩色图像可逆数据隐藏算法。利用Logistics混沌置乱加密算法对彩色图像进行加密;对加密后的图像块根据设定的波动阈值自适应地分成平滑块和陡峭块;对平滑块进行高平面位比特替换,对陡峭块进行直方图平移和多比特位嵌入来提升嵌入率和图像质量。实验结果表明,该算法具有较高嵌入容量且感知质量较好,当嵌入率为1.142bpp时,峰值信噪比可达35dB以上,并且抵抗噪声、剪切攻击时鲁棒性较好。     

使用四叉树分割进行自适应空域隐写

目的 针对自适应隐写术可有效避免对载体敏感区大量修改的关键问题,为间接提高安全性和增大隐写容量,在四叉树分割和自适应像素对匹配（APPM）的基础上提出一种自适应空域隐写术。方法 首先该方法以图像块的纹理复杂度作为一致性测度并且设置图像块大小为判别准则进行图像分割,根据四叉树分割结果中面积较小的图像块属于复杂区域,较大的属于平滑区域,按照图像块面积大小将图像分成由高复杂、中复杂、低复杂三大区域构成。其次嵌密方式采用APPM,根据密信容量和载体图像选择进制数B。最后,为了保证安全性和提高容量,优先选择高复杂区嵌入不低于B进制的密信,在中复杂区进行B进制的密信嵌入,在低复杂区选择不高于B进制的密信嵌入。结果 为了验证提出的方法,选8幅经典图作为实验,在嵌入率1.92 bit/pixel的情况下,与已有PVD系列算法和DE算法相比具有更高的PSNR值,PSNR值高达48 dB。此外与APPM算法比较,在嵌入率2.5 bit/pixel情况下,该算法的平均KL距离相比传统APPM算法减小了25.37%,平均一阶Markov安全指标值相比传统APPM算法减小了12.11%,对应的平均PSNR值相比传统APPM算法提高0.43%,在嵌入率1.5 bit/pixel情况下,该算法的平均KL距离相比传统APPM算法减小了37.84%,平均一阶Markov安全指标值相比传统APPM算法减小了26.61%,对应的平均PSNR值相比传统APPM算法提高1.56%。此外,从RSP图库中随机选1 000幅图作为数据集,在嵌入率0.5,0.6,0.7,0.8,0.9和1.0 bit/pixel条件下,结合SPAM特征和SVM分类器的最小平均错误率均高于LSB系列经典算法和APPM算法。结论 1）考虑了人类视觉系统对图像不同区域的敏感性不同,通过对图像进行四叉树分割预处理,优先选择非敏感区进行隐写,保证了一定的安全性要求,低嵌入率下抗SPAM检测和统计不可见性方面比较有优势。2）在四叉树分割中,对于隐写前后图像的四叉树分割结果不同的异常情况,采用一种图像块纹理复杂度调整方案,保证了密信正确完整提取。3）利用了APPM算法的大容量特性,可以隐写嵌入率大于1 bit/pixel的密信,比较适用于大容量的密信隐写,而且可以嵌入任意进制的密信,最大程度地减少嵌入失真,此外,进行了四叉树分割预处理,在安全性方面优于传统APPM算法。     

An adaptive data hiding scheme with high embedding capacity and visual image quality based on SMVQ prediction through classification codebooks

This study exploits the characteristics of image blocks to develop an adaptive data hiding scheme that is based on SMVQ prediction. Since human beings’ eyes are highly sensitive to smooth images, changes in smooth cause great distortion and attract the attention of interceptors. Hence, this study proposes a data embedding scheme for embedding secret data into edge blocks and non-sufficiently smooth blocks. The experimental results show that the proposed scheme improves the quality of the stego-image and the embedding capacity.     

Pattern-Based Data Hiding for Binary Image Authentication by Connectivity-Preserving

In this paper, a novel blind data hiding method for binary images authentication aims at preserving the connectivity of pixels in a local neighborhood is proposed. The "flippability" of a pixel is determined by imposing three transition criteria in a 3 times 3 moving window centered at the pixel. The "embeddability" of a block is invariant in the watermark embedding process, hence the watermark can be extracted without referring to the original image. The "uneven embeddability" of the host image is handled by embedding the watermark only in those "embeddable" blocks. The locations are chosen in such a way that the visual quality of the watermarked image is guaranteed. Different types of blocks are studied and their abilities to increase the capacity are compared. The problem of how to locate the "embeddable" pixels in a block for different block schemes is addressed which facilitates the incorporation of the cryptographic signature as the hard authenticator watermark to ensure integrity and authenticity of the image. Discussions on the security considerations, visual quality against capacity, counter measures against steganalysis and analysis of the computational load are provided. Comparisons with prior methods show superiority of the proposed scheme     

基于小波对比度和模函数的安全密写算法

针对图像隐写中大容量、高保真度和安全性问题,依据人眼对变换剧烈及较暗区域均不敏感的视觉特点,结合模函数周期性运算,提出一种基于小波对比度和模函数运算的高保真图像隐写算法。该方法首先将载体图像按固定大小分块并计算其小波对比度,然后依据小波对比度确定各块嵌入深度,最后采用模函数运算嵌入秘密信息。实验结果表明,该方法能嵌入较多信息和保持良好的载密图像质量。     

An efficient fragile watermarking scheme with multilevel tamper detection and recovery based on dynamic domain selection

Self-recoverable fragile watermarking is meant for accurate tamper localization as well as image recovery with superior visual quality. However, most of the existing state of art approaches perform authentication and recovery on block basis owing to which the entire block is categorized as tampered in case of alteration of one or more pixels of it. This, results in staircase formation of tamper detected regions, hence lacking in accuracy. Furthermore, the visual quality of the recovered image also deteriorates as an approximate value is assigned to all the block pixels corresponding to the altered region. The proposed watermarking scheme performs both authentication and recovery pixelwise. The authentication of each pixel is done via multi level tamper detection(MLTD) through three authentication bits based on value, location and neighbourhood information. The domain for image recovery is chosen dynamically based on the content of the block, may it be in spatial domain for smooth blocks or frequency domain for the rough ones. This provides high accuracy in recovery. As the embedding of recovery information is done in the frequency domain, the imperceptibility of the watermarked image scheme remains high. Also, embedding of authentication information in the spatial domain maintains its fragile nature. Even for higher tampering ratios, the lost content is rebuilt with high peak signal to noise ratio(PSNR) of the recovered image. The probabilities of false rejection and false acceptance head towards the ideal value for most of the empirical analysis. Comparative study via metric evaluation of probability of false rejection (PFR), probability of false acceptance (PFA) and PSNR of recovered image for different standard test cover images demonstrate the efficacy of the proposed scheme over other existing state of art approaches. Further, the security of the proposed scheme remains high due to usage of multi-layered secret keys and chaos based random mapping handling worst tamper scenarios.     

一种基于补丁算法改进的图像隐写方法简

针对经典补丁算法进行信息隐藏时嵌入容量极低的缺陷,基于图像置乱和分块的方法,提出一种改进的图像隐写算法。首先将载体图像进行恰当分块并进行充分置乱,置乱程度以分块的均方差来衡量,然后在置乱图中选择分块对进行信息嵌入。实验结果表明,该方法可将载体图像的嵌入容量由1比特扩展到数百比特,同时具有视觉不可觉察性,对JPEG压缩和噪声攻击有较好的鲁棒性,可抵御卡方、RS和SPA分析等平面域的经典隐写分析算法。     

基于分块的高效图像可逆认证方法

图像可逆认证是一项将可逆信息隐藏和脆弱水印相结合的新技术,其既能实现对图像的脆弱认证,还能在提取认证信息的同时无失真地恢复出原始载体,对图像的原始性和完整性认证具有非常重要的意义.针对现有可逆认证方法认证精度低、对具有复杂纹理的图像或图像中部分纹理复杂区域无法实现有效保护的问题,提出一种新的图像可逆认证方法.首先对待认证图像进行分块,根据每个子块可嵌入容量将其分为差分块和平移块,并采用不同的可逆嵌入方法对不同类型的块进行认证码嵌入操作.为了增大嵌入容量以提高对每个子块的认证效果,还采取了分层嵌入的方式.在认证方,可以通过从每个子块中提取认证码实现子块的篡改检测和定位.此外,所提方法还可与形态学中的膨胀和腐蚀操作结合以细化篡改检测标记,进一步提高检测效果.实验结果表明,所提方法能够在同样的认证精度下对纹理平滑和纹理复杂的图像进行保护,同时还能够实现对几乎所有子块的独立认证和恢复,具有广泛的适用性.     

基于多尺度分解与预测误差扩展的可逆图像水印算法

针对现有可逆图像水印算法中嵌入量与图像视觉质量之间的矛盾,提出了一种基于多尺度分解与预测误差扩展的可逆图像水印算法。首先,对原始图像进行多尺度分解,将其分解为同质块和非同质块;其次,通过对同质块进行预测误差扩展来嵌入水印信息;最后,通过计算非同质块信息熵,根据嵌入水印信息量选择合适的非同质块,通过对选取的非同质块进行整数小波变换,在中高频中嵌入剩余水印信息。实验结果表明,该算法易于实现且完全可逆,能有效提高水印嵌入量,具有较高的视觉质量。     

An oblivious fragile watermarking scheme for images utilizing edge transitions in BTC bitmaps

As one of the famous block-based image coding schemes,block truncation coding(BTC) has been also applied in digital watermarking.Previous BTC-based watermarking or hiding schemes usually embed secret data by modifying the BTC encoding stage or BTC-compressed data,obtaining the watermarked image with poorer quality than the BTC-compressed version.This paper presents a new oblivious image watermarking scheme by exploiting BTC bitmaps.Unlike the traditional schemes,our approach does not really perform the BTC compression on images during the embedding process but utilizes the parity of the number of horizontal edge transitions in each BTC bitmap to guide the watermark embedding and extraction processes.The embedding process starts by partitioning the original cover image into non-overlapping 4×4 blocks and performing BTC on each block to obtain its BTC bitmap.One watermark bit is embedded in each block by modifying at most three pixel values in the block to make sure that the parity of the number of horizontal edge transitions in the bitmap of the modified block is equal to the embedded watermark bit.In the extraction stage,the suspicious image is first partitioned into non-overlapping 4×4 blocks and BTC is performed on each block to obtain its bitmap.Then,by checking the parity of the number of horizontal edge transitions in the bitmap,we can extract one watermark bit in each block.Experimental results demonstrate that the proposed watermarking scheme is fragile to various image processing operations while keeping the transparency very well.     

统计量移位的鲁棒无损图像信息隐藏

鲁棒无损信息隐藏在医学成像、法律取证、遥感等领域有广泛的应用。提出了一种鲁棒无损图像信息隐藏算法。在含密载体图像未受损情况下,正确提取秘密信息后可无损恢复原始载体图像;在含密载体图像受到一定程度JPEG2000压缩攻击后,秘密信息仍然可以被正确提取。首先将原始载体图像分块并计算每个图像块的统计量,再根据统计量绝对值的最大值选择合适的阈值对统计量进行移位,最后利用移位后的统计量来嵌入秘密信息。实验结果表明,该算法在图像视觉质量、嵌入容量和鲁棒性3个方面都具有很好的性能。与其他鲁棒无损嵌入方法相比,在图像视觉质量和鲁棒性大致相当的情况下,该算法的嵌入容量有了很大提高,表明该算法较其他算法具有明显的优势。     

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

目的 基于像素值排序（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值随之增加;本文方法在一定程度上改善了嵌入容量,弥补了因分区数量增加带来的辅助信息增加的问题。     

基于细粒度嵌入空间预留的密文域图像可逆信息隐藏方法

针对云数据管理中的用户隐私保护需求,密文域图像可逆信息隐藏受到了学术界的广泛关注.基于加密前预留空间的数据嵌入框架将载体图像分割成由图像块组成的两个独立区域,使用传统的可逆信息隐藏技术腾出数据嵌入空间,可以取得较好的性能.为了更好地利用图像的空间相关性,提出了一种细粒度的可伸缩嵌入空间预留策略.该策略将图像块重新排列,...     

一种基于模糊分类的信息隐藏方法

提出了一种在图像DCT域内的信息隐藏方法。为了在保证隐秘图像视觉质量可以接受的前提下,有效提高载体图像的信息隐藏量,首先根据HVS特征和模糊理论将载体图像的各个DCT子块分为三类,然后根据DCT子块的类型不同,自适应变化嵌入每个DCT系数的秘密信息的位数。实验结果表明：该文方法在图像质量和信息嵌入量方面,都优于DCT域内固定嵌入位数的信息隐藏方法。此外,在秘密信息提取时,该文算法不需要参考原始载体图像,实现了提取信息的盲检测。     

基于分块DCT的自适应视频水印算法

在以往的离散余弦变换(DCT)水印嵌入算法中,选择直流系数嵌入能增加稳定性,但也会导致水印的不可见性较差。本文在DCT直流系数嵌入法的基础上进行改进,结合人类视觉系统模型(HVS),优先选择纹理强度大的DCT分块并自适应控制嵌入强度,能较好兼顾稳定性和不可见性。改进后的算法与改进前算法相比,数字水印的安全性、鲁棒性、嵌入量、不可见性、稳定性等各方面都有较大提高。     

基于四元数矩阵与遗传优化逻辑曲线的鲁棒图像水印算法研究

传统彩色图像水印算法鲁棒性与视觉效果难以达到同步最优,对此,提出了一种基于四元径向矩并利用遗传算法优化逻辑曲线的彩色图像水印算法。将目标图像分为若干块,对所有块进行复杂度分析;然后,通过遗传算法对逻辑曲线的优化实现水印性能参数的优化,并根据目标图像的复杂度自适应地调节水印嵌入的强度。对比试验结果表明本算法所获得的水印图像具有良好的视觉效果,同时对信号处理攻击与几何攻击均具有较好的鲁棒性。     

密文域高嵌入率图像全位面可逆数据隐藏

目的 针对现有的加密域可逆信息隐藏算法未能充分利用图像的全部位平面的问题,提出了一种密文域高嵌入率图像全位面可逆数据隐藏。方法 对载体图像进行加密,然后将隐蔽信息嵌入到加密图像中,进行隐蔽传输,发送给接收者。本文将灰度图像的8个位平面都用来进行数据嵌入,并把每个位平面划分成不重叠的块,分为非连续块（块内像素值0,1都存在）和连续块（块内为全0或全1像素值）,按块进行重排列且将排列前的块标签嵌入到重排列图像中,使用流密码对图像进行加密。在数据嵌入阶段,提出了带修正信息的像素预测方法用于非连续块的嵌入。连续块中,保持块内右下角像素值不变,用于连续块的恢复,其他位置嵌入数据;非连续块中,对预测正确的像素嵌入数据,预测错误的像素保持不变。结果 实验过程实现了多种密文域可逆数据隐藏算法,本文进行大量对比实验,并在BOSSbase和BOWS-2数据集上进行验证,与其他方法比较,本文方法在BOSSbase和BOWS-2数据集上的嵌入率分别提升了42.1%和43.3%。结论 提出的加密图像可逆数据隐藏方案,通过对不同性质的块采用不同方法进行数据嵌入,利用图像全位面信息,使得方案能够获得更高的嵌入率,表明了本文方法的有效性。     

一种保护图象轮廓细节的自适应亚抽样和插值方法

为在图象编码时减少原始图象数据,以提高压缩比和编码速度,提出了一种新的自适应亚抽样与插值的方法及可应用于多类分块图象编码的算法,该方法首先将图象划分成互不重叠的块,然后计算每个块的水平梯度与坚直梯度,再根据图象块的两个方向梯度值,将图象块分为平块、水平轮廊块、竖直轮廊块和高细节块等４类,同时对每类图象块采用不同的亚抽样与插值方法以减少原始图象数据。模拟结果表明：相对于其它的亚抽样与插值方法,该算法能够很好地保护图象中的轮廊及细节信息,从而极大地提高了重建图象的质量,尤其是图象的主观质量。另外,对于细节较多的图象,该算法在保持相当压缩比的同时,ＰＳＮＲ也提高了３．９ｄＢ;而对于细节较少的图象,压缩比与ＰＳＮＲ都略有提高。     

An adaptive color image steganography method using adjacent pixel value differencing and LSB substitution technique

Abstract

Steganography is a data-concealing technique that provides a covert communication. This paper proposes a spatial domain color steganography method that uses a neighboring pixel-pair differencing concept to enhance the embedding capacity. The proposed method considers the distortion tolerance capacity of each color plane and the difference value between two neighboring pixels while deciding the number of bits that can be concealed in that pixel-pair. Each plane is divided into some disjoint blocks of size 3?×?3 pixels. The method forms eight pairs of pixels in one block using the eight-neighboring pixel concept, which enables the method to utilize all the edge pixels in all probable directions. It also uses the XOR encoding technique before the embedding process. This step provides an additional layer of security to the secret information. The simulation results show that the proposed method is able to achieve a high embedding capacity with good visual quality as per the calculation of imperceptibility metrics. The robustness of the method is tested by RS steganalysis and pixel difference histogram analysis. Further, a comparison between the proposed method and the existing methods on the basis of embedding capacity and stego image quality is shown.     

Distortion function based on residual blocks for JPEG steganography

Steganography aims to embed additional data into digital media secretly and minimize the distortion caused by data embedding. Up to now, the key point of minimal distortion embedding framework is to design proper distortion function. In this paper, a distortion function for JPEG steganography based on residual blocks is proposed. To obtain less statistical detectability, Residual Block Values (termed as RBVs for short) and quantization steps are both involved in the proposed distortion function. RBVs are exploited to determine the embedding risk caused by modifications in corresponding DCT block while quantization steps are exploited to determine the embedding risk of the selection channel in a block. By implementing the syndrome trellis coding (STC) to embed secret data, the modifications are constrained in hard-to-detect religions. Experiments show that the proposed method performs better than current state-of-the-art methods of JPEG steganography.