Two-Dimensional Phase Unwrapping via Balanced Spanning Forests

DOI10.1287/ijoc.2018.0832OpenAlexW2944650626WikidataQ127910483 ScholiaQ127910483MaRDI QIDQ5139611

Thibaut Vidal, Ian Herszterg, Marcus Poggi

Publication date: 9 December 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.08277

zbMATH Keywords

combinatorial optimizationmetaheuristicsgraphsmathematical programmingsignal processingbranch-and-cutphase unwrapping

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Biomedical imaging and signal processing (92C55) Seismology (including tsunami modeling), earthquakes (86A15) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Information and communication theory, circuits (94-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• A dual ascent approach for steiner tree problems on a directed graph
• A new approach to the maximum-flow problem

This page was built for publication: Two-Dimensional Phase Unwrapping via Balanced Spanning Forests