资源分类
》 资源 》论文》Planar Ultrametrics for Image Segmentation

Planar Ultrametrics for Image Segmentation

2020-02-05 | |  60 |   47 |   0

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.

上一篇：Unified View of Matrix Completion under General Structural Constraints

下一篇：V ISALOGY: Answering Visual Analogy Questions

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...