Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Copy-move forgery detection using convolutional neural network and K-mean clustering

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 11 No. 3 (2021)

DOI
10.11591/ijece.v11i3.pp2604-2612
ISSN
2722-2578, 2088-8708
Terbit
2021-06-01
Penerbit
Institute of Advanced Engineering and Science
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Copying and pasting a patch of an image to hide or exaggerate something in a digital image is known as a copy-move forgery. Copy-move forgery detection (CMFD) is hard to detect because the copied part image from a scene has similar properties with the other parts of the image in terms of texture, light illumination, and objective. The CMFD is still a challenging issue in some attacks such as rotation, scaling, blurring, and noise. In this paper, an approach using the convolutional neural network (CNN) and k-mean clustering is for CMFD. To identify cloned parts candidates, a patch of an image is extracted using corner detection. Next, similar patches are detected using a pre-trained network inspired by the Siamese network. If two similar patches are not evidence of the CMFD, the post-process is performed using k-means clustering. Experimental analyses are done on MICC-F2000, MICC-F600, and MICC-F8 databases. The results showed that using the proposed algorithm we can receive a 94.13% and 96.98% precision and F1 score, respectively, which are the highest among all state-of-the-art algorithms.

Jaringan kolaborasi para penulis

3 penulis · 3 tautan kepenulisan bersama · 3 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Islamic Azad University, Tehran
  • University of Guilan
  • Technical and Vocational University
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Data ini berasal dari Crossref (yang disetorkan penerbit), karena endpoint OAI-PMH milik jurnal tidak dapat di-harvest.

Sumber metadata: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, pertama di-harvest 27 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata sebagai oai_dc, dikonversi dari Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Copy-move forgery detection using convolutional neural network and K-mean clustering</dc:title><dc:creator>Pourkashani, Ava</dc:creator><dc:creator>Shahbahrami, Asadollah</dc:creator><dc:creator>Akoushideh, Alireza</dc:creator><dc:description>&lt;jats:p&gt;Copying and pasting a patch of an image to hide or exaggerate something in a digital image is known as a copy-move forgery. Copy-move forgery detection (CMFD) is hard to detect because the copied part image from a scene has similar properties with the other parts of the image in terms of texture, light illumination, and objective. The CMFD is still a challenging issue in some attacks such as rotation, scaling, blurring, and noise. In this paper, an approach using the convolutional neural network (CNN) and k-mean clustering is for CMFD. To identify cloned parts candidates, a patch of an image is extracted using corner detection. Next, similar patches are detected using a pre-trained network inspired by the Siamese network. If two similar patches are not evidence of the CMFD, the post-process is performed using k-means clustering. Experimental analyses are done on MICC-F2000, MICC-F600, and MICC-F8 databases. The results showed that using the proposed algorithm we can receive a 94.13% and 96.98% precision and F1 score, respectively, which are the highest among all state-of-the-art algorithms.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2021-06-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v11i3.pp2604-2612</dc:identifier><dc:identifier>10.11591/ijece.v11i3.pp2604-2612</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 11 No 3 (2021); 2604</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/21776/14814</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>