Unsupervised Discovery of Mid-Level Discriminative Patches
Saurabh Singh, Abhinav Gupta, Alexei A. Efros

TL;DR
This paper introduces an unsupervised method to discover discriminative image patches that serve as effective mid-level visual features, outperforming traditional methods in various tasks including scene classification.
Contribution
It proposes an iterative clustering and classifier training approach to identify discriminative patches without supervision, advancing mid-level visual representation techniques.
Findings
Discriminative patches outperform visual words in unsupervised tasks.
The method achieves state-of-the-art results on MIT Indoor-67.
Effective in both unsupervised and supervised visual recognition tasks.
Abstract
The goal of this paper is to discover a set of discriminative patches which can serve as a fully unsupervised mid-level visual representation. The desired patches need to satisfy two requirements: 1) to be representative, they need to occur frequently enough in the visual world; 2) to be discriminative, they need to be different enough from the rest of the visual world. The patches could correspond to parts, objects, "visual phrases", etc. but are not restricted to be any one of them. We pose this as an unsupervised discriminative clustering problem on a huge dataset of image patches. We use an iterative procedure which alternates between clustering and training discriminative classifiers, while applying careful cross-validation at each step to prevent overfitting. The paper experimentally demonstrates the effectiveness of discriminative patches as an unsupervised mid-level visual…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
