首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于二叉树遍历的数字图像置乱方法
引用本文:林雪辉.一种基于二叉树遍历的数字图像置乱方法[J].计算机工程,2006,32(16):139-140,147.
作者姓名:林雪辉
作者单位:暨南大学计算机科学系,广州510632
摘    要:针对近年来兴起的数字图像信息安全问题,从二叉树的性质出发,提出了一种基于二叉树遍历的数字图像置乱方法,并讨论了该置乱方法的周期性及其逆变换。该方法简便易行,适用于任意大小的图像,且具有很好的置乱效果和极大的置乱周期。在一定的攻击下,置乱后的图像可以恢复原始图像,在一定程度上可以满足数字图像加密和隐藏的鲁棒性要求。

关 键 词:二叉树遍历  数字图象置乱  信息隐藏
文章编号:1000-3428(2006)16-0139-02
收稿时间:2006-01-12
修稿时间:2006-01-12

A Method of Digital Image Scrambling Based on Binary Tree Traversal
LIN Xuehui.A Method of Digital Image Scrambling Based on Binary Tree Traversal[J].Computer Engineering,2006,32(16):139-140,147.
Authors:LIN Xuehui
Affiliation:Department of Computer Science, Jinan University, Guangzhou 510632
Abstract:Aiming at ensuring digital image information security, and starting from characters of binary tree, this paper proposes a novel method of digital image scrambling based on binary tree traversal, and its periodicity and inverse transformation are discussed. The approach is easy to realize for digital images of arbitrary size, and has a good result and a large periodicity of scrambling. Under some attacks, the original image can be reconstructed from scrambled image, so the algorithm satisfies the robustness requirement of image encrypdon and hiding to a certain extent.
Keywords:Binary tree traversal  Digital image scrambling  Information hiding
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号