Rethinking of Pedestrian Attribute Recognition: Realistic Datasets with Efficient Method

• URL: http://arxiv.org/abs/2005.11909v2
• Date: Tue, 26 May 2020 01:13:23 GMT
• Title: Rethinking of Pedestrian Attribute Recognition: Realistic Datasets with Efficient Method
• Authors: Jian Jia, Houjing Huang, Wenjie Yang, Xiaotang Chen, Kaiqi Huang
• Abstract summary: Images of same pedestrian identity in train set and test set are extremely similar, leading to overestimated performance of state-of-the-art methods on existing datasets. We propose two realistic datasets PETAtextsubscript$zs$ and RAPv2textsubscript$zs$ following zero-shot setting of pedestrian identities. Our method achieves state-of-the-art performance on PETA, RAPv2, PETAtextsubscript$zs$ and RAPv2textsubscript$zs$.
• Score: 39.867773623939435
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Despite various methods are proposed to make progress in pedestrian attribute recognition, a crucial problem on existing datasets is often neglected, namely, a large number of identical pedestrian identities in train and test set, which is not consistent with practical application. Thus, images of the same pedestrian identity in train set and test set are extremely similar, leading to overestimated performance of state-of-the-art methods on existing datasets. To address this problem, we propose two realistic datasets PETA\textsubscript{$zs$} and RAPv2\textsubscript{$zs$} following zero-shot setting of pedestrian identities based on PETA and RAPv2 datasets. Furthermore, compared to our strong baseline method, we have observed that recent state-of-the-art methods can not make performance improvement on PETA, RAPv2, PETA\textsubscript{$zs$} and RAPv2\textsubscript{$zs$}. Thus, through solving the inherent attribute imbalance in pedestrian attribute recognition, an efficient method is proposed to further improve the performance. Experiments on existing and proposed datasets verify the superiority of our method by achieving state-of-the-art performance.

Related papers

• Data Imputation by Pursuing Better Classification: A Supervised Kernel-Based Method [23.16359277296206]
  We propose a new framework that effectively leverages supervision information to complete missing data in a manner conducive to classification. Our algorithm significantly outperforms other methods when the data is missing more than 60% of the features.
  arXiv  Detail & Related papers  (2024-05-13T14:44:02Z)
• Incremental Self-training for Semi-supervised Learning [56.57057576885672]
  IST is simple yet effective and fits existing self-training-based semi-supervised learning methods. We verify the proposed IST on five datasets and two types of backbone, effectively improving the recognition accuracy and learning speed.
  arXiv  Detail & Related papers  (2024-04-14T05:02:00Z)
• Fast Classification with Sequential Feature Selection in Test Phase [1.1470070927586016]
  This paper introduces a novel approach to active feature acquisition for classification. It is the task of sequentially selecting the most informative subset of features to achieve optimal prediction performance. The proposed approach involves a new lazy model that is significantly faster and more efficient compared to existing methods.
  arXiv  Detail & Related papers  (2023-06-25T21:31:46Z)
• Evaluation of Test-Time Adaptation Under Computational Time Constraints [80.40939405129102]
  Test Time Adaptation (TTA) methods leverage unlabeled data at test time to adapt to distribution shifts. Current evaluation protocols overlook the effect of this extra cost, affecting their real-world applicability. We propose a more realistic evaluation protocol for TTA methods, where data is received in an online fashion from a constant-speed data stream.
  arXiv  Detail & Related papers  (2023-04-10T18:01:47Z)
• Cluster-level pseudo-labelling for source-free cross-domain facial expression recognition [94.56304526014875]
  We propose the first Source-Free Unsupervised Domain Adaptation (SFUDA) method for Facial Expression Recognition (FER) Our method exploits self-supervised pretraining to learn good feature representations from the target data. We validate the effectiveness of our method in four adaptation setups, proving that it consistently outperforms existing SFUDA methods when applied to FER.
  arXiv  Detail & Related papers  (2022-10-11T08:24:50Z)
• Learning Enhanced Representations for Tabular Data via Neighborhood Propagation [24.485479610138498]
  We construct a hypergraph to model the cross-row and cross-column patterns of data instances. We then perform message propagation to enhance the target data instance representation. Experiments on two important data prediction tasks validate the superiority of the proposed PET model.
  arXiv  Detail & Related papers  (2022-06-14T04:24:52Z)
• Rethinking of Pedestrian Attribute Recognition: A Reliable Evaluation under Zero-Shot Pedestrian Identity Setting [48.347987541336146]
  We argue that it is time to step back and analyze the status quo of pedestrian attribute recognition. We formally define and distinguish pedestrian attribute recognition from other similar tasks. Experiments are conducted on four existing datasets and two proposed datasets to measure progress on pedestrian attribute recognition.
  arXiv  Detail & Related papers  (2021-07-08T03:12:24Z)
• Semi-supervised Long-tailed Recognition using Alternate Sampling [95.93760490301395]
  Main challenges in long-tailed recognition come from the imbalanced data distribution and sample scarcity in its tail classes. We propose a new recognition setting, namely semi-supervised long-tailed recognition. We demonstrate significant accuracy improvements over other competitive methods on two datasets.
  arXiv  Detail & Related papers  (2021-05-01T00:43:38Z)

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.