Stable-marriages algorithm for preprocessing phase maps with discontinuity sources

Area of Science:

• Computer Vision
• Image Processing
• Computational Geometry

Background:

• Phase maps often contain discontinuities that complicate analysis and interpretation.
• Existing methods for handling phase map discontinuities can be computationally intensive or lack robustness.

Purpose of the Study:

• To introduce a new, efficient algorithm for addressing discontinuity sources in phase maps.
• To develop a method based on the stable-marriages algorithm for robust phase unwrapping.

Main Methods:

• The proposed algorithm employs a recursive procedure inspired by the stable-marriages algorithm.
• It connects discontinuity sources of opposite signs using a set of cut lines.
• These cut lines satisfy a stability criterion and minimize the total cut length within stable sets.

Main Results:

• The algorithm successfully identifies and connects discontinuity sources in phase maps.
• Experimental results demonstrate the algorithm's efficiency and ease of implementation.
• The technique provides a stable and minimal-length connection of phase discontinuities.

Conclusions:

• The developed algorithm offers an effective solution for phase map discontinuity problems.
• Its foundation in the stable-marriages algorithm ensures stability and minimal cut length.
• The method is computationally efficient and practical for real-world applications.