Patch based Colour Transfer using SIFT Flow

• URL: http://arxiv.org/abs/2005.09015v1
• Date: Mon, 18 May 2020 18:22:36 GMT
• Title: Patch based Colour Transfer using SIFT Flow
• Authors: Hana Alghamdi, Rozenn Dahyot
• Abstract summary: We propose a new colour transfer method with Optimal Transport (OT) to transfer the colour of a sourceimage to match the colour of a target image. Experiments show quantitative andqualitative improvements over previous state of the art colour transfer methods.
• Score: 2.8790548120668573
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a new colour transfer method with Optimal Transport (OT) to transfer the colour of a sourceimage to match the colour of a target image of the same scene that may exhibit large motion changes betweenimages. By definition OT does not take into account any available information about correspondences whencomputing the optimal solution. To tackle this problem we propose to encode overlapping neighborhoodsof pixels using both their colour and spatial correspondences estimated using motion estimation. We solvethe high dimensional problem in 1D space using an iterative projection approach. We further introducesmoothing as part of the iterative algorithms for solving optimal transport namely Iterative DistributionTransport (IDT) and its variant the Sliced Wasserstein Distance (SWD). Experiments show quantitative andqualitative improvements over previous state of the art colour transfer methods.

Related papers

• Rethinking Score Distillation as a Bridge Between Image Distributions [97.27476302077545]
  We show that our method seeks to transport corrupted images (source) to the natural image distribution (target) Our method can be easily applied across many domains, matching or beating the performance of specialized methods. We demonstrate its utility in text-to-2D, text-based NeRF optimization, translating paintings to real images, optical illusion generation, and 3D sketch-to-real.
  arXiv  Detail & Related papers  (2024-06-13T17:59:58Z)
• DARC: Distribution-Aware Re-Coloring Model for Generalizable Nucleus Segmentation [68.43628183890007]
  We argue that domain gaps can also be caused by different foreground (nucleus)-background ratios. First, we introduce a re-coloring method that relieves dramatic image color variations between different domains. Second, we propose a new instance normalization method that is robust to the variation in the foreground-background ratios.
  arXiv  Detail & Related papers  (2023-09-01T01:01:13Z)
• $PC^2$: Projection-Conditioned Point Cloud Diffusion for Single-Image 3D Reconstruction [97.06927852165464]
  Reconstructing the 3D shape of an object from a single RGB image is a long-standing and highly challenging problem in computer vision. We propose a novel method for single-image 3D reconstruction which generates a sparse point cloud via a conditional denoising diffusion process.
  arXiv  Detail & Related papers  (2023-02-21T13:37:07Z)
• Cross-Camera Deep Colorization [10.254243409261898]
  We propose an end-to-end convolutional neural network to align and fuse images from a color-plus-mono dual-camera system. Our method consistently achieves substantial improvements, i.e., around 10dB PSNR gain.
  arXiv  Detail & Related papers  (2022-08-26T11:02:14Z)
• Neural Color Operators for Sequential Image Retouching [62.99812889713773]
  We propose a novel image retouching method by modeling the retouching process as performing a sequence of newly introduced trainable neural color operators. The neural color operator mimics the behavior of traditional color operators and learns pixelwise color transformation while its strength is controlled by a scalar. Our method consistently achieves the best results compared with SOTA methods in both quantitative measures and visual qualities.
  arXiv  Detail & Related papers  (2022-07-17T05:33:19Z)
• Immiscible Color Flows in Optimal Transport Networks for Image Classification [68.8204255655161]
  We propose a physics-inspired system that adapts Optimal Transport principles to leverage color distributions of images. Our dynamics regulates immiscible of colors traveling on a network built from images. Our method outperforms competitor algorithms on image classification tasks in datasets where color information matters.
  arXiv  Detail & Related papers  (2022-05-04T12:41:36Z)
• Sliced $\mathcal{L}_2$ Distance for Colour Grading [1.6389581549801253]
  We propose a new method with $mathcalL$ distance that maps one $N$-dimensional distribution to another. We solve the high-dimensional problem in 1D space using an iterative projection approach. Experiments show quantitative and qualitative competitive results as compared with the state of the art colour transfer methods.
  arXiv  Detail & Related papers  (2021-02-18T12:17:18Z)
• AOT: Appearance Optimal Transport Based Identity Swapping for Forgery Detection [76.7063732501752]
  We provide a new identity swapping algorithm with large differences in appearance for face forgery detection. The appearance gaps mainly arise from the large discrepancies in illuminations and skin colors. A discriminator is introduced to distinguish the fake parts from a mix of real and fake image patches.
  arXiv  Detail & Related papers  (2020-11-05T06:17:04Z)
• Underwater Image Color Correction by Complementary Adaptation [0.0]
  We propose a novel approach for underwater image color correction based on a Tikhonov type optimization model in the CIELAB color space. Understood as a long-term adaptive process, our method effectively removes the underwater color cast and yields a balanced color distribution.
  arXiv  Detail & Related papers  (2020-10-21T03:59:22Z)
• Example-based Color Transfer with Gaussian Mixture Modeling [16.880968031370767]
  We model color transfer under a probability framework and cast it as a parameter estimation problem. We employ the Expectation-Maximization (EM) algorithm (E-step and M-step) for optimization. Our method is able to generate continuous color transfer results with increasing EM iterations.
  arXiv  Detail & Related papers  (2020-08-31T14:07:54Z)
• Iterative Nadaraya-Watson Distribution Transfer for Colour Grading [2.8790548120668573]
  We propose a new method that maps one N-dimensional distribution to another taking into account available information about correspondences. We extend the 2D/3D problem to higher dimensions by encoding overlapping neighborhoods of data points and solve the high dimensional problem in 1D space.
  arXiv  Detail & Related papers  (2020-06-15T00:14:03Z)

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.