Related papers: Mean Height Aided Post-Processing for Pedestrian Detection

Mean Height Aided Post-Processing for Pedestrian Detection

URL: http://arxiv.org/abs/2408.13646v1
Date: Sat, 24 Aug 2024 18:20:47 GMT
Title: Mean Height Aided Post-Processing for Pedestrian Detection
Authors: Jing Yuan, Tania Stathaki, Guangyu Ren,
Abstract summary: We take the perspective effect in pedestrian datasets as an example and propose the mean height aided suppression for post-processing. The proposed method is easy to implement and is plug-and-play. The combination of mean height aided suppression with particular detectors outperforms state-of-the-art pedestrian detectors on Caltech and Citypersons datasets.
Score: 9.654938705603312
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: The design of pedestrian detectors seldom considers the unique characteristics of this task and usually follows the common strategies for general object detection. To explore the potential of these characteristics, we take the perspective effect in pedestrian datasets as an example and propose the mean height aided suppression for post-processing. This method rejects predictions that fall at levels with a low possibility of containing any pedestrians or that have an abnormal height compared to the average. To achieve this, the existence score and mean height generators are proposed. Comprehensive experiments on various datasets and detectors are performed; the choice of hyper-parameters is discussed in depth. The proposed method is easy to implement and is plug-and-play. Results show that the proposed methods significantly improve detection accuracy when applied to different existing pedestrian detectors and datasets. The combination of mean height aided suppression with particular detectors outperforms state-of-the-art pedestrian detectors on Caltech and Citypersons datasets.

Related papers

Imagine the Unseen: Occluded Pedestrian Detection via Adversarial Feature Completion [31.488897675973657]
We propose to complete features for occluded regions so as to align the features of pedestrians across different occlusion patterns. In order to narrow down the gap between completed features and real fully visible ones, we propose an adversarial learning method. We report experimental results on the CityPersons, Caltech and CrowdHuman datasets.
arXiv Detail & Related papers (2024-05-02T14:20:20Z)
Transcending Forgery Specificity with Latent Space Augmentation for Generalizable Deepfake Detection [57.646582245834324]
We propose a simple yet effective deepfake detector called LSDA. It is based on a idea: representations with a wider variety of forgeries should be able to learn a more generalizable decision boundary. We show that our proposed method is surprisingly effective and transcends state-of-the-art detectors across several widely used benchmarks.
arXiv Detail & Related papers (2023-11-19T09:41:10Z)
On the Universal Adversarial Perturbations for Efficient Data-free Adversarial Detection [55.73320979733527]
We propose a data-agnostic adversarial detection framework, which induces different responses between normal and adversarial samples to UAPs. Experimental results show that our method achieves competitive detection performance on various text classification tasks.
arXiv Detail & Related papers (2023-06-27T02:54:07Z)
An Objective Method for Pedestrian Occlusion Level Classification [6.125017875330933]
Occlusion level classification is achieved through the identification of visible pedestrian keypoints and through the use of a novel, effective method of 2D body surface area estimation. Experimental results demonstrate that the proposed method reflects the pixel-wise. occlusion level of pedestrians in images and is effective for all forms of. occlusion, including challenging edge cases such as self-occlusion, truncation. and inter-occluding pedestrians.
arXiv Detail & Related papers (2022-05-11T11:27:41Z)
The Impact of Partial Occlusion on Pedestrian Detectability [5.606792370296115]
This research introduces a novel, objective benchmark for partially occluded pedestrian detection. It is used to facilitate the objective characterization of pedestrian detection models.
arXiv Detail & Related papers (2022-05-10T11:21:18Z)
Pedestrian Detection: Domain Generalization, CNNs, Transformers and Beyond [82.37430109152383]
We show that, current pedestrian detectors poorly handle even small domain shifts in cross-dataset evaluation. We attribute the limited generalization to two main factors, the method and the current sources of data. We propose a progressive fine-tuning strategy which improves generalization.
arXiv Detail & Related papers (2022-01-10T06:00:26Z)
From Handcrafted to Deep Features for Pedestrian Detection: A Survey [148.35460817092908]
Pedestrian detection is an important but challenging problem in computer vision. Over the past decade, significant improvement has been witnessed with the help of handcrafted features and deep features. In addition to single-spectral pedestrian detection, we also review multi-spectral pedestrian detection.
arXiv Detail & Related papers (2020-10-01T14:51:10Z)
Generalizable Pedestrian Detection: The Elephant In The Room [82.37430109152383]
We find that existing state-of-the-art pedestrian detectors, though perform quite well when trained and tested on the same dataset, generalize poorly in cross dataset evaluation. We illustrate that diverse and dense datasets, collected by crawling the web, serve to be an efficient source of pre-training for pedestrian detection.
arXiv Detail & Related papers (2020-03-19T14:14:52Z)
EHSOD: CAM-Guided End-to-end Hybrid-Supervised Object Detection with Cascade Refinement [53.69674636044927]
We present EHSOD, an end-to-end hybrid-supervised object detection system. It can be trained in one shot on both fully and weakly-annotated data. It achieves comparable results on multiple object detection benchmarks with only 30% fully-annotated data.
arXiv Detail & Related papers (2020-02-18T08:04:58Z)

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