Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Learning Pairwise Relationship for Multi-object Detection in Crowded Scenes (1901.03796v1)

Published 12 Jan 2019 in cs.CV

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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Yu Liu (787 papers)
  2. Lingqiao Liu (114 papers)
  3. Hamid Rezatofighi (61 papers)
  4. Thanh-Toan Do (92 papers)
  5. Qinfeng Shi (42 papers)
  6. Ian Reid (174 papers)
Citations (11)

Summary

We haven't generated a summary for this paper yet.