Equivalence of cost generators for minimum cost flow phase unwrapping

Kurzfassung

Phase unwrapping represents a crucial Step in processing phase data obtained with techniques such as synthetic aperture radar interferometry, speckle interferomtry, and magnetic resonance imaging. The so-called branch-cut approaches form an important class of phase unwrapping algorithms. In 1996, Costantini proposed to transform the problem of correctly placing branch cuts into a minimum cost flow problem [Proceedings of the Fringe ’96 Workshop (European Space Agency, Munich, 1996), pp. 261-272]. The critical point of this new approach is to generate cost functions that have to represent all the a priori knowledge necessary for phase unwrapping. Any function transforming a priori knowledge into a cost function is called a cost generator. Several types of algorithms ranging from heuristic approaches to generators based on probability-theory interpretations were suggested. A problem arising from the growing diversity of algorithms is to find a criterion for the equivalence of different cost generators. Two cost generators are equivalent if they produce cost functions with the same minimal flow for every residue configuration on every image with all possible a priori knowledge. Comparing the results of different cost generators on test scenes can show only their non-equivalence. We solve this problem by proving the following mathematical classification theorem: Two cost generators are equivalent if and only if one can be transformed into the other by multiplication by a fixed constant.