Mining Discriminative Triplets of Patches for Fine-Grained Classification
2016pp. 1163–1172
Citations Over TimeTop 10% of 2016 papers
Abstract
Fine-grained classification involves distinguishing between similar sub-categories based on subtle differences in highly localized regions, therefore, accurate localization of discriminative regions remains a major challenge. We describe a patch-based framework to address this problem. We introduce triplets of patches with geometric constraints to improve the accuracy of patch localization, and automatically mine discriminative geometrically-constrained triplets for classification. The resulting approach only requires object bounding boxes. Its effectiveness is demonstrated using four publicly available fine-grained datasets, on which it outperforms or achieves comparable performance to the state-of-the-art in classification.
Related Papers
- → Syncretic-NMS: A Merging Non-Maximum Suppression Algorithm for Instance Segmentation(2020)30 cited
- → Medical Image Segmentation with Imperfect 3D Bounding Boxes(2021)1 cited
- → Bounding-box Centralization for Improving SiamFC++(2021)1 cited
- A Method to Generate the Minimum Bounding Boxes for Shape-Arbitrary Objects(2010)