###
DOI:
工程科学与技术:2015,47(6):139-143
←前一篇   |   后一篇→
本文二维码信息
码上扫一扫!
一种基于次优加权矩阵的灰度图像信息隐藏算法
(1.西安交通大学;2.泉州师范学院)
An Information Hiding Algorithm Of Gray Images Based On Suboptimum Weighted Matrix
(1.Xian Jiaotong University;2.Xi'an Jiaotong University;3.Xi'anJiaotong University;4.Quanzhou Normal University)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1210次   下载 1
投稿时间:2015-09-25    修订日期:2016-01-22
中文摘要: 理论上分析了在一个包含 n 个像素的图像块内,最多改变 2 个像素,每个像素最多改变 1 的情况下,信息隐藏的容量上界为⌊log2 n2+ 2 n+2⌋个二进制位,证明了不可能构建完全满足该条件的加权矩阵, 进而提出一种构建次优加权矩阵的算法, 能较好地平衡信息隐藏的容量和不可感知性, 更好的实现信息隐藏。通过大量实验证明了当分块不大于 2500 万像素时, 采用该算法构造的次优加权矩阵与最优矩阵进行信息隐藏的容量的差距最多为 1 个二进制位。
中文关键词: 加权矩阵  信息隐藏  灰度图像  次优矩阵  
Abstract:It is theoretically analyzed that the upper bound capacity of a gray image block with n pixels is not more than ⌊log2 n2+ 2 n+2⌋ binary bits, when not more than 2 pixels are modified and every pixel is modified not more than 1. It is proved that such a weighted matrix can’t be constructed, but a way to construct a suboptimum weighted matrix is proposed in this paper , the matrix can get better balance between the hiding capacity and the imperceptibility compared with the optimum maxtrix, the suboptimum can hide one bit less than the optimum matrix at the worst condition when n is not more than 25 million pixels.
文章编号:201501023     中图分类号:    文献标志码:
基金项目:国家自然科学基金“云计算环境下侧通道攻击的检测与防御技术研究”
作者简介:
引用文本:
彭振龙,桂小林,安健,冀亚丽,郭建宏.一种基于次优加权矩阵的灰度图像信息隐藏算法[J].工程科学与技术,2015,47(6):139-143.
Peng Zhenlong,Gui Xiaolin,AnJian,Ji Yali,Guo Jianhong.An Information Hiding Algorithm Of Gray Images Based On Suboptimum Weighted Matrix[J].Advanced Engineering Sciences,2015,47(6):139-143.