Paper Info
Title
Planar Ultrametrics for Image Segmentation
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.
Year
Venue
DocType
2015
Annual Conference on Neural Information Processing Systems
Conference
Volume
ISSN
Citations 
28
1049-5258
6
PageRank 
References 
Authors
0.47
10
2
Name
Order
Citations
PageRank
Julian Yarkony1769.20
Charless C Fowlkes27294384.48