Planar Ultrametrics for Image Segmentation Planar Ultrametrics for Image Segmentation
Paper summary The paper presents a method to obtain a hierarchical clustering of a planar graph by posing the problem as that of approximating a set of edge weights using an ultrametric. This is accomplished by minimizing the $\ell_2$ norm between the given edge weights and the learnt ultrametric. Learning the ultrametric amounts to estimating a collection of multicuts that satisfies a hierarchical partitioning constraint. An efficient algorithm is presented that solves an approximation based on a finding a linear combination of a subset of possible two-way cuts of the graph.

Summary by NIPS Conference Reviews 5 years ago
Your comment: allows researchers to publish paper summaries that are voted on and ranked!

Sponsored by: and