Name
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. |
Year | Venue | DocType |
|---|---|---|
2015 | CoRR | Journal |
Volume | Citations | PageRank |
abs/1507.02407 | 0 | 0.34 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julian Yarkony | 1 | 76 | 9.20 |
| Charless C Fowlkes | 2 | 7294 | 384.48 |