Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/120542
DC FieldValueLanguage
dc.contributorDepartment of Electrical and Electronic Engineeringen_US
dc.creatorAbdrakhim, Sen_US
dc.creatorRossi, Len_US
dc.date.accessioned2026-08-18T07:36:00Z-
dc.date.available2026-08-18T07:36:00Z-
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10397/120542-
dc.description28th International Conference on Pattern Recognition, ICPR 2026, Lyon, France, August 17-22, 2026en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectAction recognitionen_US
dc.subjectGraph neural networken_US
dc.subjectMambaen_US
dc.titleSkeletonMamba : a lightweight Mamba-based architecture for action recognitionen_US
dc.typeConference Paperen_US
dc.identifier.spage109en_US
dc.identifier.epage124en_US
dc.identifier.volume16819en_US
dc.identifier.doi10.1007/978-3-032-31404-8_8en_US
dcterms.abstractIn the past few years, graph neural networks (GNNs) have become the preferred way to tackle the computer vision task of action recognition using skeleton data. These are usually combined with temporal operations aimed at capturing the dynamics induced by the sequence of frames. Recent works have proposed to use Mamba, a recently introduced sequence modeling architecture that offers a fast and computationally efficient alternative to Transformers, to capture these temporal dynamics, while employing GNNs to capture spatial information. Unfortunately, these approaches fail to fully untap the computational efficiency of Mamba and only achieve substandard accuracy. In this paper, we propose SkeletonMamba, a novel hybrid GNN-Mamba model combining a lightweight GNN module with a novel Temporal Mamba block. The synergy between these two components allows our model to overcome the shortcomings of existing Mamba-based action recognition architectures. We perform an extensive set of experiments demonstrating that SkeletonMamba achieves a competitive performance against SOTA approaches on the widely used NTU RGB+D 60 & 120 datasets, while minimizing the number of floating point operations and trainable parameters. Our code is publicly available at https://github.com/Spanchsan/URIS_HarmAssessment.en_US
dcterms.accessRightsembargoed accessen_US
dcterms.bibliographicCitationLecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2026, v. 16819, p. 109-124en_US
dcterms.isPartOfLecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics)en_US
dcterms.issued2026-
dc.relation.conferenceInternational Conference on Pattern Recognition [ICPR]en_US
dc.identifier.eissn1611-3349en_US
dc.description.validate202608 bcchen_US
dc.description.oaNot applicableen_US
dc.identifier.FolderNumbera4724b-
dc.identifier.SubFormID53756-
dc.description.fundingSourceSelf-fundeden_US
dc.description.pubStatusPublisheden_US
dc.date.embargo2027-08-03en_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Conference Paper
Open Access Information
Status embargoed access
Embargo End Date 2027-08-03
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.