Parallel Branch-Cut Algorithm Based on Simulated Annealing for Large-Scale Phase Unwrapping

Two-dimensional phase unwrapping is a key step in the phase extraction process, an image-processing stage that is common to many different systems. Many varied approaches have been proposed over the past several decades. However, with the growth of image scale, it poses new challenges in terms of computational and memory requirements to phase unwrapping that require a global approach to obtain good results. Owing to only a single process used in most previous algorithm implementations, it becomes more problematic to unwrapping when the required computing resources exceed the capability of one computer. Meanwhile, with the development and application of supercomputer techniques, high-performance computing is emerging as a promising platform for scientific applications. In this paper, a novel hybrid multiprocessing and multithreading algorithm is proposed in order to overcome the problem of unwrapping large data sets. In this algorithm, we improve on Goldstein´s branch-cut algorithm using simulated annealing idea to further optimize the set of branch cuts in parallel. For large data sets, the tiling strategy based on the nature of parallel computing guarantees the globality of phase unwrapping and avoids large-scale errors introduced. Using real and simulated interferometric data, we demonstrate that our algorithms are highly competitive with other existing algorithms in speed and accuracy. We also demonstrate that the proposed algorithm can be efficiently parallelized and performed across nodes in a high-performance computing cluster.