تعداد نشریات | 418 |
تعداد شمارهها | 10,005 |
تعداد مقالات | 83,629 |
تعداد مشاهده مقاله | 78,550,803 |
تعداد دریافت فایل اصل مقاله | 55,703,260 |
Copy-Move Forgery Detection by an Optimal Keypoint on SIFT (OKSIFT) Method. | ||
Journal of Computer & Robotics | ||
دوره 14، شماره 2 - شماره پیاپی 24، مهر 2021، صفحه 11-19 اصل مقاله (318.82 K) | ||
نوع مقاله: Original Research (Full Papers) | ||
شناسه دیجیتال (DOI): 10.22094/jcr.2021.687485 | ||
نویسندگان | ||
Ehsan Amiri1؛ Ahmad Mosallanejad* 2؛ Amir Sheikhahmadi1 | ||
1Department of Computer Engineering, Sanandaj Branch, Islamic Azad University, Sanandaj, Iran | ||
2Department of Computer Engineering, Sepidan Branch, Islamic Azad University, Sepidan, Iran | ||
چکیده | ||
Copy-Move is a technique widely used in digital image tampering, meaning Copy Move Forgery Detection (CMFD) is still significant research. This paper proposes an optimal keypoint in SIFT (OKSIFT). The OKSIFT method produces images of different sizes and different sigma’s. Then with the help of the Gaussian difference (DoG) method, the maximum and minimum keypoints are calculated. When selecting the optimal keypoints, the absolute value of the second sentence will be used instead of using the Taylor expansion binomial series. First, the keypoints lose their dependence on the blurred regions, and secondly, more keypoints appear at the main edges. In the localization process of the region, considering the cases of multiple copies, method g2NN has been used to compare the keypoints. This method reduces the complexity of keypoint calculations and gives a better answer. Experimental results based on precision, recall, and F1 criteria show that the proposed method, with good robustness, works better than some advanced methods. | ||
کلیدواژهها | ||
Copy-Move Forgery Detection؛ SIFT؛ New Optimal Keypoint in SIFT؛ Gaussian Filter | ||
آمار تعداد مشاهده مقاله: 340 تعداد دریافت فایل اصل مقاله: 194 |