资源分类
》 资源 》论文》Affinity Derivation and Graph Merge for Instance Segmentation

Affinity Derivation and Graph Merge for Instance Segmentation

2019-10-25 | |  81 |   41 |   0
Abstract. We present an instance segmentation scheme based on pixel affinity information, which is the relationship of two pixels belonging to the same instance. In our scheme, we use two neural networks with similar structures. One predicts the pixel level semantic score and the other is designed to derive pixel affinities. Regarding pixels as the vertexes and affinities as edges, we then propose a simple yet effective graph merge algorithm to cluster pixels into instances. Experiments show that our scheme generates fine grained instance masks. With Cityscape training data, the proposed scheme achieves 27.3 AP on test set

上一篇：HBE: Hand Branch Ensemble Network for Real-time 3D Hand Pose Estimation

下一篇：Beyond Part Models: Person Retrieval with Refined Part Pooling (and A Strong Convolutional Baseline)

用户评价
全部评价

热门资源

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