资源论文Food-101 – Mining Discriminative Components with Random Forests

Food-101 – Mining Discriminative Components with Random Forests

2020-04-07 | |  61 |   38 |   0

Abstract

In this paper we address the problem of automatically rec- ognizing pictured dishes. To this end, we introduce a novel method to mine discriminative parts using Random Forests (rf), which allows us to mine for parts simultaneously for all classes and to share knowledge among them. To improve efficiency of mining and classification, we only consider patches that are aligned with image superpixels, which we call components. To measure the performance of our rf component mining for food recognition, we introduce a novel and challenging dataset of 101 food categories, with 101’000 images. With an average accuracy of 50.76%, our model outperforms alternative classification methods except for cnn, including svm classification on Improved Fisher Vectors and existing discriminative part-mining algorithms by 11.88% and 8.13%, re- spectively. On the challenging mit-Indoor dataset, our method compares nicely to other s-o-a component-based classification methods.

上一篇:A Pot of Gold: Rainbows as a Calibration Cue

下一篇:Monocular Multiview Ob ject Tracking with 3D Aspect Parts

用户评价
全部评价

热门资源

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