资源分类
》 资源 》论文》Complexity-Adaptive Distance Metric for Object Proposals Generation

Complexity-Adaptive Distance Metric for Object Proposals Generation

2019-12-17 | |  68 |   46 |   0

Abstract

Distance metric plays a key role in grouping superpixels to produce object proposals for object detection. We observe that existing distance metrics work primarily for low complexity cases. In this paper, we develop a novel distance metric for grouping two superpixels in high-complexity scenarios. Combining them, a complexity-adaptive distance measure is produced that achieves improved grouping in different levels of complexity. Our extensive experimentation shows that our method can achieve good results in the PASCAL VOC 2012 dataset surpassing the latest state-ofthe-art methods.

上一篇：DevNet: A Deep Event Network for Multimedia Event Detection and Evidence Recounting

下一篇：Subgraph Matching using Compactness Prior for Robust Feature Correspondence

用户评价
全部评价

热门资源

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