Robust Partial Matching for Person Search in the Wild
- URL: http://arxiv.org/abs/2004.09329v1
- Date: Mon, 20 Apr 2020 14:21:03 GMT
- Title: Robust Partial Matching for Person Search in the Wild
- Authors: Yingji Zhong, Xiaoyu Wang, Shiliang Zhang
- Abstract summary: This paper proposes an Align-to-Part Network (APNet) for person detection and re-Identification (reID)
APNet refines detected bounding boxes to cover the estimated holistic body regions.
It achieves competitive performance on existing person search benchmarks like CUHK-SYSU and PRW.
- Score: 70.6661871706788
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Various factors like occlusions, backgrounds, etc., would lead to misaligned
detected bounding boxes , e.g., ones covering only portions of human body. This
issue is common but overlooked by previous person search works. To alleviate
this issue, this paper proposes an Align-to-Part Network (APNet) for person
detection and re-Identification (reID). APNet refines detected bounding boxes
to cover the estimated holistic body regions, from which discriminative part
features can be extracted and aligned. Aligned part features naturally
formulate reID as a partial feature matching procedure, where valid part
features are selected for similarity computation, while part features on
occluded or noisy regions are discarded. This design enhances the robustness of
person search to real-world challenges with marginal computation overhead. This
paper also contributes a Large-Scale dataset for Person Search in the wild
(LSPS), which is by far the largest and the most challenging dataset for person
search. Experiments show that APNet brings considerable performance improvement
on LSPS. Meanwhile, it achieves competitive performance on existing person
search benchmarks like CUHK-SYSU and PRW.
Related papers
- Region Generation and Assessment Network for Occluded Person
Re-Identification [43.49129366128688]
Person Re-identification (ReID) plays a more and more crucial role in recent years with a wide range of applications.
Most methods tackle such challenges by utilizing external tools to locate body parts or exploiting matching strategies.
We propose a Region Generation and Assessment Network (RGANet) to effectively and efficiently detect the human body regions.
arXiv Detail & Related papers (2023-09-07T08:41:47Z) - LEAPS: End-to-End One-Step Person Search With Learnable Proposals [50.39493100627476]
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.
arXiv Detail & Related papers (2023-03-21T13:59:32Z) - Dynamic Feature Pruning and Consolidation for Occluded Person
Re-Identification [21.006680330530852]
We propose a feature pruning and consolidation (FPC) framework to circumvent explicit human structure parsing.
The framework mainly consists of a sparse encoder, a multi-view feature mathcing module, and a feature consolidation decoder.
Our method outperforms state-of-the-art results by at least 8.6% mAP and 6.0% Rank-1 accuracy on the challenging Occluded-Duke dataset.
arXiv Detail & Related papers (2022-11-27T06:18:40Z) - Generalizing Few-Shot NAS with Gradient Matching [165.5690495295074]
One-Shot methods train one supernet to approximate the performance of every architecture in the search space via weight-sharing.
Few-Shot NAS reduces the level of weight-sharing by splitting the One-Shot supernet into multiple separated sub-supernets.
It significantly outperforms its Few-Shot counterparts while surpassing previous comparable methods in terms of the accuracy of derived architectures.
arXiv Detail & Related papers (2022-03-29T03:06:16Z) - Weakly Supervised Person Search with Region Siamese Networks [65.76237418040071]
Supervised learning is dominant in person search, but it requires elaborate labeling of bounding boxes and identities.
We present a weakly supervised setting where only bounding box annotations are available.
Our model achieves the rank-1 of 87.1% and mAP of 86.0% on CUHK-SYSU benchmark.
arXiv Detail & Related papers (2021-09-13T16:33:27Z) - Efficient Person Search: An Anchor-Free Approach [86.45858994806471]
Person search aims to simultaneously localize and identify a query person from realistic, uncropped images.
To achieve this goal, state-of-the-art models typically add a re-id branch upon two-stage detectors like Faster R-CNN.
In this work, we present an anchor-free approach to efficiently tackling this challenging task, by introducing the following dedicated designs.
arXiv Detail & Related papers (2021-09-01T07:01:33Z) - Combined Depth Space based Architecture Search For Person
Re-identification [70.86236888223569]
We aim to design a lightweight and suitable network for person re-identification (ReID)
We propose a novel search space called Combined Depth Space (CDS), based on which we search for an efficient network architecture, which we call CDNet.
We then propose a low-cost search strategy named the Top-k Sample Search strategy to make full use of the search space and avoid trapping in local optimal result.
arXiv Detail & Related papers (2021-04-09T02:40:01Z) - Sequential End-to-end Network for Efficient Person Search [7.3658840620058115]
Person search aims at jointly solving Person Detection and Person Re-identification (re-ID)
Existing works have designed end-to-end networks based on Faster R-CNN.
We propose a Sequential End-to-end Network (SeqNet) to extract superior features.
arXiv Detail & Related papers (2021-03-18T10:28:24Z) - Selective Convolutional Network: An Efficient Object Detector with
Ignoring Background [28.591619763438054]
We introduce an efficient object detector called Selective Convolutional Network (SCN), which selectively calculates only on the locations that contain meaningful and conducive information.
To solve it, we design an elaborate structure with negligible overheads to guide the network where to look next.
arXiv Detail & Related papers (2020-02-04T10:07: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.