56 citations · 199 across the 40 of their papers we have counts for
4 papers · 1 filter
Symmetry-free SDP Relaxations for Affine Subspace Clustering
Francesco Silvestri, Gerhard Reinelt, Christoph Schnörr
We consider clustering problems where the goal is to determine an optimal partition of a given point set in Euclidean space in terms of a collection of affine subspaces. While ther…
Learning Arbitrary Sum-Product Network Leaves with Expectation-Maximization
Mattia Desana, Christoph Schnörr
Sum-Product Networks with complex probability distribution at the leaves have been shown to be powerful tractable-inference probabilistic models. However, while learning the intern…
Image Labeling by Assignment
Freddie Åström, Stefania Petra, Bernhard Schmitzer +1
We introduce a novel geometric approach to the image labeling problem. Abstracting from specific labeling applications, a general objective function is defined on a manifold of sto…
Multicuts and Perturb & MAP for Probabilistic Graph Clustering
Jörg Hendrik Kappes, Paul Swoboda, Bogdan Savchynskyy +2
We present a probabilistic graphical model formulation for the graph clustering problem. This enables to locally represent uncertainty of image partitions by approximate marginal d…