Pith. sign in

Learning Pairwise Relationship for Multi-object Detection in Crowded Scenes

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

As the post-processing step for object detection, non-maximum suppression (GreedyNMS) is widely used in most of the detectors for many years. It is efficient and accurate for sparse scenes, but suffers an inevitable trade-off between precision and recall in crowded scenes. To overcome this drawback, we propose a Pairwise-NMS to cure GreedyNMS. Specifically, a pairwise-relationship network that is based on deep learning is learned to predict if two overlapping proposal boxes contain two objects or zero/one object, which can handle multiple overlapping objects effectively. Through neatly coupling with GreedyNMS without losing efficiency, consistent improvements have been achieved in heavily occluded datasets including MOT15, TUD-Crossing and PETS. In addition, Pairwise-NMS can be integrated into any learning based detectors (Both of Faster-RCNN and DPM detectors are tested in this paper), thus building a bridge between GreedyNMS and end-to-end learning detectors.

fields

cs.CV 1

years

2019 1

verdicts

REJECT 1

representative citing papers

In defense of OSVOS

cs.CV · 2019-08-19 · reject · novelty 4.0

Auxiliary video losses help an under-trained OSVOS on DAVIS-2016, but the gains are small and the comparison setting is non-standard.

citing papers explorer

Showing 1 of 1 citing paper.

  • In defense of OSVOS cs.CV · 2019-08-19 · reject · none · ref 13 · internal anchor

    Auxiliary video losses help an under-trained OSVOS on DAVIS-2016, but the gains are small and the comparison setting is non-standard.