A Closer Look at Reference Learning for Fourier Phase Retrieval
- URL: http://arxiv.org/abs/2110.13688v1
- Date: Tue, 26 Oct 2021 13:25:36 GMT
- Title: A Closer Look at Reference Learning for Fourier Phase Retrieval
- Authors: Tobias Uelwer, Nick Rucks, Stefan Harmeling
- Abstract summary: We consider a modified version of the phase retrieval problem, which allows for a reference image to be added onto the image before the Fourier magnitudes are measured.
We propose a simple and efficient to construct reference images that, in some cases, yields reconstructions of comparable quality as approaches that learn references.
- Score: 0.966840768820136
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Reconstructing images from their Fourier magnitude measurements is a problem
that often arises in different research areas. This process is also referred to
as phase retrieval. In this work, we consider a modified version of the phase
retrieval problem, which allows for a reference image to be added onto the
image before the Fourier magnitudes are measured. We analyze an unrolled
Gerchberg-Saxton (GS) algorithm that can be used to learn a good reference
image from a dataset. Furthermore, we take a closer look at the learned
reference images and propose a simple and efficient heuristic to construct
reference images that, in some cases, yields reconstructions of comparable
quality as approaches that learn references. Our code is available at
https://github.com/tuelwer/reference-learning.
Related papers
- 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) - Alternating Phase Langevin Sampling with Implicit Denoiser Priors for
Phase Retrieval [1.7767466724342065]
We present a way leveraging the prior implicitly learned by a denoiser to solve phase retrieval problems by incorporating it in a classical framework.
Compared to performant denoising-based algorithms for phase retrieval, we showcase competitive performance with notable measurements on in-distribution images and notable out-of-distribution images.
arXiv Detail & Related papers (2022-11-02T05:08:50Z) - Correlation Verification for Image Retrieval [15.823918683848877]
We propose a novel image retrieval re-ranking network named Correlation Verification Networks (CVNet)
CVNet compresses dense feature correlation into image similarity while learning diverse geometric matching patterns from various image pairs.
Our proposed network shows state-of-the-art performance on several retrieval benchmarks with a significant margin.
arXiv Detail & Related papers (2022-04-04T13:18:49Z) - Contrastive Feature Loss for Image Prediction [55.373404869092866]
Training supervised image synthesis models requires a critic to compare two images: the ground truth to the result.
We introduce an information theory based approach to measuring similarity between two images.
We show that our formulation boosts the perceptual realism of output images when used as a drop-in replacement for the L1 loss.
arXiv Detail & Related papers (2021-11-12T20:39:52Z) - 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) - Understanding Image Retrieval Re-Ranking: A Graph Neural Network
Perspective [52.96911968968888]
In this paper, we demonstrate that re-ranking can be reformulated as a high-parallelism Graph Neural Network (GNN) function.
On the Market-1501 dataset, we accelerate the re-ranking processing from 89.2s to 9.4ms with one K40m GPU, facilitating the real-time post-processing.
arXiv Detail & Related papers (2020-12-14T15:12:36Z) - Shared Prior Learning of Energy-Based Models for Image Reconstruction [69.72364451042922]
We propose a novel learning-based framework for image reconstruction particularly designed for training without ground truth data.
In the absence of ground truth data, we change the loss functional to a patch-based Wasserstein functional.
In shared prior learning, both aforementioned optimal control problems are optimized simultaneously with shared learned parameters of the regularizer.
arXiv Detail & Related papers (2020-11-12T17:56:05Z) - Powers of layers for image-to-image translation [60.5529622990682]
We propose a simple architecture to address unpaired image-to-image translation tasks.
We start from an image autoencoder architecture with fixed weights.
For each task we learn a residual block operating in the latent space, which is iteratively called until the target domain is reached.
arXiv Detail & Related papers (2020-08-13T09:02:17Z) - Solving Phase Retrieval with a Learned Reference [18.76940558836028]
Fourier phase retrieval is a classical problem that deals with the recovery of an image from the amplitude measurements of its Fourier coefficients.
In this paper, we assume that a known (learned) reference is added to the signal before capturing the amplitude measurements.
Our method is inspired by the principle of adding a reference signal in holography.
arXiv Detail & Related papers (2020-07-29T06:17:25Z) - An Image Analogies Approach for Multi-Scale Contour Detection [4.974890682815778]
We present a new method to locate contours of a query image in the same way that it is done for the reference (i.e. by analogy)
14 derived stereo patches, derived from a mathematical study, are the knowledge used in order to locate contours at different scales independently of the light conditions.
arXiv Detail & Related papers (2020-07-21T19:14:18Z) - Geometrically Mappable Image Features [85.81073893916414]
Vision-based localization of an agent in a map is an important problem in robotics and computer vision.
We propose a method that learns image features targeted for image-retrieval-based localization.
arXiv Detail & Related papers (2020-03-21T15:36:38Z)
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.