MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

SAR Phase Unwrapping by Undirected Shortest Transshipment

Paul Manderscheid
Fachrichtung Informatik - Saarbrücken
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI  
AG Audience
English

Date, Time and Location

Thursday, 5 April 2018
13:00
30 Minutes
E1 4
024
Saarbrücken

Abstract

The thesis is about the problem of phase unwrapping, where terrain topography is reconstructed from ambiguous phase values. It is shown how to transform the phase unwrapping problem into a minimum cost flow problem. Moreover, for two recent minimum cost flow algorithms and their different variants an experimental evaluation is given. One of these algorithms, the Dual Ascent algorithm, returns the optimal solution and uses spanning trees, while the other one uses a gradient descent method and returns an approximate solution.

Contact

Yun Kuen Cheung
--email hidden
passcode not visible
logged in users only

Yun Kuen Cheung, 04/04/2018 08:44 -- Created document.