Using Convex Optimization of Autocorrelation with Constrained Support and Windowing for Improved Phase Retrieval Accuracy

04/16/2018
by   Alberto Pietrini, et al.
0

In imaging modalities recording diffraction data, the original image can be reconstructed assuming known phases. When phases are unknown, oversampling and a constraint on the support region in the original object can be used to solve a non-convex optimization problem. Such schemes are ill-suited to find the optimum solution for sparse data, since the recorded image does not correspond exactly to the original wave function. We construct a convex optimization problem using a relaxed support constraint and a maximum-likelihood treatment of the recorded data as a sample from the underlying wave function. We also stress the need to use relevant windowing techniques to account for the sampled pattern being finite. On simulated data, we demonstrate the benefits of our approach in terms of visual quality and an improvement in the crystallographic R-factor from .4 to .1 for highly noisy data.

READ FULL TEXT

page 4

page 13

page 14

research
11/20/2017

Solution of network localization problem with noisy distances and its convergence

The network localization problem with convex and non-convex distance con...
research
10/27/2020

Graph Blind Deconvolution with Sparseness Constraint

We propose a blind deconvolution method for signals on graphs, with the ...
research
06/13/2012

Hierarchical POMDP Controller Optimization by Likelihood Maximization

Planning can often be simpli ed by decomposing the task into smaller tas...
research
08/15/2011

Advanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude

Sparse modeling is one of the efficient techniques for imaging that allo...
research
05/08/2023

Distributed Detection over Blockchain-aided Internet of Things in the Presence of Attacks

Distributed detection over a blockchain-aided Internet of Things (BIoT) ...
research
02/22/2021

Slowly Varying Regression under Sparsity

We consider the problem of parameter estimation in slowly varying regres...
research
10/17/2019

Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimization

A fundamental problem arising in many areas of machine learning is the e...

Please sign up or login with your details

Forgot password? Click here to reset