# LEAPS: End-to-End One-Step Person Search With Learnable Proposals

arXiv: https://arxiv.org/abs/2303.11859 · HTML: https://mlsanity.com/paper/2303.11859/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 33 of its 40 references that are in the map.
- First posted on arXiv 21 Mar 2023.

## Builds on (most cited first, 30 of 33)

- [Deep Residual Learning for Image Recognition](https://mlsanity.com/paper/1512.03385/) (2015)
- [Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks](https://mlsanity.com/paper/1506.01497/) (2015)
- [ImageNet Large Scale Visual Recognition Challenge](https://mlsanity.com/paper/1409.0575/) (2014)
- [End-to-End Object Detection with Transformers](https://mlsanity.com/paper/2005.12872/) (2020)
- [Feature Pyramid Networks for Object Detection](https://mlsanity.com/paper/1612.03144/) (2016)
- [Deformable DETR: Deformable Transformers for End-to-End Object Detection](https://mlsanity.com/paper/2010.04159/) (2020)
- [FCOS: Fully Convolutional One-Stage Object Detection](https://mlsanity.com/paper/1904.01355/) (2019)
- [Deformable Convolutional Networks](https://mlsanity.com/paper/1703.06211/) (2017)
- [MMDetection: Open MMLab Detection Toolbox and Benchmark](https://mlsanity.com/paper/1906.07155/) (2019)
- [PVT v2: Improved Baselines with Pyramid Vision Transformer](https://mlsanity.com/paper/2106.13797/) (2021)
- [Sparse R-CNN: End-to-End Object Detection with Learnable Proposals](https://mlsanity.com/paper/2011.12450/) (2020)
- [Joint Detection and Identification Feature Learning for Person Search](https://mlsanity.com/paper/1604.01850/) (2016)
- [Person Re-identification in the Wild](https://mlsanity.com/paper/1604.02531/) (2016)
- [Diverse Part Discovery: Occluded Person Re-identification with Part-Aware Transformer](https://mlsanity.com/paper/2106.04095/) (2021)
- [High-Order Information Matters: Learning Relation and Topology for Occluded Person Re-Identification](https://mlsanity.com/paper/2003.08177/) (2020)
- [Learning Context Graph for Person Search](https://mlsanity.com/paper/1904.01830/) (2019)
- [Person Search via A Mask-Guided Two-Stream CNN Model](https://mlsanity.com/paper/1807.08107/) (2018)
- [Anchor-Free Person Search](https://mlsanity.com/paper/2103.11617/) (2021)
- [Re-ID Driven Localization Refinement for Person Search](https://mlsanity.com/paper/1909.08580/) (2019)
- [Query-guided End-to-End Person Search](https://mlsanity.com/paper/1905.01203/) (2019)
- [Sequential End-to-end Network for Efficient Person Search](https://mlsanity.com/paper/2103.10148/) (2021)
- [Person Search by Multi-Scale Matching](https://mlsanity.com/paper/1807.08582/) (2018)
- [Neural Person Search Machines](https://mlsanity.com/paper/1707.06777/) (2017)
- [Cascade Transformers for End-to-End Person Search](https://mlsanity.com/paper/2203.09642/) (2022)
- [Robust Partial Matching for Person Search in the Wild](https://mlsanity.com/paper/2004.09329/) (2020)
- [IAN: The Individual Aggregation Network for Person Search](https://mlsanity.com/paper/1705.05552/) (2017)
- [PSTR: End-to-End One-Step Person Search With Transformers](https://mlsanity.com/paper/2204.03340/) (2022)
- [Decoupled and Memory-Reinforced Networks: Towards Effective Feature Learning for One-Step Person Search](https://mlsanity.com/paper/2102.10795/) (2021)
- [Diverse Knowledge Distillation for End-to-End Person Search](https://mlsanity.com/paper/2012.11187/) (2020)
- [Exploring Visual Context for Weakly Supervised Person Search](https://mlsanity.com/paper/2106.10506/) (2021)

## Built on by (most cited first, 1 of 1)

- [Swap Path Network for Robust Person Search Pre-training](https://mlsanity.com/paper/2412.05433/) (2024)

## Abstract (arXiv)

We propose an end-to-end one-step person search approach with learnable proposals, named LEAPS. Given a set of sparse and learnable proposals, LEAPS employs a dynamic person search head to directly perform person detection and corresponding re-id feature generation without non-maximum suppression post-processing. The dynamic person search head comprises a detection head and a novel flexible re-id head. Our flexible re-id head first employs a dynamic region-of-interest (RoI) operation to extract discriminative RoI features of the proposals. Then, it generates re-id features using a plain and a hierarchical interaction re-id module. To better guide discriminative re-id feature learning, we introduce a diverse re-id sample matching strategy, instead of bipartite matching in detection head. Comprehensive experiments reveal the benefit of the proposed LEAPS, achieving a favorable performance on two public person search benchmarks: CUHK-SYSU and PRW. When using the same ResNet50 backbone, our LEAPS obtains a mAP score of 55.0%, outperforming the best reported results in literature by 1.7%, while achieving around a two-fold speedup on the challenging PRW dataset. Our source code and models will be released.