首页> 外文会议>International Conference on Advanced Technologies for Communications >The efficiency of applying DWT and feature extraction into copy-move images detection
【24h】

The efficiency of applying DWT and feature extraction into copy-move images detection

机译:在复制移动图像检测中应用DWT和特征提取的效率

获取原文

摘要

The paper presents the efficiency of applying DWT into copy-move image forgery detection by developing an algorithm which combines DWT and feature extraction to improve the computational time compared to the algorithm without DWT. With the characteristic of invariant to rotation, Zernike Moments are used to extract the features of image blocks. The novelty of this article is not only combination of multiscale and features extraction but also the modification of parameters of Zernike moments in the proposed algorithm. The tested image is reduced dimension by DWT before looking for the similar regions as traces of copy-move forgery manipulation. Upon the principle that most of forged information concentrate at the low frequencies, the approximation sub-band (LL) is considered for detection. This band is then split into 16×16 overlapping blocks from which the modified Zernike moments are extracted to be block feature vectors with higher exactness than the traditional Zernike moments. These vectors are arranged into matrix and sorted lexicographically to find the similar vectors from group of consecutive vectors having correlation coefficients of 0.95. The fact that neighbor blocks may be similar and the copied regions can be comprised by many blocks and requires a distance to make sure that they are really similar, not neighbors. Simulation results running in Matlab R2013a proves the feasibility and efficiency of the proposed algorithm.
机译:通过开发一种将DWT和特征提取相结合的算法,与不使用DWT的算法相比,将DWT应用于复制移动图像伪造检测中的效率。具有旋转不变性的特征,Zernike Moments用于提取图像块的特征。本文的新颖性不仅在于多尺度和特征提取的结合,而且还在于所提出算法中Zernike矩参数的修改。在寻找与复制移动伪造操作痕迹相似的区域之前,先通过DWT缩小测试图像的尺寸。基于大多数伪造信息集中在低频的原理,考虑使用近似子带(LL)进行检测。然后将该频带分割为16×16个重叠的块,从这些块中提取经过修改的Zernike矩,以作为比传统Zernike矩精度更高的块特征向量。这些向量被排列成矩阵并按字典顺序排序,以从相关系数为0.95的连续向量组中找到相似的向量。相邻块可能相似并且被复制的区域可以由许多块组成的事实需要一定的距离,以确保它们确实是相似的,而不是相邻的。在Matlab R2013a中运行的仿真结果证明了该算法的可行性和有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号