Few-shot learning with relation propagation and constraint

Previous deep learning methods usually required large-scale annotated data, which is computationally exhaustive and unrealistic in certain scenarios. Therefore, few-shot learning, where only a few annotated training images are available for training, has attracted increasing attention these days, sh...

Full description

Bibliographic Details
Main Authors: Gong, H. (Author), Liu, W. (Author), Liu, X. (Author), Ma, Y. (Author), Wang, S. (Author), Yan, Y. (Author), Zhao, X. (Author)
Format: Article
Language:English
Published: John Wiley and Sons Inc 2021
Subjects:
Online Access:View Fulltext in Publisher
LEADER 03511nam a2200469Ia 4500
001 10.1049-cvi2.12074
008 220425s2021 CNT 000 0 und d
020 |a 17519632 (ISSN) 
245 1 0 |a Few-shot learning with relation propagation and constraint 
260 0 |b John Wiley and Sons Inc  |c 2021 
856 |z View Fulltext in Publisher  |u https://doi.org/10.1049/cvi2.12074 
520 3 |a Previous deep learning methods usually required large-scale annotated data, which is computationally exhaustive and unrealistic in certain scenarios. Therefore, few-shot learning, where only a few annotated training images are available for training, has attracted increasing attention these days, showing huge potential in practical applications, such as portable equipment or security inspection, and so on. However, current few-shot learning methods usually neglect the valuable semantic correlations between samples, thereby failing in extracting discriminating relations to achieve accurate predictive results. In this work, extending on a recent state-of-the-art few-shot learning method, transductive relation-propagation network (TRPN), which considers the correlations between training samples, a constrained relation-propagation network is proposed to further regularise the distilled correlations and thus achieve favourable few-shot classification performance. The proposed framework contains three main components, namely preprocess module, relational propagation module, and relation constraint module. First, sample features are extracted and a relation graph node is constructed by treating the relation of each support–query pair as a graph node in the preprocess module. After that, in the relation propagation module (RPM), the valuable information of support–query pairs is modelled and propagated to directly generate the relational representations for further prediction. Then, a relation constraint module is introduced to regularise the relational representations and make it consistent with the ground-truth relations as much as possible. With the guidance of the effective RPM and relation constraint module, the relational representations of the support–query pairs are distinguishable and thus can achieve accurate predictive results. Comprehensive experiments conducted on widely used benchmarks validate the effectiveness of our method compared to state-of-the-art few-shot classification approaches. © 2021 The Authors. IET Computer Vision published by John Wiley & Sons Ltd on behalf of The Institution of Engineering and Technology. 
650 0 4 |a computer vision 
650 0 4 |a Computer vision 
650 0 4 |a Constraint module 
650 0 4 |a correlation methods 
650 0 4 |a Correlation methods 
650 0 4 |a Deep learning 
650 0 4 |a Extraction 
650 0 4 |a graph theory 
650 0 4 |a Graph theory 
650 0 4 |a image recognition 
650 0 4 |a Image recognition 
650 0 4 |a Large-scales 
650 0 4 |a Learning methods 
650 0 4 |a Preprocess 
650 0 4 |a Propagation modules 
650 0 4 |a Query processing 
650 0 4 |a Relation propagation 
650 0 4 |a Relational representations 
650 0 4 |a Semantics 
650 0 4 |a Shot classification 
650 0 4 |a State of the art 
650 0 4 |a Training image 
700 1 |a Gong, H.  |e author 
700 1 |a Liu, W.  |e author 
700 1 |a Liu, X.  |e author 
700 1 |a Ma, Y.  |e author 
700 1 |a Wang, S.  |e author 
700 1 |a Yan, Y.  |e author 
700 1 |a Zhao, X.  |e author 
773 |t IET Computer Vision