Fast Planar Correlation Clustering for Image Segmentation

08/02/2012
by   Julian Yarkony, et al.
0

We describe a new optimization scheme for finding high-quality correlation clusterings in planar graphs that uses weighted perfect matching as a subroutine. Our method provides lower-bounds on the energy of the optimal correlation clustering that are typically fast to compute and tight in practice. We demonstrate our algorithm on the problem of image segmentation where this approach outperforms existing global optimization techniques in minimizing the objective and is competitive with the state of the art in producing high-quality segmentations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2015

Planar Ultrametric Rounding for Image Segmentation

We study the problem of hierarchical clustering on planar graphs. We for...
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
01/03/2018

Circuit Complexity of Bounded Planar Cutwidth Graph Matching

Recently, perfect matching in bounded planar cutwidth bipartite graphs (...
research
02/15/2019

Massively Parallel Benders Decomposition for Correlation Clustering

We tackle the problem of graph partitioning for image segmentation using...
research
04/06/2011

Planar Cycle Covering Graphs

We describe a new variational lower-bound on the minimum energy configur...
research
12/01/2019

A SVBRDF Modeling Pipeline using Pixel Clustering

We present a pipeline for modeling spatially varying BRDFs (svBRDFs) of ...
research
02/14/2012

Tightening MRF Relaxations with Planar Subproblems

We describe a new technique for computing lower-bounds on the minimum en...

Please sign up or login with your details

Forgot password? Click here to reset