| Foreword |
|
ix | (2) |
| Preface |
|
xi | |
|
1 Introduction to Phase Unwrapping |
|
|
1 | (30) |
|
1.1 The Importance of Phase |
|
|
1 | (3) |
|
1.2 The Need for Phase Unwrapping |
|
|
4 | (12) |
|
1.3 Aspects of One-Dimensional Phase Unwrapping |
|
|
16 | (10) |
|
1.4 Summary and Brief Look Ahead |
|
|
26 | (2) |
|
|
|
28 | (3) |
|
2 Line Integrals, Residues, and 2-D Phase Unwrapping |
|
|
31 | (28) |
|
|
|
31 | (1) |
|
2.2 Differential Forms and Conditions for Path Independence |
|
|
32 | (7) |
|
2.3 Theory of Residues and Applications to Phase Unwrapping |
|
|
39 | (4) |
|
2.4 Phase Decomposition into "Irrotational" and "Rotational" Components |
|
|
43 | (1) |
|
2.5 Discrete Formulation of Two-Dimensional Phase Unwrapping |
|
|
44 | (2) |
|
2.6 Simple Tests for Path Dependence |
|
|
46 | (4) |
|
2.7 Residues, Gradients, and Phase Decomposition: Examples |
|
|
50 | (4) |
|
|
|
54 | (3) |
|
|
|
57 | (2) |
|
3 Phase Data, Quality Maps, Masks, and Filters |
|
|
59 | (41) |
|
|
|
59 | (1) |
|
|
|
59 | (11) |
|
|
|
70 | (12) |
|
|
|
82 | (8) |
|
|
|
90 | (7) |
|
3.6 Summary and Conclusion |
|
|
97 | (1) |
|
|
|
98 | (2) |
|
|
|
100 | (78) |
|
|
|
100 | (3) |
|
4.2 Goldstein's Branch Cut Algorithm |
|
|
103 | (19) |
|
4.3 Quality-Guided Path Following |
|
|
122 | (14) |
|
|
|
136 | (15) |
|
4.5 Flynn's Minimum Discontinuity Approach |
|
|
151 | (21) |
|
4.6 Summary and Conclusion |
|
|
172 | (4) |
|
|
|
176 | (2) |
|
|
|
178 | (101) |
|
|
|
178 | (3) |
|
5.2 Minimum L(p)-Norm Formulation |
|
|
181 | (7) |
|
5.3 Unweighted Least-Squares Phase Unwrapping |
|
|
188 | (27) |
|
5.4 Weighted Least-Squares Phase Unwrapping |
|
|
215 | (33) |
|
5.5 Minimum L(p)-Norm Phase Unwrapping |
|
|
248 | (25) |
|
5.6 Summary and Conclusion |
|
|
273 | (4) |
|
|
|
277 | (2) |
|
6 Comparisons and Conclusion |
|
|
279 | (32) |
|
6.1 Comparisons of Phase Unwrapping Algorithms |
|
|
280 | (8) |
|
6.2 Links Between Path-Following and Minimum-Norm Algorithms |
|
|
288 | (5) |
|
|
|
293 | (13) |
|
|
|
306 | (2) |
|
|
|
308 | (1) |
|
|
|
309 | (2) |
| Appendix A Software |
|
311 | (157) |
| A.1 General-Purpose Utilities |
|
314 | (11) |
| A.2 Derivatives and Residues |
|
325 | (15) |
| A.3 Quality Maps, Masks, and Weights |
|
340 | (20) |
| A.4 Least Squares, Laplacians, and Congruence |
|
360 | (12) |
| A.5 Visualization and Evaluation |
|
372 | (8) |
| A.6 Goldstein's Algorithm |
|
380 | (7) |
| A.7 Quality-Guided Algorithm |
|
387 | (8) |
| A.8 Mask Cut Algorithm |
|
395 | (8) |
| A.9 Flynn's Minimum Discontinuity Algorithm |
|
403 | (15) |
| A.10 Unweighted Least-Squares Algorithms |
|
418 | (18) |
| A.11 PCG Algorithm |
|
436 | (11) |
| A.12 Weighted Multigrid Algorithm |
|
447 | (10) |
| A.13 L(p)-Norm Algorithm |
|
457 | (11) |
| Appendix B Software Index |
|
468 | (6) |
| Appendix C Software ftp Download |
|
474 | (1) |
| Index |
|
475 | |