自适应匹配复制移动伪造检测

Mohsen Zandi, Ahmad Mahmoudi Aznaveh, Azadeh Mansouri
{"title":"自适应匹配复制移动伪造检测","authors":"Mohsen Zandi, Ahmad Mahmoudi Aznaveh, Azadeh Mansouri","doi":"10.1109/WIFS.2014.7084314","DOIUrl":null,"url":null,"abstract":"The objective of copy-move forgery detection methods are to find copied regions within the same image. There are two main approaches to detect copy-move forgery: keypoint-based and block-based methods. Although the former is superior in terms of computational complexity, these methods neglect the smooth regions since they confine their search to salient points. On the other hand, while block-based methods consider smooth areas, they introduce a huge number of false matches. In this paper, it is proposed to employ an adaptive threshold in the matching phase in order to overcome this problem. The experimental results demonstrate that the proposed method can greatly reduce the number of false matches which results in improving both performance and computational cost.","PeriodicalId":220523,"journal":{"name":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"47","resultStr":"{\"title\":\"Adaptive matching for copy-move Forgery detection\",\"authors\":\"Mohsen Zandi, Ahmad Mahmoudi Aznaveh, Azadeh Mansouri\",\"doi\":\"10.1109/WIFS.2014.7084314\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The objective of copy-move forgery detection methods are to find copied regions within the same image. There are two main approaches to detect copy-move forgery: keypoint-based and block-based methods. Although the former is superior in terms of computational complexity, these methods neglect the smooth regions since they confine their search to salient points. On the other hand, while block-based methods consider smooth areas, they introduce a huge number of false matches. In this paper, it is proposed to employ an adaptive threshold in the matching phase in order to overcome this problem. The experimental results demonstrate that the proposed method can greatly reduce the number of false matches which results in improving both performance and computational cost.\",\"PeriodicalId\":220523,\"journal\":{\"name\":\"2014 IEEE International Workshop on Information Forensics and Security (WIFS)\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"47\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Workshop on Information Forensics and Security (WIFS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WIFS.2014.7084314\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIFS.2014.7084314","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 47

摘要

复制-移动伪造检测方法的目标是在同一图像中找到被复制的区域。检测复制-移动伪造有两种主要方法:基于关键点的方法和基于块的方法。虽然前者在计算复杂度方面更胜一筹,但由于它们将搜索限制在显著点上,因此忽略了光滑区域。另一方面,虽然基于块的方法考虑平滑区域,但它们引入了大量的错误匹配。本文提出在匹配阶段采用自适应阈值来克服这一问题。实验结果表明,该方法可以大大减少错误匹配的数量,从而提高了性能和计算成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Adaptive matching for copy-move Forgery detection
The objective of copy-move forgery detection methods are to find copied regions within the same image. There are two main approaches to detect copy-move forgery: keypoint-based and block-based methods. Although the former is superior in terms of computational complexity, these methods neglect the smooth regions since they confine their search to salient points. On the other hand, while block-based methods consider smooth areas, they introduce a huge number of false matches. In this paper, it is proposed to employ an adaptive threshold in the matching phase in order to overcome this problem. The experimental results demonstrate that the proposed method can greatly reduce the number of false matches which results in improving both performance and computational cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Modeling the flicker effect in camcorded videos to improve watermark robustness Fair resource allocation under an unknown jamming attack: a Bayesian game Puzzling face verification algorithms for privacy protection Botnet identification via universal anomaly detection Iterative filtering for semi-fragile self-recovery
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1