Detecting Near-Duplicate Face Images
- URL: http://arxiv.org/abs/2408.07689v1
- Date: Wed, 14 Aug 2024 17:45:13 GMT
- Title: Detecting Near-Duplicate Face Images
- Authors: Sudipta Banerjee, Arun Ross,
- Abstract summary: We construct a tree-like structure called an Image Phylogeny Tree (IPT) using a graph-theoretic approach to estimate the relationship.
We further extend our method to create an ensemble of IPTs known as Image Phylogeny Forests (IPFs)
- Score: 11.270856740227327
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Near-duplicate images are often generated when applying repeated photometric and geometric transformations that produce imperceptible variants of the original image. Consequently, a deluge of near-duplicates can be circulated online posing copyright infringement concerns. The concerns are more severe when biometric data is altered through such nuanced transformations. In this work, we address the challenge of near-duplicate detection in face images by, firstly, identifying the original image from a set of near-duplicates and, secondly, deducing the relationship between the original image and the near-duplicates. We construct a tree-like structure, called an Image Phylogeny Tree (IPT) using a graph-theoretic approach to estimate the relationship, i.e., determine the sequence in which they have been generated. We further extend our method to create an ensemble of IPTs known as Image Phylogeny Forests (IPFs). We rigorously evaluate our method to demonstrate robustness across other modalities, unseen transformations by latest generative models and IPT configurations, thereby significantly advancing the state-of-the-art performance by 42% on IPF reconstruction accuracy.
Related papers
- LTT-GAN: Looking Through Turbulence by Inverting GANs [86.25869403782957]
We propose the first turbulence mitigation method that makes use of visual priors encapsulated by a well-trained GAN.
Based on the visual priors, we propose to learn to preserve the identity of restored images on a periodic contextual distance.
Our method significantly outperforms prior art in both the visual quality and face verification accuracy of restored results.
arXiv Detail & Related papers (2021-12-04T16:42:13Z) - Adversarially Perturbed Wavelet-based Morphed Face Generation [16.98806338782858]
Morphed images can fool Facial Recognition Systems into falsely accepting multiple people.
As morphed image synthesis becomes easier, it is vital to expand the research community's available data.
We leverage both methods to generate high-quality adversarially perturbed from the FERET, FRGC, and FRLL datasets.
arXiv Detail & Related papers (2021-11-03T01:18:29Z) - Ensembling with Deep Generative Views [72.70801582346344]
generative models can synthesize "views" of artificial images that mimic real-world variations, such as changes in color or pose.
Here, we investigate whether such views can be applied to real images to benefit downstream analysis tasks such as image classification.
We use StyleGAN2 as the source of generative augmentations and investigate this setup on classification tasks involving facial attributes, cat faces, and cars.
arXiv Detail & Related papers (2021-04-29T17:58:35Z) - Generative and Discriminative Learning for Distorted Image Restoration [22.230017059874445]
Liquify is a technique for image editing, which can be used for image distortion.
We propose a novel generative and discriminative learning method based on deep neural networks.
arXiv Detail & Related papers (2020-11-11T14:01:29Z) - Learning to Restore a Single Face Image Degraded by Atmospheric
Turbulence using CNNs [93.72048616001064]
Images captured under such condition suffer from a combination of geometric deformation and space varying blur.
We present a deep learning-based solution to the problem of restoring a turbulence-degraded face image.
arXiv Detail & Related papers (2020-07-16T15:25:08Z) - Image-to-image Mapping with Many Domains by Sparse Attribute Transfer [71.28847881318013]
Unsupervised image-to-image translation consists of learning a pair of mappings between two domains without known pairwise correspondences between points.
Current convention is to approach this task with cycle-consistent GANs.
We propose an alternate approach that directly restricts the generator to performing a simple sparse transformation in a latent layer.
arXiv Detail & Related papers (2020-06-23T19:52:23Z) - Exploiting Deep Generative Prior for Versatile Image Restoration and
Manipulation [181.08127307338654]
This work presents an effective way to exploit the image prior captured by a generative adversarial network (GAN) trained on large-scale natural images.
The deep generative prior (DGP) provides compelling results to restore missing semantics, e.g., color, patch, resolution, of various degraded images.
arXiv Detail & Related papers (2020-03-30T17:45:07Z) - Face Phylogeny Tree Using Basis Functions [13.164846772893455]
Photometric transformations can be applied to a face image repeatedly creating a set of near-duplicate images.
Identifying the original image from a set of such near-duplicates and deducing the relationship between them are important in the context of digital image forensics.
In this work, we utilize three different families of basis functions to model pairwise relationships between near-duplicate images.
arXiv Detail & Related papers (2020-02-21T00:13:21Z) - Fine-grained Image-to-Image Transformation towards Visual Recognition [102.51124181873101]
We aim at transforming an image with a fine-grained category to synthesize new images that preserve the identity of the input image.
We adopt a model based on generative adversarial networks to disentangle the identity related and unrelated factors of an image.
Experiments on the CompCars and Multi-PIE datasets demonstrate that our model preserves the identity of the generated images much better than the state-of-the-art image-to-image transformation models.
arXiv Detail & Related papers (2020-01-12T05:26:47Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.