Robust Image Hashing for Detecting Small Tampering Using a Hyperrectangular Region

Toshiki Itagaki, Yuki Funabiki, T. Akishita
{"title":"Robust Image Hashing for Detecting Small Tampering Using a Hyperrectangular Region","authors":"Toshiki Itagaki, Yuki Funabiki, T. Akishita","doi":"10.1109/WIFS53200.2021.9648383","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a robust image hashing method that enables detecting small tampering. Existing hashing methods are too robust, and the trade-off relation between the robustness and the sensitivity to visual content changes needs to be improved to detect small tampering. Though the adaptive thresholding method can improve the trade-off, there's more room to improve and it requires tampered image derived from the original, which limits its applications. To overcome these two drawbacks, we introduce a new concept of a hyperrectangular region in multi-dimensional hash space, which is determined at the timing of hash generation as the region that covers a hash cluster by using the maximum and the minimum of the cluster per each hash axis. We evaluate our method and the existing methods. Our method improves the trade-off, which achieves 0.9428 as AUC (Area Under the Curve) for detecting tampering that occupies about 0.1% area of the image in the presence of JPEG compression and reducing the size as content-preserving operations. Furthermore, our method does not require tampered image derived from the original, which differs from the existing method.","PeriodicalId":196985,"journal":{"name":"2021 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Workshop on Information Forensics and Security (WIFS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIFS53200.2021.9648383","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we propose a robust image hashing method that enables detecting small tampering. Existing hashing methods are too robust, and the trade-off relation between the robustness and the sensitivity to visual content changes needs to be improved to detect small tampering. Though the adaptive thresholding method can improve the trade-off, there's more room to improve and it requires tampered image derived from the original, which limits its applications. To overcome these two drawbacks, we introduce a new concept of a hyperrectangular region in multi-dimensional hash space, which is determined at the timing of hash generation as the region that covers a hash cluster by using the maximum and the minimum of the cluster per each hash axis. We evaluate our method and the existing methods. Our method improves the trade-off, which achieves 0.9428 as AUC (Area Under the Curve) for detecting tampering that occupies about 0.1% area of the image in the presence of JPEG compression and reducing the size as content-preserving operations. Furthermore, our method does not require tampered image derived from the original, which differs from the existing method.
利用超矩形区域检测小篡改的鲁棒图像哈希
在本文中,我们提出了一种鲁棒图像哈希方法,可以检测到小篡改。现有的哈希方法鲁棒性太强,需要改进鲁棒性与视觉内容变化敏感性之间的权衡关系,以检测微小的篡改。自适应阈值法虽然可以改善这种权衡,但有较大的改进空间,并且需要从原始图像中提取篡改图像,这限制了其应用。为了克服这两个缺点,我们在多维哈希空间中引入了超矩形区域的新概念,该区域在哈希生成时通过使用每个哈希轴的簇的最大值和最小值来确定作为覆盖哈希簇的区域。我们评估了我们的方法和现有的方法。我们的方法改进了权衡,在存在JPEG压缩的情况下,检测占用图像约0.1%面积的篡改,并减少作为内容保留操作的大小,AUC(曲线下面积)达到0.9428。此外,我们的方法不需要从原始图像中提取篡改图像,这与现有方法不同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信