Timezone: »

Planar Ultrametrics for Image Segmentation
Julian E Yarkony · Charless Fowlkes

Tue Dec 08 04:00 PM -- 08:59 PM (PST) @ 210 C #44 #None

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.

Author Information

Julian E Yarkony (Experian Data Lab)
Charless Fowlkes (UC Irvine)

More from the Same Authors