Timezone: »
Poster
Planar Ultrametrics for Image Segmentation
Julian E Yarkony · Charless Fowlkes
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
-
2009 Poster: Bilinear classifiers for visual recognition »
Hamed Pirsiavash · Deva Ramanan · Charless Fowlkes -
2009 Spotlight: Bilinear classifiers for visual recognition »
Hamed Pirsiavash · Deva Ramanan · Charless Fowlkes