no code implementations • 10 Dec 2021 • Steffen Jung, Sebastian Ziegler, Amirhossein Kardoost, Margret Keuper
The Minimum Cost Multicut Problem (MP) is a popular way for obtaining a graph decomposition by optimizing binary edge labels over edge costs.
no code implementations • 16 May 2021 • Amirhossein Kardoost, Margret Keuper
The minimum cost lifted multicut approach has proven practically good performance in a wide range of applications such as image decomposition, mesh segmentation, multiple object tracking, and motion segmentation.
no code implementations • 18 Aug 2020 • Amirhossein Kardoost, Kalun Ho, Peter Ochs, Margret Keuper
We evaluate our method on the well-known motion segmentation datasets FBMS59 and DAVIS16.
no code implementations • 5 Oct 2019 • Amirhossein Kardoost, Sabine Müller, Joachim Weickert, Margret Keuper
Our simple method can provide competitive results compared to the costly CNN-based methods with parameter tuning.