Few-shot classification using Gaussianisation prototypical classifier

被引:2
|
作者
Liu, Fan [1 ,2 ]
Li, Feifan [1 ,2 ]
Yang, Sai [3 ]
机构
[1] Hohai Univ, Coll Comp & Informat, Nanjing, Peoples R China
[2] Sci & Technol Underwater Vehicle Technol Lab, Harbin, Peoples R China
[3] Nantong Univ, Sch Elect Engn, 9 Seyuan Rd, Nantong 226019, Peoples R China
关键词
few-shot classification; maximum a posteriori; reliable prototype;
D O I
10.1049/cvi2.12129
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Few-shot classification (FSC) aims at classifying query samples into correct classes given only a few labelled samples. Prototypical Classifier (PC) can be chosen to be an ideal classifier for settling this problem, as it has good properties of low-capacity and parameter-free. However, the mean-based prototypes suffer from the issue of deviating from its ground-truth centre. In order to solve such problem of prototype bias, Gaussianisation Prototypical Classifier (GPC) is proposed, which is a kind of one-step prototype rectification method. Specifically, the authors first perform Gaussianisation operation over the feature extracted from the backbone network so that the features fit the particular Gaussian distribution. Second, the authors use prototype feature of the base class as prior information and employs Maximum a Posteriori estimation method to obtain the reliable prototype for each novel class. Finally, the query sample of novel class is classified to be its nearest prototype with non-parametric classifiers. Extensive experiments have been conducted on multiple FSC benchmarks. Comparative results also demonstrate that the authors' method is superior to existing state-of-the-art FSC methods.
引用
下载
收藏
页码:62 / 75
页数:14
相关论文
共 50 条
  • [41] Few-shot relation classification by context attention-based prototypical networks with BERT
    Bei Hui
    Liang Liu
    Jia Chen
    Xue Zhou
    Yuhui Nian
    EURASIP Journal on Wireless Communications and Networking, 2020
  • [42] Hybrid Attention-Based Prototypical Networks for Noisy Few-Shot Relation Classification
    Gao, Tianyu
    Han, Xu
    Liu, Zhiyuan
    Sun, Maosong
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 6407 - 6414
  • [43] Few-shot relation classification by context attention-based prototypical networks with BERT
    Hui, Bei
    Liu, Liang
    Chen, Jia
    Zhou, Xue
    Nian, Yuhui
    EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2020, 2020 (01)
  • [44] DPNet: domain-aware prototypical network for interdisciplinary few-shot relation classification
    Bo Lv
    Li Jin
    Xiaoyu Li
    Xian Sun
    Zhi Guo
    Zequn Zhang
    Shuchao Li
    Applied Intelligence, 2022, 52 : 15718 - 15733
  • [45] A Multiscale Spatial-Spectral Prototypical Network for Hyperspectral Image Few-Shot Classification
    Tang, Haojin
    Huang, Zhiquan
    Li, Yanshan
    Zhang, Li
    Xie, Weixin
    IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, 2022, 19
  • [46] Few-shot classification with prototypical neural network for hospital flow recognition under uncertainty
    Chang, Mike C.
    Alaeddini, Adel
    NETWORK MODELING AND ANALYSIS IN HEALTH INFORMATICS AND BIOINFORMATICS, 2024, 13 (01):
  • [47] Predicting the Generalization Ability of a Few-Shot Classifier
    Bontonou, Myriam
    Bethune, Louis
    Gripon, Vincent
    INFORMATION, 2021, 12 (01) : 1 - 19
  • [48] Enhancement of Few-shot Image Classification Using Eigenimages
    Jonghyun Ko
    Wonzoo Chung
    International Journal of Control, Automation and Systems, 2023, 21 : 4088 - 4097
  • [49] Malware Classification Using Few-Shot Learning Approach
    Alfarsi, Khalid
    Rasheed, Saim
    Ahmad, Iftikhar
    Information (Switzerland), 2024, 15 (11)
  • [50] Enhancement of Few-shot Image Classification Using Eigenimages
    Ko, Jonghyun
    Chung, Wonzoo
    INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS, 2023, 21 (12) : 4088 - 4097