资源论文KL Divergence based Agglomerative Clustering for Automated Vitiligo Grading

KL Divergence based Agglomerative Clustering for Automated Vitiligo Grading

2019-12-17 | |  78 |   43 |   0

Abstract

In this paper we present a symmetric KL divergence based agglomerative clustering framework to segment multiple levels of depigmentation in Vitiligo images. The proposed framework starts with a simple merge cost based on symmetric KL divergence. We extend the recent body of work related to Bregman divergence based agglomerative clustering and prove that the symmetric KL divergence is an upper-bound for uni-modal Gaussian distributions. This leads to a very powerful yet elegant method for bottomup agglomerative clustering with strong theoretical guarantees. We introduce albedo and reflflectance fifields as features for the distance computations. We compare against other established methods to bring out possible pros and cons of the proposed method.

上一篇:Small Instance Detection by Integer Programming on Object Density Maps

下一篇:Pairwise Geometric Matching for Large-scale Object Retrieval

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...