基于表面的感知图像哈希特征提取与集成分类器

Padmashri. R, S. Srinivasulu, J. R. Raj, J. J, S. Gowri
{"title":"基于表面的感知图像哈希特征提取与集成分类器","authors":"Padmashri. R, S. Srinivasulu, J. R. Raj, J. J, S. Gowri","doi":"10.1109/ICSPC51351.2021.9451816","DOIUrl":null,"url":null,"abstract":"Image hash regimes have been widely used for authenticating content, recovery of images and digital forensics. In this article we propose a new algorithm for image haunting (SSL) with the most stable key points and regional features, strong against various manipulation of content conservation, including multiple combinatorial manipulations. In order to extract most stable keypoint, the proposed algorithm combines the Speed Up Robust Features (SURF) with Saliency detection. The keyboards and characteristics of the local area are then combined in a hash vector. There is also a sperate secret key that is randomly given for the hash vector to prevent an attacker from shaping the image and the new hash value. The proposed hacking algorithm shows that similar or initial images, which have been individually manipulated, combined and even multiple manipulated contents, can be visently identified by experimental result. The probability of collision between hacks of various images is almost nil. Furthermore, the key-dependent security assessment shows the proposed regime safe to allow an attacker without knowing the secret key not to forge or estimate the right havoc value.","PeriodicalId":182885,"journal":{"name":"2021 3rd International Conference on Signal Processing and Communication (ICPSC)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Perceptual Image Hashing Using Surffor Feature Extraction and Ensemble Classifier\",\"authors\":\"Padmashri. R, S. Srinivasulu, J. R. Raj, J. J, S. Gowri\",\"doi\":\"10.1109/ICSPC51351.2021.9451816\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Image hash regimes have been widely used for authenticating content, recovery of images and digital forensics. In this article we propose a new algorithm for image haunting (SSL) with the most stable key points and regional features, strong against various manipulation of content conservation, including multiple combinatorial manipulations. In order to extract most stable keypoint, the proposed algorithm combines the Speed Up Robust Features (SURF) with Saliency detection. The keyboards and characteristics of the local area are then combined in a hash vector. There is also a sperate secret key that is randomly given for the hash vector to prevent an attacker from shaping the image and the new hash value. The proposed hacking algorithm shows that similar or initial images, which have been individually manipulated, combined and even multiple manipulated contents, can be visently identified by experimental result. The probability of collision between hacks of various images is almost nil. Furthermore, the key-dependent security assessment shows the proposed regime safe to allow an attacker without knowing the secret key not to forge or estimate the right havoc value.\",\"PeriodicalId\":182885,\"journal\":{\"name\":\"2021 3rd International Conference on Signal Processing and Communication (ICPSC)\",\"volume\":\"103 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 3rd International Conference on Signal Processing and Communication (ICPSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSPC51351.2021.9451816\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 3rd International Conference on Signal Processing and Communication (ICPSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSPC51351.2021.9451816","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

图像哈希机制已广泛用于内容认证、图像恢复和数字取证。本文提出了一种新的图像困扰算法,该算法具有最稳定的关键点和区域特征,对各种内容保护操作(包括多种组合操作)具有较强的抵抗能力。为了提取最稳定的关键点,该算法将加速鲁棒特征(SURF)与显著性检测相结合。然后将键盘和局部区域的特征组合在哈希向量中。还有一个为哈希向量随机给定的私密密钥,以防止攻击者对图像和新的哈希值进行整形。实验结果表明,该算法可以很好地识别经过单独、组合甚至多个操作内容的相似或初始图像。不同图像的黑客之间碰撞的概率几乎为零。此外,依赖于密钥的安全评估表明,所提议的制度是安全的,允许攻击者在不知道秘钥的情况下不伪造或估计正确的破坏值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Perceptual Image Hashing Using Surffor Feature Extraction and Ensemble Classifier
Image hash regimes have been widely used for authenticating content, recovery of images and digital forensics. In this article we propose a new algorithm for image haunting (SSL) with the most stable key points and regional features, strong against various manipulation of content conservation, including multiple combinatorial manipulations. In order to extract most stable keypoint, the proposed algorithm combines the Speed Up Robust Features (SURF) with Saliency detection. The keyboards and characteristics of the local area are then combined in a hash vector. There is also a sperate secret key that is randomly given for the hash vector to prevent an attacker from shaping the image and the new hash value. The proposed hacking algorithm shows that similar or initial images, which have been individually manipulated, combined and even multiple manipulated contents, can be visently identified by experimental result. The probability of collision between hacks of various images is almost nil. Furthermore, the key-dependent security assessment shows the proposed regime safe to allow an attacker without knowing the secret key not to forge or estimate the right havoc value.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信