Fig. 1. Diagrammatic sketch of FTP system

Fig. 2. Diagrammatic sketch of improved Goldstein branch-cut algorithm, the numbers represent weights of edges. (a) Example of weighted bipartite graph; (b) example of perfect matching

Fig. 3. Measured object, deformed fringe pattern, and wrapped phase map. (a) Measured object; (b) deformed fringe pattern; (c) wrapped phase map

Fig. 4. Distribution of residues and branch-cuts. (a) Residues distribution; (b) branch-cuts obtained by Goldstein branch-cut algorithm; (c) branch-cuts obtained by proposed algorithm

Fig. 5. Contrast results. (a) Reconstructed result obtained by flood-fill algorithm; (b) reconstructed result obtained by Goldstein branch-cut algorithm; (c) reconstructed result obtained by proposed algorithm

Fig. 6. Setup of the experiment

Fig. 7. Fringe patterns. (a) Reference fringe pattern; (b) deformed fringe pattern

Fig. 8. Wrapped phase map and reconstructed result obtained by flood-fill algorithm. (a) Wrapped phase map; (b) reconstructed result

Fig. 9. Distribution of residues and branch-cuts. (a) Residues distribution; (b) branch-cuts obtained by Goldstein branch-cut algorithm; (c) branch-cuts obtained by proposed algorithm

Fig. 10. Contrast results. (a) Reconstructed result obtained by Goldstein branch-cut algorithm; (b) reconstructed result obtained by proposed algorithm

Fig. 11. Reconstruction experiment of donkey face model. (a) Donkey face model; (b) deformed fringe pattern; (c) wrapped phase map; (d) branch-cuts obtained by Goldstein branch-cut algorithm; (e) branch-cuts obtained by proposed algorithm; (f) reconstructed result obtained by flood-fill algorithm; (g) reconstructed result obtained by Goldstein branch-cut algorithm; (h) reconstructed result obtained by proposed algorithm

Fig. 12. Reconstruction experiment results of bear. (a) Deformed fringe pattern; (b) wrapped phase map; (c) branch-cuts obtained by Goldstein branch-cut algorithm; (d) branch-cuts obtained by proposed algorithm; (e) reconstructed result obtained by Goldstein branch-cut algorithm; (f) reconstructed result obtained by proposed algorithm

Table 1. Comparison of RMSE, length of branch-cuts, and time for the various algorithms

Table 2. RMSE of Goldstein branch-cut algorithm and proposed algorithm under different noises