2018
DOI: 10.1364/oe.26.019773
|View full text |Cite
|
Sign up to set email alerts
|

Denoising Poisson phaseless measurements via orthogonal dictionary learning

Abstract: Phaseless diffraction measurements recorded by CCD detectors are often affected by Poisson noise. In this paper, we propose a dictionary learning model by employing patches based sparsity in order to denoise such Poisson phaseless measurements. The model consists of three terms: (i) A representation term by an orthogonal dictionary, (ii) an L pseudo norm of the coefficient matrix, and (iii) a Kullback-Leibler divergence term to fit phaseless Poisson data. Fast alternating minimization method (AMM) and proximal… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0

Year Published

2018
2018
2025
2025

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(9 citation statements)
references
References 55 publications
0
9
0
Order By: Relevance
“…Similar problems for the case b i = 0 have been considered previously [16][17][18][19][20][21]. Many optical sensors also have Gaussian readout noise [22,23]; the log likelihood for a Poisson + Gaussian distribution is complicated, so a common approximation is to use a shifted Poisson model that also leads to the cost function in (3).…”
Section: Introductionmentioning
confidence: 81%
“…Similar problems for the case b i = 0 have been considered previously [16][17][18][19][20][21]. Many optical sensors also have Gaussian readout noise [22,23]; the log likelihood for a Poisson + Gaussian distribution is complicated, so a common approximation is to use a shifted Poisson model that also leads to the cost function in (3).…”
Section: Introductionmentioning
confidence: 81%
“…These methods include Newton's method and fixed point iteration method. In this paper, we will use the fixed iteration method to compute the solution: start from an initial solution u (0) and use the recursive process (12) u (k+1) = T (u (k) ).…”
Section: 22mentioning
confidence: 99%
“…Gaussian distribution has many convenient mathematical properties, and many methods have been developed to remove additive Gaussian noise. In recent decades, by using the redundancy and similarity among the patches in the image, non-local patch based denoising methods [9,14,12,24,37,39,36,49] have drawn a lot of attention. Usually, these methods consist of three procedures: patch extraction and matching according to some similarity measure, patch denoising utilizing certain structures that live inside the patch blocks, and patch aggregation to recover the clean image.…”
mentioning
confidence: 99%
“…a diagonal matrix formed by setting elements of d as its principal diagonal. It is to be noted that A H A −1 A H is the pseudo-inverse of matrix A and hence (35) can be compactly written as:…”
Section: B Primal-dual Majorization-minimization (Pdmm) Algorithmmentioning
confidence: 99%
“…In the works of [31], [32], [33], [34], [35], [36], various authors have considered data models similar to (5) for phaseretrieval for the case of background signal b i = 0. However, background signal is rarely zero in real world applications.…”
Section: Introduction and Literaturementioning
confidence: 99%