NMS-Loss: Learning with Non-Maximum Suppression for Crowded Pedestrian Detection

• URL: http://arxiv.org/abs/2106.02426v1
• Date: Fri, 4 Jun 2021 12:06:46 GMT
• Title: NMS-Loss: Learning with Non-Maximum Suppression for Crowded Pedestrian Detection
• Authors: Zekun Luo, Zheng Fang, Sixiao Zheng, Yabiao Wang, Yanwei Fu
• Abstract summary: We propose a novel NMS-Loss making the NMS procedure can be trained end-to-end without any additional network parameters. Our NMS-Loss punishes two cases when FP is not suppressed and FN is wrongly eliminated by NMS. With the help of NMS-Loss, our detector, namely NMS-Ped, achieves impressive results with Miss Rate of 5.92% on Caltech dataset and 10.08% on CityPersons dataset.
• Score: 39.417540296897194
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Non-Maximum Suppression (NMS) is essential for object detection and affects the evaluation results by incorporating False Positives (FP) and False Negatives (FN), especially in crowd occlusion scenes. In this paper, we raise the problem of weak connection between the training targets and the evaluation metrics caused by NMS and propose a novel NMS-Loss making the NMS procedure can be trained end-to-end without any additional network parameters. Our NMS-Loss punishes two cases when FP is not suppressed and FN is wrongly eliminated by NMS. Specifically, we propose a pull loss to pull predictions with the same target close to each other, and a push loss to push predictions with different targets away from each other. Experimental results show that with the help of NMS-Loss, our detector, namely NMS-Ped, achieves impressive results with Miss Rate of 5.92% on Caltech dataset and 10.08% on CityPersons dataset, which are both better than state-of-the-art competitors.

Related papers

• Accelerating Non-Maximum Suppression: A Graph Theory Perspective [24.34791528442417]
  Non-maximum suppression (NMS) is an indispensable post-processing step in object detection. This paper systematically analyzes NMS from a graph theory perspective for the first time, revealing its intrinsic structure. We introduce NMS-Bench, the first benchmark designed to comprehensively assess various NMS methods.
  arXiv  Detail & Related papers  (2024-09-30T17:20:49Z)
• Fuzzy-NMS: Improving 3D Object Detection with Fuzzy Classification in NMS [19.452760776980472]
  Non-maximum suppression (NMS) is an essential post-processing module used in many 3D object detection frameworks. We introduce fuzzy learning into NMS and propose a novel generalized Fuzzy-NMS module to achieve finer candidate bounding box filtering.
  arXiv  Detail & Related papers  (2023-10-21T09:09:03Z)
• NP-Match: When Neural Processes meet Semi-Supervised Learning [133.009621275051]
  Semi-supervised learning (SSL) has been widely explored in recent years, and it is an effective way of leveraging unlabeled data to reduce the reliance on labeled data. In this work, we adjust neural processes (NPs) to the semi-supervised image classification task, resulting in a new method named NP-Match.
  arXiv  Detail & Related papers  (2022-07-03T15:24:31Z)
• Batch-Ensemble Stochastic Neural Networks for Out-of-Distribution Detection [55.028065567756066]
  Out-of-distribution (OOD) detection has recently received much attention from the machine learning community due to its importance in deploying machine learning models in real-world applications. In this paper we propose an uncertainty quantification approach by modelling the distribution of features. We incorporate an efficient ensemble mechanism, namely batch-ensemble, to construct the batch-ensemble neural networks (BE-SNNs) and overcome the feature collapse problem. We show that BE-SNNs yield superior performance on several OOD benchmarks, such as the Two-Moons dataset, the FashionMNIST vs MNIST dataset, FashionM
  arXiv  Detail & Related papers  (2022-06-26T16:00:22Z)
• Controlled Dropout for Uncertainty Estimation [11.225333867982359]
  Uncertainty in a neural network is one of the most discussed topics for safety-critical applications. We present a new version of the traditional dropout layer where we are able to fix the number of dropout configurations.
  arXiv  Detail & Related papers  (2022-05-06T09:48:11Z)
• Feature Erasing and Diffusion Network for Occluded Person Re-Identification [20.720999782234216]
  Occluded person re-identification aims at matching occluded person images to holistic ones across different camera views. Previous methods mainly focus on increasing model's robustness against NPO while ignoring feature contamination from NTP. We propose a novel Feature Erasing and Diffusion Network (FED) to simultaneously handle NPO and NTP.
  arXiv  Detail & Related papers  (2021-12-16T09:47:17Z)
• Meta-Mining Discriminative Samples for Kinship Verification [95.26341773545528]
  Kinship verification databases are born with unbalanced data. We propose a Discriminative Sample Meta-Mining (DSMM) approach in this paper. Experimental results on the widely used KinFaceW-I, KinFaceW-II, TSKinFace, and Cornell Kinship datasets demonstrate the effectiveness of the proposed approach.
  arXiv  Detail & Related papers  (2021-03-28T11:47:07Z)
• Object Detection Made Simpler by Eliminating Heuristic NMS [70.93004137521946]
  We show a simple NMS-free, end-to-end object detection framework. We attain on par or even improved detection accuracy compared with the original one-stage detector.
  arXiv  Detail & Related papers  (2021-01-28T02:38:29Z)
• End-to-End Object Detection with Fully Convolutional Network [71.56728221604158]
  We introduce a Prediction-aware One-To-One (POTO) label assignment for classification to enable end-to-end detection. A simple 3D Max Filtering (3DMF) is proposed to utilize the multi-scale features and improve the discriminability of convolutions in the local region. Our end-to-end framework achieves competitive performance against many state-of-the-art detectors with NMS on COCO and CrowdHuman datasets.
  arXiv  Detail & Related papers  (2020-12-07T09:14:55Z)
• Confluence: A Robust Non-IoU Alternative to Non-Maxima Suppression in Object Detection [0.570896453969985]
  Confluence is an algorithm which does not rely solely on individual confidence scores to select optimal bounding boxes. It is experimentally validated on RetinaNet, YOLOv3 and Mask-RCNN, using both the MS COCO and PASCAL VOC 2007 datasets. Confluence outperforms Greedy NMS in both mAP and recall on both datasets.
  arXiv  Detail & Related papers  (2020-12-01T04:22:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.