Fast, automated, N-dimensional phase-unwrapping algorithm.
This work investigates the general problem of phase unwrapping for arbitrary N-dimensional phase maps. A cost function-based approach is outlined that leads to an integer programming problem. To solve this problem, a best-pair-first region merging approach is adopted as the optimization method. The...
| Autor principal: | |
|---|---|
| Format: | Journal article |
| Idioma: | English |
| Publicat: |
2003
|