Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/23820
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHuang, Y-
dc.contributor.authorWang, Q-
dc.contributor.authorYang, W-
dc.contributor.authorLiao, Q-
dc.contributor.authorMeng, H-
dc.date.accessioned2021-12-25T19:53:22Z-
dc.date.available2021-12-25T19:53:22Z-
dc.date.issued2021-12-21-
dc.identifierORCiD: Yan Huang https://orcid.org/0000-0001-7868-093X-
dc.identifierORCiD: Qicong Wang https://orcid.org/0000-0001-7324-0433-
dc.identifierORCiD: Wenming Yang https://orcid.org/0000-0002-2506-1286-
dc.identifierORCiD: Qingmin Liao https://orcid.org/0000-0002-7509-3964-
dc.identifierORCiD: Hongying Meng https://orcid.org/0000-0002-8836-1382-
dc.identifier.citationHuang, Y. et al. (2022) 'Hierarchical Deep Multi-task Learning with Attention Mechanism for Similarity Learning,' IEEE Transactions on Cognitive and Developmental Systems, 14 (4), pp. 1729 - 1742. doi: 10.1109/TCDS.2021.3137316.en_US
dc.identifier.issn2379-8920-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/23820-
dc.description.abstractSimilarity learning is often adopted as an auxiliary task of deep multitask learning methods to learn discriminant features. Most existing approaches only use the single-layer features extracted by the last fully connected layer, which ignores the abundant information of feature channels in lower layers. Besides, small cliques are the most commonly used methods in similarity learning tasks to model the correlation of data, which can lead to the limited relation learning. In this article, we present an end-to-end hierarchical deep multitask learning framework for similarity learning which can learn more discriminant features by sharing information from different layers of network and dealing with complex correlation. Its main task is graph similarity inference. We build focus graphs for each sample. Then, an attention mechanism and a node feature enhancing model are introduced into backbone network to extract the abundant and important channel information from multiple layers of network. In the similarity inference task, a relation enhancing mechanism is applied to graph convolutional network to leverage the crucial relation in channels, which can effectively facilitate the learning ability of the whole framework. The extensive experiments have been conducted to demonstrate the effectiveness of the proposed method on person reidentification and face clustering applications.-
dc.description.sponsorshipShenzhen Science and Technology Projects (Grant Number: JCYJ20200109143035495).en_US
dc.format.extent1729 - 1742-
dc.format.mediumPrint-Electronic-
dc.language.isoen_USen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.rightsCopyright © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works (see: https://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelinesand-policies/post-publication-policies/).-
dc.subjecthierarchical learningen_US
dc.subjectmulti-tasken_US
dc.subjectgraph similarity inferenceen_US
dc.titleHierarchical Deep Multi-task Learning with Attention Mechanism for Similarity Learningen_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.1109/tcds.2021.3137316-
dc.relation.isPartOfIEEE Transactions on Cognitive and Developmental Systems-
pubs.issue4-
pubs.publication-statusPublished-
pubs.volume14-
dc.identifier.eissn2379-8939-
dcterms.dateAccepted2021-12-17-
Appears in Collections:Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works (see: https://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelinesand-policies/post-publication-policies/).48.53 MBAdobe PDFView/Open


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