International Journal of Engineering and Technology

Phase unwrapping (PU) is the process of recovering the absolute phase ? from the wrapped phase ? and it is key problem in interferometry SAR processing (INSAR) and Sonar (In SAS), MRI (medical imaging) & signal processing applications, etc. José's phase unwrapping via graph cut (PUMA) is one of the efficient algorithms which can solve different kinds of phase unwrapping problems successfully. However, computation speed and memory consumption often times limit the effective use of PUMA especially for large images / interferogram’s. To overcome this drawback and to reduce the complexity of the PUMA Algorithm, a new dynamic phase unwrapping algorithm (IPUMA) is proposed. In the proposed algorithm, instead of Boykov-Kolmogorov (BK) max flow solver, we use the incremental breadth-first search (IBFS) max-flow algorithm as an optimization step. By doing so, our algorithm I-PUMA outperforms PUMA with an speed increase of about 20-40% and the error norm is same. This proposed algorithm is described in detail and tested on simulated and real image (interferometry SAR data). Results show that the proposed algorithm works faster than the José's proposed phase unwrapping via graph cut (PUMA).