资源分类
》 资源 》论文》Total Variation and Cheeger Cuts

Total Variation and Cheeger Cuts

2020-02-26 | |  46 |   40 |   0

Abstract

In this work, inspired by (Bu?hler & Hein, 2009), (Strang, 1983), and (Zhang et al., 2009), we give a continuous relaxation of the Cheeger cut problem on a weighted graph. We show that the relaxation is actually equivalent to the original problem. We then describe an algorithm for finding good cuts suggested by the similarities of the energy of the relaxed problem and various well studied energies in image processing. Finally we provide experimental validation of the proposed algorithm, demonstrating its efficiency in finding high quality cuts.

上一篇：Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets

下一篇：Multi-Class Pegasos on a Budget

用户评价
全部评价

热门资源

  • 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...