Learning Sampling Distributions for Efficient Object Detection
Yanwei Pang, Jiale Cao, and Xuelong Li

TL;DR
This paper introduces iPW, a rejection-oriented proposal distribution for object detection that improves sampling efficiency by reducing unnecessary window evaluations, outperforming previous methods like MPW.
Contribution
The paper proposes a novel rejection-oriented proposal distribution (iPW) for object detection, addressing MPW's limitations in stage and window number determination.
Findings
iPW reduces the number of windows evaluated compared to MPW.
Experimental results show improved detection efficiency and accuracy.
Source code is publicly available for reproducibility.
Abstract
Object detection is an important task in computer vision and learning systems. Multistage particle windows (MPW), proposed by Gualdi et al., is an algorithm of fast and accurate object detection. By sampling particle windows from a proposal distribution (PD), MPW avoids exhaustively scanning the image. Despite its success, it is unknown how to determine the number of stages and the number of particle windows in each stage. Moreover, it has to generate too many particle windows in the initialization step and it redraws unnecessary too many particle windows around object-like regions. In this paper, we attempt to solve the problems of MPW. An important fact we used is that there is large probability for a randomly generated particle window not to contain the object because the object is a sparse event relevant to the huge number of candidate windows. Therefore, we design the proposal…
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.
