Unwrapping noisy phase maps by use of a minimum-cost-matching algorithm
Authors:
- 10 August 1995
- journal article
- Published by Optica Publishing Group in Applied Optics
- Vol. 34 (23) , 5100-5108
Abstract
An algorithm for unwrapping noisy phase maps by means of branch cuts has been proposed recently. These cuts join discontinuity sources that mark the beginning or end of a 2π phase discontinuity. After the placement of branch cuts, the unwrapped phase map is unique and independent of the unwrapping route. We show how a minimum-cost-matching graph-theory method can be used to find the set of cuts that has the global minimum of total cut length, in time approximately proportional to the square of the number of sources. The method enables one to unwrap unfiltered speckle-interferometry phase maps at higher source densities (0.1 sources pixel−1) than any previous branch-cut placement algorithm.Keywords
This publication has 5 references indexed in Scilit:
- Improved noise-immune phase-unwrapping algorithmApplied Optics, 1995
- Large mirror testing facility at the National Optical Astronomy ObservatoriesOptical Engineering, 1991
- Noise-immune phase unwrapping algorithmApplied Optics, 1989
- Satellite radar interferometry: Two‐dimensional phase unwrappingRadio Science, 1988
- Automatic fringe pattern analysis: A reviewOptics and Lasers in Engineering, 1986