1998
DOI: 10.1364/ao.37.003053
|View full text |Cite
|
Sign up to set email alerts
|

New regularization scheme for phase unwrapping

Abstract: A new, to our knowledge, algorithm for the phase unwrapping (PU) problem that is based on stochastic relaxation is proposed and analyzed. Unlike regularization schemes previously proposed to handle this problem, our approach dispells the following two assumptions about the solution: a Gaussian model for noise and the magnitude of the true phase-field gradient's being less than pi everywhere. We formulate PU as a constrained optimization problem for the field of integer multiples of 2pi, which must be added to … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

1999
1999
2004
2004

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 34 publications
(13 citation statements)
references
References 16 publications
0
11
0
Order By: Relevance
“…Lemma 1: Let and be two wrap-counts images such that (21) Then there exists a binary image such that (22) Proof: See Appendix A. According to Lemma 1, we can iteratively compute , where minimizes , until the the minimum energy is reached.…”
Section: A -Stepmentioning
confidence: 99%
“…Lemma 1: Let and be two wrap-counts images such that (21) Then there exists a binary image such that (22) Proof: See Appendix A. According to Lemma 1, we can iteratively compute , where minimizes , until the the minimum energy is reached.…”
Section: A -Stepmentioning
confidence: 99%
“…In a quite different vein, and recognizing that the absolute phase estimation is an ill-posed problem, papers [4], [5], [6], [7] have adopted the regularization framework to impose smoothness on the solution. The same objective has been pursued in papers [8], [9], [10], [11] by adopting a Bayesian viewpoint.…”
Section: Introductionmentioning
confidence: 99%
“…In a couple of recent papers, the phase unwrapping problem was handled by methods of Statistical Mechanics. Simulated annealing was applied in [14]. In [15] the problem is solved by the Mean-Field Annealing (MFA) technique; PU is formulated as a constrained optimization problem for the field of integer corrections to be added to the wrapped phase gradient in order to recover the true phase gradient, with the cost function consisting of second order differences, and measuring the smoothness of the reconstructed phase field.…”
Section: Introductionmentioning
confidence: 99%