Planar Ultrametric Rounding for Image Segmentation

07/09/2015
by   Julian Yarkony, et al.
0

We study the problem of hierarchical clustering on planar graphs. We formulate this in terms of an LP relaxation of ultrametric rounding. To solve this LP efficiently we introduce a dual cutting plane scheme that uses minimum cost perfect matching as a subroutine in order to efficiently explore the space of planar partitions. We apply our algorithm to the problem of hierarchical image segmentation.

READ FULL TEXT

page 8

page 9

page 15

research
09/22/2017

Planar Perfect Matching is in NC

In this paper we show that the problem of computing perfect matchings in...
research
08/02/2012

Fast Planar Correlation Clustering for Image Segmentation

We describe a new optimization scheme for finding high-quality correlati...
research
09/02/2023

Cops and Robbers on 1-Planar Graphs

Cops and Robbers is a well-studied pursuit-evasion game in which a set o...
research
07/10/2021

Hitting Weighted Even Cycles in Planar Graphs

A classical branch of graph algorithms is graph transversals, where one ...
research
09/22/2017

Planar Graph Perfect Matching is in NC

Is perfect matching in NC? That is, is there a deterministic fast parall...
research
08/21/2022

Counting Cycles on Planar Graphs in Subexponential Time

We study the problem of counting all cycles or self-avoiding walks (SAWs...
research
07/30/2018

A Restricted-Domain Dual Formulation for Two-Phase Image Segmentation

In two-phase image segmentation, convex relaxation has allowed global mi...

Please sign up or login with your details

Forgot password? Click here to reset