mlsanityData to 7 Oct 2026

Mobile authentication of copy detection patterns

arXiv 2203.02397 ↗First posted 4 Mar 2022cs.CR cs.CVcited by 4

Not on the map. Why?

Abstract (arXiv)

In the recent years, the copy detection patterns (CDP) attracted a lot of attention as a link between the physical and digital worlds, which is of great interest for the internet of things and brand protection applications. However, the security of CDP in terms of their reproducibility by unauthorized parties or clonability remains largely unexplored. In this respect this paper addresses a problem of anti-counterfeiting of physical objects and aims at investigating the authentication aspects and the resistances to illegal copying of the modern CDP from machine learning perspectives. A special attention is paid to a reliable authentication under the real life verification conditions when the codes are printed on an industrial printer and enrolled via modern mobile phones under regular light conditions. The theoretical and empirical investigation of authentication aspects of CDP is performed with respect to four types of copy fakes from the point of view of (i) multi-class supervised classification as a baseline approach and (ii) one-class classification as a real-life application case. The obtained results show that the modern machine-learning approaches and the technical capacities of modern mobile phones allow to reliably authenticate CDP on end-user mobile phones under the considered classes of fakes.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 3 of its 36 references that are in the map. First posted on arXiv 4 Mar 2022.

Builds on

3 of 36 references.

References · 3

  1. 2022Generative Adversarial Networkscited by 5,603
  2. 2019Information bottleneck through variational glassescited by 19
  3. 2019Clonability of anti-counterfeiting printable graphical codes: a machine learning approachcited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 0; 2024: 0; 2025: 1; 2026: 1.

4 papers.