检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]河南理工大学电气工程与自动化学院,河南焦作454000 [2]中国矿业大学信息与电气工程学院,江苏徐州221116 [3]上海市信息安全综合管理技术研究重点实验室,上海200240
出 处:《计算机仿真》2014年第5期293-296,共4页Computer Simulation
摘 要:针对现有图像哈希算法普遍存在抗几何攻击能力不强的缺点,提出了一种基于极谐变换(Polar Harmonic Transform,PHT)的鲁棒图像哈希算法。极谐变换是新近发展的一种正交矩变换方法,图像的变换幅值对旋转缩放具有不变性,利用这一特点用图像的极谐变换幅值生成图像摘要。首先对图像进行极谐变换,然后将得到的幅值系数进行筛选量化得到二值序列,最后根据预先设计的密钥对二值序列进行置乱生成图像摘要。仿真结果表明,上述算法对几何攻击和常规信号处理攻击均具有很强的鲁棒性,优于对比算法性能,能够用于图像识别、搜索、认证等方面的应用。Most existing image hashing algorithms are not robust enough to geometric attacks. To solve this problem, a robust image hashing algorithm based on Polar Harmonic Transform (PHT) was proposed in this paper. The PHT is a recently developed orthogonal moment method, and the magnitudes of PHTs are invariant to image rotation and scaling. According to the feature, the magnitudes of PHTs were quantized into image digest. The images were transformed with Polar Harmonic firstly, then the derived magnitudes were selected and quantized into binary sequence. At last, according to the previous key, the sequence was disturbed to receive the image digest. Simulation results show that the proposed hashing is robust to geometric attacks and conventional signal processing attacks, which outperforms the typical comparative algorithms and can be used in image identification, search and authentication, etc.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.116.237.222