Planar Ultrametrics for Image Segmentation
Julian E Yarkony ⋅ Charless Fowlkes
2015 Poster
Abstract
We study the problem of hierarchical clustering on planar graphs. We formulate this in terms of finding the closest ultrametric to a specified set of distances and solve it using an LP relaxation that leverages minimum cost perfect matching as a subroutine to efficiently explore the space of planar partitions. We apply our algorithm to the problem of hierarchical image segmentation.
Chat is not available.
Successful Page Load