Full metadata record

DC Field Value Language
dc.contributor.authorLee Haetsal-
dc.contributor.authorJunghyun Cho-
dc.contributor.authorKIM, IG JAE-
dc.contributor.authorUnsang Park-
dc.date.accessioned2024-01-12T03:44:18Z-
dc.date.available2024-01-12T03:44:18Z-
dc.date.created2021-12-14-
dc.date.issued2021-11-
dc.identifier.issn0302-9743-
dc.identifier.urihttps://pubs.kist.re.kr/handle/201004/77312-
dc.description.abstractMany skeleton-based action recognition models have been introduced with the application of graph convolutional networks (GCNs). Most of the models suggested new ways to aggregate adjacent joints information. In this paper, we propose a novel way to define the adjacency matrix from the geometrical distance between joints. By combining this method with the formerly used adjacency matrix, we can increase the performances of graph convolution layers with slightly increased computational complexity. Experiments on two large-scale datasets, NTU-60 and Skeletics-152, demonstrate that our model provides competitive performance.-
dc.languageEnglish-
dc.publisherSPRINGER INTERNATIONAL PUBLISHING AG-
dc.titleDistance-GCN for Action Recognition-
dc.typeConference-
dc.description.journalClass1-
dc.identifier.bibliographicCitation6th Asian Conference on Pattern Recognition (ACPR), pp.170 - 181-
dc.citation.title6th Asian Conference on Pattern Recognition (ACPR)-
dc.citation.startPage170-
dc.citation.endPage181-
dc.citation.conferencePlaceKO-
dc.citation.conferencePlace제주도-
dc.citation.conferenceDate2021-11-09-
dc.relation.isPartOfPATTERN RECOGNITION, ACPR 2021, PT I-
dc.identifier.wosid000873489400013-
Appears in Collections:
KIST Conference Paper > 2021
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML

qrcode

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

BROWSE