Pairwise Image Matching for Plagiarism Detection

IF 0.8 4区 数学 Q3 MATHEMATICS
D. D. Dorin, K. D. Varlamova, A. V. Grabovoy
{"title":"Pairwise Image Matching for Plagiarism Detection","authors":"D. D. Dorin,&nbsp;K. D. Varlamova,&nbsp;A. V. Grabovoy","doi":"10.1134/S1064562425700486","DOIUrl":null,"url":null,"abstract":"<p>Plagiarism detection represents a critical task across various fields, including academic publishing, journalism, e-commerce, and media verification. While substantial attention focuses on identifying textual plagiarism, image plagiarism, particularly in biology and medicine, remains a significant concern. Automated retrieval systems often surface numerous potential candidates, but a high rate of false positives – pairs incorrectly flagged as plagiarism – necessitates highly accurate pairwise matching for verification. Manual alterations to images, such as rotations, mirroring, conversion to grayscale, and color distortion constitute forms of plagiarism. This work addresses the critical need for false positive rate (FPR) minimization in pairwise image plagiarism detection through rigorous analysis of similarity scoring models. The proposed approach employs a siamese network with three key components: a weight-shared encoder, a symmetric fusion module with order-invariant embedding combination, and a similarity classification head. Training employs a hybrid self-supervised strategy with plagiarism-mimicking augmentations, combining cross-entropy loss and contrastive regularization. Ablation studies evaluate encoder architectures and fusion strategies. For comparison, identical siamese architectures utilize frozen state-of-the-art self-supervised representations Barlow Twins and CLIP, with fusion modules and classification heads trained identically. Experimental validation across multi-domain images demonstrates that end-to-end trained models consistently outperform approaches using frozen state-of-the-art representations.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"112 2","pages":"370 - 381"},"PeriodicalIF":0.8000,"publicationDate":"2026-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562425700486.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Doklady Mathematics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1134/S1064562425700486","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Plagiarism detection represents a critical task across various fields, including academic publishing, journalism, e-commerce, and media verification. While substantial attention focuses on identifying textual plagiarism, image plagiarism, particularly in biology and medicine, remains a significant concern. Automated retrieval systems often surface numerous potential candidates, but a high rate of false positives – pairs incorrectly flagged as plagiarism – necessitates highly accurate pairwise matching for verification. Manual alterations to images, such as rotations, mirroring, conversion to grayscale, and color distortion constitute forms of plagiarism. This work addresses the critical need for false positive rate (FPR) minimization in pairwise image plagiarism detection through rigorous analysis of similarity scoring models. The proposed approach employs a siamese network with three key components: a weight-shared encoder, a symmetric fusion module with order-invariant embedding combination, and a similarity classification head. Training employs a hybrid self-supervised strategy with plagiarism-mimicking augmentations, combining cross-entropy loss and contrastive regularization. Ablation studies evaluate encoder architectures and fusion strategies. For comparison, identical siamese architectures utilize frozen state-of-the-art self-supervised representations Barlow Twins and CLIP, with fusion modules and classification heads trained identically. Experimental validation across multi-domain images demonstrates that end-to-end trained models consistently outperform approaches using frozen state-of-the-art representations.

用于抄袭检测的成对图像匹配
抄袭检测是一项跨多个领域的关键任务,包括学术出版、新闻、电子商务和媒体验证。虽然大量的注意力集中在识别文本剽窃,但图像剽窃,特别是在生物学和医学领域,仍然是一个值得关注的问题。自动检索系统通常会显示大量潜在的候选文章,但是高误报率——被错误地标记为抄袭的配对——需要高度精确的配对进行验证。手动更改图像,如旋转,镜像,转换为灰度和颜色失真构成抄袭的形式。本工作通过对相似评分模型的严格分析,解决了两两图像剽窃检测中假阳性率(FPR)最小化的关键需求。该方法采用了一个暹罗网络,该网络由三个关键组件组成:权重共享编码器、具有顺序不变嵌入组合的对称融合模块和相似分类头。训练采用混合自监督策略和抄袭模仿增强,结合交叉熵损失和对比正则化。消融研究评估编码器架构和融合策略。相比之下,相同的暹罗架构使用冻结的最先进的自监督表示Barlow Twins和CLIP,融合模块和分类头训练相同。跨多域图像的实验验证表明,端到端训练模型始终优于使用冻结的最先进表示的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Doklady Mathematics
Doklady Mathematics 数学-数学
CiteScore
1.00
自引率
16.70%
发文量
39
审稿时长
3-6 weeks
期刊介绍: Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书