检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:韩栋 王春华 HAN Dong;WANG Chun-hua(School of Computer Science and Technology,Wuhan University of Technology,Wuhan 430063,china;School of Animation,Huanghuai University,Zhumadian 463000,China)
机构地区:[1]武汉理工大学计算机科学与技术学院,湖北武汉430063 [2]黄淮学院动画学院,河南驻马店463000
出 处:《微电子学与计算机》2018年第9期47-51,共5页Microelectronics & Computer
基 金:河南省科技计划项目(大数据时代隐私数据安全框架的设计与关键技术研究);河南省驻马店市科技计划项目(17135)
摘 要:原始位图图像经过8×8大小分块,DCT变换和系数量化后,取出其直流(DC)系数进行比特位分解,将分解后的每一个比特位隐藏到其所在系数块的不同交流(AC)系数的最低比特位上去.完成所有DC系数的隐藏后,将整个图像的所有DCT系数进行整体的置乱加密.最后,按照JPEG压缩编码的格式完成后续编码过程.仿真实验和分析结果表明,该算法加密效果良好,对图像压缩率影响较小,图像格式兼容性较好,具有较强的安全性.Segment the original bitmap into 8×8 blocks,make Discrete Cosine Transformation(DCT)in the 8×8 block and quantize the coefficients.Take the Direct Current(DC)coefficients out of the DCT coefficients of different blocks and decompose the DC coefficients bit by bit.Put the bits decomposed by the DC coefficient onto the least significant bits of the Alternating Current(AC)coefficients in the same 8×8 block and the DC coefficient is hidden.As all the DC coefficients being hidden,shuffle all the DCT coefficients of the original bitmap according to a shuffling matrix.And then,accomplish the lasting coding process of JPEG compression.Experimental results and analyses show that the algorithm produces good performance of high visual quality with strong sensitivity,and generate the cipher-image with almost the same size as that of the directly compressed JPEG image.Finally,the proposed algorithm is compatible with JPEG file format.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222