资源论文Hierarchical Feature Hashing for Fast Dimensionality Reduction

Hierarchical Feature Hashing for Fast Dimensionality Reduction

2019-12-12 | |  84 |   45 |   0

Abstract

Curse of dimensionality is a practical and challengingproblem in image categorization, especially in cases witha large number of classes. Multi-class classification en-counters severe computational and storage problems whendealing with these large scale tasks. In this paper, we propose hierarchical feature hashing to effectively reduce dimensionality of parameter space without sacrificing classification accuracy, and at the same time exploit informationin semantic taxonomy among categories. We provide detailed theoretical analysis on our proposed hashing method. Moreover, experimental results on object recognition and scene classification further demonstrate the effectiveness of hierarchical feature hashing.

上一篇:BING: Binarized Normed Gradients for Objectness Estimation at 300fps

下一篇:Salient Region Detection via High-Dimensional Color Transform

用户评价
全部评价

热门资源

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

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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