Search Results for author: Bjoern Andres

Found 28 papers, 5 papers with code

A Polyhedral Study of Lifted Multicuts

no code implementations16 Feb 2022 Bjoern Andres, Silvia Di Gregorio, Jannik Irmai, Jan-Hendrik Lange

Recently, a lifting of multicuts from a graph $G = (V, E)$ to an augmented graph $\hat G = (V, E \cup F)$ has been proposed in the field of image analysis, with the goal of obtaining a more expressive characterization of graph decompositions in which it is made explicit also for pairs $F \subseteq \tbinom{V}{2} \setminus E$ of non-neighboring nodes whether these are in the same or distinct components.

Inapproximability of Minimizing a Pair of DNFs or Binary Decision Trees Defining a Partial Boolean Function

no code implementations9 Feb 2021 David Stein, Bjoern Andres

The desire to apply machine learning techniques in safety-critical environments has renewed interest in the learning of partial functions for distinguishing between positive, negative and unclear observations.

End-to-end Learning for Graph Decomposition

no code implementations ICCV 2019 Jie Song, Bjoern Andres, Michael Black, Otmar Hilliges, Siyu Tang

The new optimization problem can be viewed as a Conditional Random Field (CRF) in which the random variables are associated with the binary edge labels of the initial graph and the hard constraints are introduced in the CRF as high-order potentials.

Multi-Person Pose Estimation

Analysis and Optimization of Graph Decompositions by Lifted Multicuts

no code implementations ICML 2017 Andrea Horňáková, Jan-Hendrik Lange, Bjoern Andres

We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts.

Multiple People Tracking by Lifted Multicut and Person Re-Identification

no code implementations CVPR 2017 Siyu Tang, Mykhaylo Andriluka, Bjoern Andres, Bernt Schiele

This allows us to reward tracks that assign detections of similar appearance to the same person in a way that does not introduce implausible solutions.

Multiple People Tracking Person Re-Identification +1

Efficient Algorithms for Moral Lineage Tracing

no code implementations ICCV 2017 Markus Rempfler, Jan-Hendrik Lange, Florian Jug, Corinna Blasse, Eugene W. Myers, Bjoern H. Menze, Bjoern Andres

Lineage tracing, the joint segmentation and tracking of living cells as they move and divide in a sequence of light microscopy images, is a challenging task.

A Message Passing Algorithm for the Minimum Cost Multicut Problem

no code implementations CVPR 2017 Paul Swoboda, Bjoern Andres

We propose a dual decomposition and linear program relaxation of the NP -hard minimum cost multicut problem.

Joint Graph Decomposition and Node Labeling: Problem, Algorithms, Applications

1 code implementation14 Nov 2016 Evgeny Levinkov, Jonas Uhrig, Siyu Tang, Mohamed Omran, Eldar Insafutdinov, Alexander Kirillov, Carsten Rother, Thomas Brox, Bernt Schiele, Bjoern Andres

In order to find feasible solutions efficiently, we define two local search algorithms that converge monotonously to a local optimum, offering a feasible solution at any time.

Combinatorial Optimization Multiple Object Tracking +2

Multi-Person Tracking by Multicut and Deep Matching

no code implementations17 Aug 2016 Siyu Tang, Bjoern Andres, Mykhaylo Andriluka, Bernt Schiele

In [1], we proposed a graph-based formulation that links and clusters person hypotheses over time by solving a minimum cost subgraph multicut problem.

A Multi-cut Formulation for Joint Segmentation and Tracking of Multiple Objects

no code implementations21 Jul 2016 Margret Keuper, Siyu Tang, Yu Zhongjie, Bjoern Andres, Thomas Brox, Bernt Schiele

Recently, Minimum Cost Multicut Formulations have been proposed and proven to be successful in both motion trajectory segmentation and multi-target tracking scenarios.

Motion Segmentation Object Detection

The Minimum Cost Connected Subgraph Problem in Medical Image Analysis

no code implementations20 Jun 2016 Markus Rempfler, Bjoern Andres, Bjoern H. Menze

Several important tasks in medical image analysis can be stated in the form of an optimization problem whose feasible solutions are connected subgraphs.

Convexification of Learning from Constraints

no code implementations22 Feb 2016 Iaroslav Shcherbatyi, Bjoern Andres

For common loss and regularization functions, this optimization problem assumes the form of a mixed integer program (MIP) whose objective function is non-convex.

Moral Lineage Tracing

no code implementations CVPR 2016 Florian Jug, Evgeny Levinkov, Corinna Blasse, Eugene W. Myers, Bjoern Andres

We propose an integer linear program (ILP) whose feasible solutions define a decomposition of each image in a sequence into cells (segmentation), and a lineage forest of cells across images (tracing).


Convexity Shape Constraints for Image Segmentation

no code implementations CVPR 2016 Loic A. Royer, David L. Richmond, Carsten Rother, Bjoern Andres, Dagmar Kainmueller

Incorporating such prior knowledge into models and algorithms for image segmentation is highly desirable, yet can be non-trivial.

Semantic Segmentation

Subgraph Decomposition for Multi-Target Tracking

no code implementations CVPR 2015 Siyu Tang, Bjoern Andres, Miykhaylo Andriluka, Bernt Schiele

Tracking multiple targets in a video, based on a finite set of detection hypotheses, is a persistent problem in computer vision.


Estimating Maximally Probable Constrained Relations by Mathematical Programming

no code implementations4 Aug 2014 Lizhen Qu, Bjoern Andres

Estimating (learning) a maximally probable measure, given (a training set of) related and unrelated pairs, is a convex optimization problem.

General Classification Multi-Label Classification

A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems

no code implementations2 Apr 2014 Jörg H. Kappes, Bjoern Andres, Fred A. Hamprecht, Christoph Schnörr, Sebastian Nowozin, Dhruv Batra, Sungwoong Kim, Bernhard X. Kausler, Thorben Kröger, Jan Lellmann, Nikos Komodakis, Bogdan Savchynskyy, Carsten Rother

However, on new and challenging types of models our findings disagree and suggest that polyhedral methods and integer programming solvers are competitive in terms of runtime and solution quality over a large range of model types.

Reconstructing Loopy Curvilinear Structures Using Integer Programming

no code implementations CVPR 2013 Engin Turetken, Fethallah Benmansour, Bjoern Andres, Hanspeter Pfister, Pascal Fua

We propose a novel approach to automated delineation of linear structures that form complex and potentially loopy networks.

OpenGM: A C++ Library for Discrete Graphical Models

4 code implementations1 Jun 2012 Bjoern Andres, Thorsten Beier, Joerg H. Kappes

OpenGM is a C++ template library for defining discrete graphical models and performing inference on these models, using a wide range of state-of-the-art algorithms.

Cannot find the paper you are looking for? You can Submit a new open access paper.