Density-Based Region Search with Arbitrary Shape for Object Localization
Ji Zhao, Deyu Meng, Jiayi Ma

TL;DR
This paper introduces LS-MWCS, a density-based region search method for object localization that effectively handles arbitrary shapes and avoids trivial solutions by focusing on score density rather than maximum score.
Contribution
The paper proposes a novel density-based region search algorithm, LS-MWCS, with theoretical guarantees and efficient optimization for improved object localization.
Findings
Outperforms state-of-the-art methods in weakly-supervised object localization
Effectively localizes objects with arbitrary shapes
Provides a flexible control over region density
Abstract
Region search is widely used for object localization. Typically, the region search methods project the score of a classifier into an image plane, and then search the region with the maximal score. The recently proposed region search methods, such as efficient subwindow search and efficient region search, %which localize objects from the score distribution on an image are much more efficient than sliding window search. However, for some classifiers and tasks, the projected scores are nearly all positive, and hence maximizing the score of a region results in localizing nearly the entire images as objects, which is meaningless. In this paper, we observe that the large scores are mainly concentrated on or around objects. Based on this observation, we propose a method, named level set maximum-weight connected subgraph (LS-MWCS), which localizes objects with arbitrary shapes by searching…
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.
