共查询到18条相似文献,搜索用时 187 毫秒
1.
2.
基于数位信息的信息隐藏方法 总被引:9,自引:0,他引:9
描述了一种基于数字位置信息的信息隐藏方法,给出了一个单位增广矩阵,并在此基础上给出了具体算法。该方法若用单个数位信息,在n=2^m-1时,嵌入效率可达到m,有较高的数据嵌入效率:若用多个数位组合信息,可在保持嵌入效率不变的条件下,数据嵌入率近似等于1(n较大时),在相同比特数的宿主信息中,可嵌入较多的隐藏信息,可用于流媒体等信息量较大信息的隐藏。文中所述的方法,计算复杂度不高,易于硬件实现,已用微型计算机在局域网上进行了模拟实验,获得了较好的实验结果。 相似文献
3.
为使用于无损信息隐藏的广义整数变换更具普遍意义并提高数据嵌入容量,该文在对广义整数变换进行拓展的基础上提出一种图像无损信息隐藏新方法。该方法通过对广义整数变换引入可变参数m进行拓展,可在n个像素点组成的图像块中嵌入m(n-1) bit数据,m>1时提高了数据嵌入容量,方法还采用一种新的数据嵌入策略提高了隐藏图像质量。与现有整数变换算法相比,该文算法在数据嵌入容量和隐藏图像质量上有一定的提升。该方法可用于对图像质量要求较高的军事通信、医学保健和法律论证等领域,在提取嵌入的机密信息后,原宿主图像可无失真恢复。 相似文献
4.
5.
6.
7.
三元组抽取的目的是从非结构化的文本中获取实体与实体间的关系,并应用于下游任务。嵌入机制对三元组抽取模型的性能有很大影响,嵌入向量应包含与关系抽取任务密切相关的丰富语义信息。在中文数据集中,字词之间包含的信息有很大区别,为了改进由分词错误产生的语义信息丢失问题,设计了融合混合嵌入与关系标签嵌入的三元组联合抽取方法(HEPA),提出了采用字嵌入与词嵌入结合的混合嵌入方法,降低由分词错误产生的误差;在实体抽取层中添加关系标签嵌入机制,融合文本与关系标签,利用注意力机制来区分句子中实体与不同关系标签的相关性,由此提高匹配精度;采用指针标注的方法匹配实体,提高了对关系重叠三元组的抽取效果。在公开的Du IE数据集上进行了对比实验,相较于表现最好的基线模型(Cas Rel),HEPA的F1值提升了2.8%。 相似文献
8.
9.
10.
保持近邻嵌入(NPE)算法对局部线性嵌入(LLE)算法进行了改进,克服了新来样本问题,但在处理分类问题上表现不足。本文提出了一种半监督稀疏保持近邻判别嵌入算法,该方法首先采用小波变换对数据进行预处理,然后执行等距离映射(Isomap)算法选择合适的低维嵌入维数,最后结合稀疏表示理论、NPE和线性判别分析(LDA)的思想,重构邻域图,并在建立目标函数时使得已标签信息中同类样本点之间相互靠近,异类样本点之间相互远离,未标签信息邻域信息得以保持,这样,既得到了高维映射函数,又提高了分类正确率。通过在人脸数据库上实验,并和其他半监督算法作比较,本文提出的算法在识别率上表现较好。 相似文献
11.
In this paper, we present a new reversible data hiding algorithm based on integer transform and adaptive embedding. According to the image block type determined by the pre-estimated distortion, the parameter in integer transform is adaptively selected in different blocks. This allows embedding more data bits into smooth blocks while avoiding large distortion generated by noisy ones, and thus enables very high capacity with good image quality. For instance, by the proposed method, we can embed as high as 2.17 bits per pixel into Lena image with a reasonable PSNR of 20.71 dB. Experimental results demonstrate that the proposed method outperforms some state-of-the-art algorithms, especially for high capacity case. 相似文献
12.
13.
Reducing location map in prediction-based difference expansion for reversible image data embedding 总被引:1,自引:0,他引:1
In this paper, we present a reversible data embedding scheme based on an adaptive edge-directed prediction for images. It is known that the difference expansion is an efficient data embedding method. Since the expansion on a large difference will cause a significant embedding distortion, a location map is usually employed to select small differences for expansion and to avoid overflow/underflow problems caused by expansion. However, location map bits lower payload capacity for data embedding. To reduce the location map, our proposed scheme aims to predict small prediction errors for expansion by using an edge detector. Moreover, to generate a small prediction error for each pixel, an adaptive edge-directed prediction is employed which adapts reasonably well between smooth regions and edge areas. Experimental results show that our proposed data embedding scheme for natural images can achieve a high embedding capacity while keeping the embedding distortion low. 相似文献
14.
Nandhini Sivasubramanian Gunaseelan Konganathan Yeragudipati Venkata Ramana Rao 《ETRI Journal》2018,40(5):677-686
A novel data hiding technique based on modified histogram shifting that incorporates multi-bit secret data hiding is proposed. The proposed technique divides the image pixel values into embeddable and nonembeddable pixel values. Embeddable pixel values are those that are within a specified limit interval surrounding the peak value of an image. The limit interval is calculated from the number of secret bits to be embedded into each embeddable pixel value. The embedded secret bits can be perfectly extracted from the stego image at the receiver side without any overhead bits. From the simulation, it is found that the proposed technique produces a better quality stego image compared to other data hiding techniques, for the same embedding rate. Since the proposed technique only embeds the secret bits in a limited number of pixel values, the change in the visual quality of the stego image is negligible when compared to other data hiding techniques. 相似文献
15.
Image data hiding technology is secret communications that carry hidden data in such a way that no one except the sender and intended recipients can even realize there is a hidden message. High embedding capacity, good images quality, and security are three important essentials. In this paper, each confidential hexadecimal will be carried by two cover pixels based on a magic matrix generated from a square template to reach the goal of higher embedding capacity while keeping good image visualization. Experimental results reveal that the proposed scheme guarantees higher embedding capacity of 2 bits per pixel and has the peak signal-to-noise ratio (PSNR) of 44.7 dB on average. Moreover, secret keys are used to ensure security consideration. 相似文献
16.
几种图像数据隐藏方法的比较研究 总被引:4,自引:0,他引:4
近年来,图像数据隐藏技术得到了突飞猛进的发展,得到了很多鼓舞人心的成果。在图像隐藏技术中,使用最多的图像嵌入规则有三种:加法嵌入规则、乘法嵌入规则以及基于融合技术的图像嵌入规则。本文对这三种图像嵌入规则的性能进行了分析和研究,通过比较我们发现,如果将图像隐藏过程看作是一个水印信道模型,则基于融合技术的图像嵌入规则所能隐藏的信息量远远高于另两种嵌入规则,而乘法嵌入规则其水印信道容量不受原始图像DCT系数标准差变化的影响,因此,在原始图像DCT系数标准差不稳定的情况下,采用乘法嵌入规则是一个好的选择。 相似文献
17.
与平坦区域相比,图像纹理区域在结构上表现出更多的随机性,因此将密信嵌入到纹理丰富的区域可获得更好的安全性.本文利用相邻像素的LSB与次低LSB位之间的关系,提出一种基于像素块的纹理优先自适应隐写算法,将密信优先嵌入到复杂纹理区域.所设计的纹理判别准则能结合待嵌入密信长度,自适应选择嵌入区域.针对在嵌密过程中嵌密块可能出现的异常情况,提出一种像素值调整方案,并从理论上证明了其可行性.实验结果表明本文算法比两种经典的LSB算法和一种现有的基于边缘优先的自适应算法具有更高的嵌入效率,且对四种有代表性的隐写分析算法通常具有更强的抵御能力. 相似文献
18.
《Journal of Visual Communication and Image Representation》2014,25(6):1378-1386
Achieving a high embedding capacity and low compression rate with a reversible data hiding method in the vector quantization (VQ) compressed domain is a technically challenging problem. This paper proposes a novel reversible steganographic scheme for VQ compressed images based on a locally adaptive data compression method. The proposed method embeds n secret bits into one VQ index of an index table in Hilbert-curve scan order. The experimental results show that the proposed method can achieve the different average embedding rates of 0.99, 1.68, 2.28, and 3.04 bit per index (bpi) and average compression rates of 0.45, 0.46, 0.5, and 0.56 bit per pixel (bpp) for n = 1, 2, 3, and 4, respectively. These results indicate that the proposed scheme is superior to Chang et al.’s scheme 1 [19], Yang and Lin’s scheme [21], and Chang et al.’s scheme 2 [24]. 相似文献