GaitMPL: Gait Recognition with Memory-Augmented Progressive Learning

• URL: http://arxiv.org/abs/2306.04650v1
• Date: Tue, 6 Jun 2023 07:24:53 GMT
• Title: GaitMPL: Gait Recognition with Memory-Augmented Progressive Learning
• Authors: Huanzhang Dou, Pengyi Zhang, Yuhan Zhao, Lin Dong, Zequn Qin, Xi Li
• Abstract summary: Gait recognition aims at identifying the pedestrians at a long distance by their biometric gait patterns. In this work, we propose to solve the hard sample issue with a Memory-augmented Progressive Learning network (GaitMPL) Specifically, DRPL reduces the learning difficulty of hard samples by easy-to-hard progressive learning. GSAM further augments DRPL with a structure-aligned memory mechanism, which maintains and models the feature distribution of each ID.
• Score: 10.427640929715668
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Gait recognition aims at identifying the pedestrians at a long distance by their biometric gait patterns. It is inherently challenging due to the various covariates and the properties of silhouettes (textureless and colorless), which result in two kinds of pair-wise hard samples: the same pedestrian could have distinct silhouettes (intra-class diversity) and different pedestrians could have similar silhouettes (inter-class similarity). In this work, we propose to solve the hard sample issue with a Memory-augmented Progressive Learning network (GaitMPL), including Dynamic Reweighting Progressive Learning module (DRPL) and Global Structure-Aligned Memory bank (GSAM). Specifically, DRPL reduces the learning difficulty of hard samples by easy-to-hard progressive learning. GSAM further augments DRPL with a structure-aligned memory mechanism, which maintains and models the feature distribution of each ID. Experiments on two commonly used datasets, CASIA-B and OU-MVLP, demonstrate the effectiveness of GaitMPL. On CASIA-B, we achieve the state-of-the-art performance, i.e., 88.0% on the most challenging condition (Clothing) and 93.3% on the average condition, which outperforms the other methods by at least 3.8% and 1.4%, respectively.

Related papers

• Memory Consistency Guided Divide-and-Conquer Learning for Generalized Category Discovery [56.172872410834664]
  Generalized category discovery (GCD) aims at addressing a more realistic and challenging setting of semi-supervised learning. We propose a Memory Consistency guided Divide-and-conquer Learning framework (MCDL) Our method outperforms state-of-the-art models by a large margin on both seen and unseen classes of the generic image recognition.
  arXiv  Detail & Related papers  (2024-01-24T09:39:45Z)
• The effect of data augmentation and 3D-CNN depth on Alzheimer's Disease detection [51.697248252191265]
  This work summarizes and strictly observes best practices regarding data handling, experimental design, and model evaluation. We focus on Alzheimer's Disease (AD) detection, which serves as a paradigmatic example of challenging problem in healthcare. Within this framework, we train predictive 15 models, considering three different data augmentation strategies and five distinct 3D CNN architectures.
  arXiv  Detail & Related papers  (2023-09-13T10:40:41Z)
• TriGait: Aligning and Fusing Skeleton and Silhouette Gait Data via a Tri-Branch Network [4.699718818019937]
  Gait recognition is a promising biometric technology for identification due to its non-invasiveness and long-distance. external variations such as clothing changes and viewpoint differences pose significant challenges to gait recognition. A novel triple branch gait recognition framework, TriGait, is proposed in this paper.
  arXiv  Detail & Related papers  (2023-08-25T12:19:51Z)
• Hallucination Improves the Performance of Unsupervised Visual Representation Learning [9.504503675097137]
  We propose Hallucinator that could efficiently generate additional positive samples for further contrast. The Hallucinator is differentiable and creates new data in the feature space. Remarkably, we empirically prove that the proposed Hallucinator generalizes well to various contrastive learning models.
  arXiv  Detail & Related papers  (2023-07-22T21:15:56Z)
• MetaGait: Learning to Learn an Omni Sample Adaptive Representation for Gait Recognition [16.26377062742576]
  We develop a novel MetaGait that learns to learn an omni sample adaptive representation. We leverage the meta-knowledge across the entire process, where Meta Triple Attention and Meta Temporal Pooling are presented. Extensive experiments demonstrate the state-of-the-art performance of the proposed MetaGait.
  arXiv  Detail & Related papers  (2023-06-06T06:53:05Z)
• Modality-Aware Triplet Hard Mining for Zero-shot Sketch-Based Image Retrieval [51.42470171051007]
  This paper tackles the Zero-Shot Sketch-Based Image Retrieval (ZS-SBIR) problem from the viewpoint of cross-modality metric learning. By combining two fundamental learning approaches in DML, e.g., classification training and pairwise training, we set up a strong baseline for ZS-SBIR. We show that Modality-Aware Triplet Hard Mining (MATHM) enhances the baseline with three types of pairwise learning.
  arXiv  Detail & Related papers  (2021-12-15T08:36:44Z)
• Consensus Synergizes with Memory: A Simple Approach for Anomaly Segmentation in Urban Scenes [132.16748656557013]
  Anomaly segmentation is a crucial task for safety-critical applications, such as autonomous driving in urban scenes. We propose a novel and simple approach named Consensus Synergizes with Memory (CosMe) to address this challenge. Experimental results on several urban scene anomaly segmentation datasets show that CosMe outperforms previous approaches by large margins.
  arXiv  Detail & Related papers  (2021-11-24T10:01:20Z)
• Adaptive Hierarchical Similarity Metric Learning with Noisy Labels [138.41576366096137]
  We propose an Adaptive Hierarchical Similarity Metric Learning method. It considers two noise-insensitive information, textiti.e., class-wise divergence and sample-wise consistency. Our method achieves state-of-the-art performance compared with current deep metric learning approaches.
  arXiv  Detail & Related papers  (2021-10-29T02:12:18Z)
• Learning Rich Features for Gait Recognition by Integrating Skeletons and Silhouettes [20.766540020533803]
  This paper proposes a simple yet effective bimodal fusion network, which mines the complementary clues of skeletons and silhouettes to learn rich features for gait identification. Under the most challenging condition of walking in different clothes on CASIA-B, our method achieves the rank-1 accuracy of 92.1%.
  arXiv  Detail & Related papers  (2021-10-26T04:42:24Z)
• View-Invariant Gait Recognition with Attentive Recurrent Learning of Partial Representations [27.33579145744285]
  We propose a network that first learns to extract gait convolutional energy maps (GCEM) from frame-level convolutional features. It then adopts a bidirectional neural network to learn from split bins of the GCEM, thus exploiting the relations between learned partial recurrent representations. Our proposed model has been extensively tested on two large-scale CASIA-B and OU-M gait datasets.
  arXiv  Detail & Related papers  (2020-10-18T20:20:43Z)
• Learning and Memorizing Representative Prototypes for 3D Point Cloud Semantic and Instance Segmentation [117.29799759864127]
  3D point cloud semantic and instance segmentation is crucial and fundamental for 3D scene understanding. Deep networks can easily forget the non-dominant cases during the learning process, resulting in unsatisfactory performance. We propose a memory-augmented network to learn and memorize the representative prototypes that cover diverse samples universally.
  arXiv  Detail & Related papers  (2020-01-06T01:07:46Z)

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.