1996
DOI: 10.1117/1.600810
|View full text |Cite
|
Sign up to set email alerts
|

Phase unwrapping by a maximum cross‐amplitude spanning tree algorithm: a comparative study

Abstract: A comparative study is made of phase-unwrapping algorithms that adopt either phase gradients or fringe amplitudes as a reliability measure in the selection of an unwrapping path. To compare with the minimum-phase-gradient spanning-tree algorithm, a maximum cross-amplitude spanning-tree algorithm is proposed, which seeks a spanning tree that maximizes overall edge weights given by the crossamplitudes, i.e., the products of the fringe amplitudes of neighboring pixels. Noise immunity of the cross-amplitude spanni… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

1998
1998
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 58 publications
(24 citation statements)
references
References 15 publications
0
24
0
Order By: Relevance
“…͑7͒, the quantity of noise in the image can be given as noise signal ratio ͑NSR͒. 22 I͑x,z ͒ϭa͑ x,z ͒ϩb͑ x,z ͒cos͓ cx ϩ͑x,z ͔͒ϩnoise ͑7͒…”
Section: Spatial Fringe Analysis Methods With Filter Processingmentioning
confidence: 99%
“…͑7͒, the quantity of noise in the image can be given as noise signal ratio ͑NSR͒. 22 I͑x,z ͒ϭa͑ x,z ͒ϩb͑ x,z ͒cos͓ cx ϩ͑x,z ͔͒ϩnoise ͑7͒…”
Section: Spatial Fringe Analysis Methods With Filter Processingmentioning
confidence: 99%
“…The Fourier counterpart of the AC method can be derived using the Fourier power theorem [21], which can be mathematically expressed as (6) where and are Fourier transforms of image domain functions and . If we define and and consider the Fourier shift theorem [21], we have (7) Therefore, the linear coefficient can be estimated as the angle of the centroid of an angular distribution of in k-space as follows: (8) where is the Fourier transform of the complex image .…”
Section: A Review Of the Ac Methodsmentioning
confidence: 99%
“…The phase correction and unwrapping methods developed in the past few years generally fall into two categories: path-following methods and minimum-norm methods [1]. Cut-line methods [2]- [4], disk growing method [5], region growing methods (including maximum [6] and minimum spanning tree methods [7]) and Flynn's minimum discontinuity approach [8] are all path-following methods, which are based on the idea of guiding the integration of the gradient map to avoid any error propagation [2]. Minimum-norm methods are used to minimize the cost function to achieve phase unwrapping [1].…”
Section: Introductionmentioning
confidence: 99%
“…Among the path-dependent methods, a solution is to select from among all possible paths by using amplitude [43] or phase gradient [44,45] information to increase confidence in the unwrapping path. A statistical approach for path selection using genetic algorithms have also been proposed recently [46].…”
Section: Spatial Approachmentioning
confidence: 99%