Lightweight Attribute Localizing Models for Pedestrian Attribute Recognition

📅 2023-06-16
🏛️ IEEE Intelligent Systems
📈 Citations: 1
Influential: 0
📄 PDF
🤖 AI Summary
To address the over-parameterization, high computational cost, and deployment challenges of deep neural networks for Person Attribute Recognition (PAR) on resource-constrained embedded devices, this paper proposes the Lightweight Attribute Localization Model (LWALM). LWALM innovatively introduces CP Decomposition with Error-Preserving Correction (CPD-EPC) — the first application of this technique to layer-wise tensor compression in PAR models — effectively preserving gradient directions and attribute localization capability while drastically reducing model complexity. Experiments on the PA-100 and RAPv2 benchmarks demonstrate state-of-the-art lightweight performance: LWALM reduces model parameters by 72% and FLOPs by 68%, with an average accuracy drop of less than 1.2%. The method thus achieves an exceptional balance between inference efficiency and recognition accuracy, enabling practical deployment in edge scenarios.
📝 Abstract
Pedestrian Attribute Recognition (PAR) deals with the problem of identifying features in a pedestrian image. It has found interesting applications in person retrieval, suspect re-identification and soft biometrics. In the past few years, several Deep Neural Networks (DNNs) have been designed to solve the task; however, the developed DNNs predominantly suffer from over-parameterization and high computational complexity. These problems hinder them from being exploited in resource-constrained embedded devices with limited memory and computational capacity. By reducing a network's layers using effective compression techniques, such as tensor decomposition, neural network compression is an effective method to tackle these problems. We propose novel Lightweight Attribute Localizing Models (LWALM) for Pedestrian Attribute Recognition (PAR). LWALM is a compressed neural network obtained after effective layer-wise compression of the Attribute Localization Model (ALM) using the Canonical Polyadic Decomposition with Error Preserving Correction (CPD-EPC) algorithm.
Problem

Research questions and friction points this paper is trying to address.

Over-parameterized DNNs hinder PAR on resource-limited devices
Traditional tensor compression loses accuracy and efficiency
Optimal rank selection preserves gradient direction in compression
Innovation

Methods, ideas, or system contributions that make the work stand out.

Optimal rank determination for low-rank layers
Gradient direction preservation during compression
Layer-wise compression using CPD-EPC or SVD
🔎 Similar Papers
No similar papers found.
A
Ashish Jha
Skolkovo Institute of Science and Technology (SKOLTECH), Russia
D
Dimitrii Ermilov
Skolkovo Institute of Science and Technology (SKOLTECH), Russia
Konstantin Sobolev
Konstantin Sobolev
FusionBrain Lab, MSU
Deep LearningComputer VisionTensor Decomposition
A
A. Phan
Skolkovo Institute of Science and Technology (SKOLTECH), Russia
Salman Ahmadi-Asl
Salman Ahmadi-Asl
Assistant Professor, Innopolis University
Tensor ComputationsTensor DecompositionRandomized AlgorithmsQuaternions
Naveed Ahmed
Naveed Ahmed
University of Sharjah, UAE
I
Imran N. Junejo
Advanced Micro Devices (AMD), Canada
Z
Z. Aghbari
University of Sharjah, UAE
Thar Baker
Thar Baker
University of Brighton, UK
A
A. Khedr
University of Sharjah, UAE
A
A. Cichocki
Skolkovo Institute of Science and Technology (SKOLTECH), Russia