A Deep Hierarchical Feature Sparse Framework for Occluded Person Re-Identification

• URL: http://arxiv.org/abs/2401.07469v1
• Date: Mon, 15 Jan 2024 04:51:39 GMT
• Title: A Deep Hierarchical Feature Sparse Framework for Occluded Person Re-Identification
• Authors: Yihu Song and Shuaishi Liu
• Abstract summary: A speed-up person ReID framework named SUReID is proposed to mitigate occlusion interference while speeding up inference. Experimental results show that the SUReID achieves superior performance with surprisingly fast inference.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Most existing methods tackle the problem of occluded person re-identification (ReID) by utilizing auxiliary models, resulting in a complicated and inefficient ReID framework that is unacceptable for real-time applications. In this work, a speed-up person ReID framework named SUReID is proposed to mitigate occlusion interference while speeding up inference. The SUReID consists of three key components: hierarchical token sparsification (HTS) strategy, non-parametric feature alignment knowledge distillation (NPKD), and noise occlusion data augmentation (NODA). The HTS strategy works by pruning the redundant tokens in the vision transformer to achieve highly effective self-attention computation and eliminate interference from occlusions or background noise. However, the pruned tokens may contain human part features that contaminate the feature representation and degrade the performance. To solve this problem, the NPKD is employed to supervise the HTS strategy, retaining more discriminative tokens and discarding meaningless ones. Furthermore, the NODA is designed to introduce more noisy samples, which further trains the ability of the HTS to disentangle different tokens. Experimental results show that the SUReID achieves superior performance with surprisingly fast inference.

Related papers

• DDRN:a Data Distribution Reconstruction Network for Occluded Person Re-Identification [5.7703191981015305]
  We propose a generative model that leverages data distribution to filter out irrelevant details. On the Occluded-Duke dataset, we achieved a mAP of 62.4% (+1.1%) and a rank-1 accuracy of 71.3% (+0.6%)
  arXiv  Detail & Related papers  (2024-10-09T06:52:05Z)
• Part Representation Learning with Teacher-Student Decoder for Occluded Person Re-identification [65.63180725319906]
  We propose a Teacher-Student Decoder (TSD) framework for occluded person ReID. Our proposed TSD consists of a Parsing-aware Teacher Decoder (PTD) and a Standard Student Decoder (SSD)
  arXiv  Detail & Related papers  (2023-12-15T13:54:48Z)
• Erasing, Transforming, and Noising Defense Network for Occluded Person Re-Identification [36.91680117072686]
  We propose Erasing, Transforming, and Noising Defense Network (ETNDNet) to solve occluded person re-ID. In the proposed ETNDNet, we randomly erase the feature map to create an adversarial representation with incomplete information. Thirdly, we perturb the feature map with random values to address noisy information introduced by obstacles and non-target pedestrians.
  arXiv  Detail & Related papers  (2023-07-14T06:42:21Z)
• Multi-Dimensional Refinement Graph Convolutional Network with Robust Decouple Loss for Fine-Grained Skeleton-Based Action Recognition [19.031036881780107]
  We propose a flexible attention block called Channel-Variable Spatial-Temporal Attention (CVSTA) to enhance the discriminative power of spatial-temporal joints. Based on CVSTA, we construct a Multi-Dimensional Refinement Graph Convolutional Network (MDR-GCN), which can improve the discrimination among channel-, joint- and frame-level features. Furthermore, we propose a Robust Decouple Loss (RDL), which significantly boosts the effect of the CVSTA and reduces the impact of noise.
  arXiv  Detail & Related papers  (2023-06-27T09:23:36Z)
• Learning Feature Recovery Transformer for Occluded Person Re-identification [71.18476220969647]
  We propose a new approach called Feature Recovery Transformer (FRT) to address the two challenges simultaneously. To reduce the interference of the noise during feature matching, we mainly focus on visible regions that appear in both images and develop a visibility graph to calculate the similarity. In terms of the second challenge, based on the developed graph similarity, for each query image, we propose a recovery transformer that exploits the feature sets of its $k$-nearest neighbors in the gallery to recover the complete features.
  arXiv  Detail & Related papers  (2023-01-05T02:36:16Z)
• A High-Accuracy Unsupervised Person Re-identification Method Using Auxiliary Information Mined from Datasets [53.047542904329866]
  We make use of auxiliary information mined from datasets for multi-modal feature learning. This paper proposes three effective training tricks, including Restricted Label Smoothing Cross Entropy Loss (RLSCE), Weight Adaptive Triplet Loss (WATL) and Dynamic Training Iterations (DTI)
  arXiv  Detail & Related papers  (2022-05-06T10:16:18Z)
• Dual Spoof Disentanglement Generation for Face Anti-spoofing with Depth Uncertainty Learning [54.15303628138665]
  Face anti-spoofing (FAS) plays a vital role in preventing face recognition systems from presentation attacks. Existing face anti-spoofing datasets lack diversity due to the insufficient identity and insignificant variance. We propose Dual Spoof Disentanglement Generation framework to tackle this challenge by "anti-spoofing via generation"
  arXiv  Detail & Related papers  (2021-12-01T15:36:59Z)
• Enhanced countering adversarial attacks via input denoising and feature restoring [15.787838084050957]
  Deep neural networks (DNNs) are vulnerable to adversarial examples/samples (AEs) with imperceptible perturbations in clean/original samples. This paper presents an enhanced countering adversarial attack method IDFR (via Input Denoising and Feature Restoring) The proposed IDFR is made up of an enhanced input denoiser (ID) and a hidden lossy feature restorer (FR) based on the convex hull optimization.
  arXiv  Detail & Related papers  (2021-11-19T07:34:09Z)
• Discriminator-Free Generative Adversarial Attack [87.71852388383242]
  Agenerative-based adversarial attacks can get rid of this limitation. ASymmetric Saliency-based Auto-Encoder (SSAE) generates the perturbations. The adversarial examples generated by SSAE not only make thewidely-used models collapse, but also achieves good visual quality.
  arXiv  Detail & Related papers  (2021-07-20T01:55:21Z)
• Transferable, Controllable, and Inconspicuous Adversarial Attacks on Person Re-identification With Deep Mis-Ranking [83.48804199140758]
  We propose a learning-to-mis-rank formulation to perturb the ranking of the system output. We also perform a back-box attack by developing a novel multi-stage network architecture. Our method can control the number of malicious pixels by using differentiable multi-shot sampling.
  arXiv  Detail & Related papers  (2020-04-08T18:48:29Z)

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.