Generating natural images with direct Patch Distributions Matching

• URL: http://arxiv.org/abs/2203.11862v1
• Date: Tue, 22 Mar 2022 16:38:52 GMT
• Title: Generating natural images with direct Patch Distributions Matching
• Authors: Ariel Elnekave, Yair Weiss
• Abstract summary: We develop an algorithm that explicitly and efficiently minimizes the distance between patch distributions in two images. Our results are often superior to single-image-GANs, require no training, and can generate high quality images in a few seconds.
• Score: 7.99536002595393
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many traditional computer vision algorithms generate realistic images by requiring that each patch in the generated image be similar to a patch in a training image and vice versa. Recently, this classical approach has been replaced by adversarial training with a patch discriminator. The adversarial approach avoids the computational burden of finding nearest neighbors of patches but often requires very long training times and may fail to match the distribution of patches. In this paper we leverage the recently developed Sliced Wasserstein Distance and develop an algorithm that explicitly and efficiently minimizes the distance between patch distributions in two images. Our method is conceptually simple, requires no training and can be implemented in a few lines of codes. On a number of image generation tasks we show that our results are often superior to single-image-GANs, require no training, and can generate high quality images in a few seconds. Our implementation is available at https://github.com/ariel415el/GPDM

Related papers

• Learning to Rank Patches for Unbiased Image Redundancy Reduction [80.93989115541966]
  Images suffer from heavy spatial redundancy because pixels in neighboring regions are spatially correlated. Existing approaches strive to overcome this limitation by reducing less meaningful image regions. We propose a self-supervised framework for image redundancy reduction called Learning to Rank Patches.
  arXiv  Detail & Related papers  (2024-03-31T13:12:41Z)
• Learning from small data sets: Patch-based regularizers in inverse problems for image reconstruction [1.1650821883155187]
  Recent advances in machine learning require a huge amount of data and computer capacity to train the networks. Our paper addresses the issue of learning from small data sets by taking patches of very few images into account. We show how we can achieve uncertainty quantification by approximating the posterior using Langevin Monte Carlo methods.
  arXiv  Detail & Related papers  (2023-12-27T15:30:05Z)
• CRD: Collaborative Representation Distance for Practical Anomaly Detection [2.3931689873603603]
  Patch based methods consider visual images as a collection of image patches according to positions. The nearest neighbor search for the query image and the stored patches will occupy $O(n)$ complexity in terms of time and space requirements. We propose an alternative approach to the distance calculation of image patches via collaborative representation models.
  arXiv  Detail & Related papers  (2023-12-20T13:47:08Z)
• PATS: Patch Area Transportation with Subdivision for Local Feature Matching [78.67559513308787]
  Local feature matching aims at establishing sparse correspondences between a pair of images. We propose Patch Area Transportation with Subdivision (PATS) to tackle this issue. PATS improves both matching accuracy and coverage, and shows superior performance in downstream tasks.
  arXiv  Detail & Related papers  (2023-03-14T08:28:36Z)
• Reinforcing Generated Images via Meta-learning for One-Shot Fine-Grained Visual Recognition [36.02360322125622]
  We propose a meta-learning framework to combine generated images with original images, so that the resulting "hybrid" training images improve one-shot learning. Our experiments demonstrate consistent improvement over baselines on one-shot fine-grained image classification benchmarks.
  arXiv  Detail & Related papers  (2022-04-22T13:11:05Z)
• A Hierarchical Transformation-Discriminating Generative Model for Few Shot Anomaly Detection [93.38607559281601]
  We devise a hierarchical generative model that captures the multi-scale patch distribution of each training image. The anomaly score is obtained by aggregating the patch-based votes of the correct transformation across scales and image regions.
  arXiv  Detail & Related papers  (2021-04-29T17:49:48Z)
• Drop the GAN: In Defense of Patches Nearest Neighbors as Single Image Generative Models [17.823089978609843]
  We show that all of these tasks can be performed without any training, within several seconds, in a unified, surprisingly simple framework. We start with an initial coarse guess, and then simply refine the details coarse-to-fine using patch-nearest-neighbor search. This allows generating random novel images better and much faster than GANs.
  arXiv  Detail & Related papers  (2021-03-29T12:20:46Z)
• An Empirical Study of the Collapsing Problem in Semi-Supervised 2D Human Pose Estimation [80.02124918255059]
  Semi-supervised learning aims to boost the accuracy of a model by exploring unlabeled images. We learn two networks to mutually teach each other. The more reliable predictions on easy images in each network are used to teach the other network to learn about the corresponding hard images.
  arXiv  Detail & Related papers  (2020-11-25T03:29:52Z)
• Contrastive Learning for Unpaired Image-to-Image Translation [64.47477071705866]
  In image-to-image translation, each patch in the output should reflect the content of the corresponding patch in the input, independent of domain. We propose a framework based on contrastive learning to maximize mutual information between the two. We demonstrate that our framework enables one-sided translation in the unpaired image-to-image translation setting, while improving quality and reducing training time.
  arXiv  Detail & Related papers  (2020-07-30T17:59:58Z)
• The Power of Triply Complementary Priors for Image Compressive Sensing [89.14144796591685]
  We propose a joint low-rank deep (LRD) image model, which contains a pair of complementaryly trip priors. We then propose a novel hybrid plug-and-play framework based on the LRD model for image CS. To make the optimization tractable, a simple yet effective algorithm is proposed to solve the proposed H-based image CS problem.
  arXiv  Detail & Related papers  (2020-05-16T08:17:44Z)
• A Survey on Patch-based Synthesis: GPU Implementation and Optimization [0.0]
  This thesis surveys the research in patch-based synthesis and algorithms for finding correspondences between small local regions of images. One of the algorithms we have studied is PatchMatch, can find similar regions or "patches" of an image one to two orders of magnitude faster than previous techniques. In computer graphics, we have explored removing unwanted objects from images, seamlessly moving objects in images, changing image aspect ratios, and video summarization.
  arXiv  Detail & Related papers  (2020-05-11T19:25:28Z)

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.