Planar Ultrametric Rounding for Image Segmentation
Data Structures and Algorithms
2015-09-11 v3 Computational Geometry
Computer Vision and Pattern Recognition
Abstract
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.
Cite
@article{arxiv.1507.02407,
title = {Planar Ultrametric Rounding for Image Segmentation},
author = {Julian Yarkony and Charless C. Fowlkes},
journal= {arXiv preprint arXiv:1507.02407},
year = {2015}
}