A Replacement Algorithm of Non-Maximum Suppression Base on Graph Clustering

  • Zhao X
  • Wang Y
  • Dou Y
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Non-maximum suppression is an important step in many object detection and object counting algorithms. In contrast with the extensive studies of object detection, NMS method has not caused too much attention. Although traditional NMS method has demonstrated promising performance in detection tasks, we observe that it is a hard decision approach, which only uses the confidential scores and Intersection-over-Unions (IoUs) to discard proposals. By this way, NMS method would keep many false proposals whose IoU with the ground truth proposal is smaller than the threshold, which indicates that NMS may not suitable for counting the object number in images. To eliminate the limitation on object counting task, we propose a novel algorithm base on graph clustering to replace the NMS method in this paper. Experiments on faster-rcnn and SSD show that our algorithm achieves better performance than that of NMS on the object counting task.

Cite

CITATION STYLE

APA

Zhao, X., Wang, Y.-Q., & Dou, Y. (2017). A Replacement Algorithm of Non-Maximum Suppression Base on Graph Clustering. ITM Web of Conferences, 12, 05006. https://doi.org/10.1051/itmconf/20171205006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free