1998
DOI: 10.1016/s0143-8166(98)00054-2
|View full text |Cite
|
Sign up to set email alerts
|

The Tapestry Cellular Automata phase unwrapping algorithm for interferogram analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2002
2002
2013
2013

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…Segmentation, which divides the phase map into many small overlapped segments, has been developed to improve the computational efficiency for phase unwrapping [16,18]. Each segment is first unwrapped independently.…”
Section: Segmentation and Patchingmentioning
confidence: 99%
See 1 more Smart Citation
“…Segmentation, which divides the phase map into many small overlapped segments, has been developed to improve the computational efficiency for phase unwrapping [16,18]. Each segment is first unwrapped independently.…”
Section: Segmentation and Patchingmentioning
confidence: 99%
“…This method needs complex path design strategy in the presence of noise [5] and is not feasible for the measurement of the laterally discontinuous surface. The path-independent methods, including model- [6,7], Bayesian- [8], least-squares- [9], and integration-based [10][11][12][13][14][15][16][17][18], do not require a specially designed path for spatialbased phase unwrapping. However, none of these pathindependent methods can be directly applied to unwrap the phase of laterally discontinuous surfaces because of the narrow, curved regions and the discontinuity among regions.…”
Section: Introductionmentioning
confidence: 99%
“…The above three different types of noise easily cause the spatial phase unwrapping algorithms to fail. Generally speaking, the spatial phase unwrapping algorithms can be classified as path-dependent [13], path-independent [14][15][16], or miscellaneous [6,[17][18][19]. In most path-dependent algorithms, they quickly operate the unwrapping paths pixel by pixel and shift the wrapped phase by 2π when the unwrapping paths meet the difference between two neighboring pixels greater than π.…”
Section: Introductionmentioning
confidence: 99%