Task‐oriented feature hallucination for few‐shot image classification

نویسندگان

چکیده

Abstract Data hallucination generates additional training examples for novel classes to alleviate the data scarcity problem in few‐shot learning (FSL). Existing hallucination‐based FSL methods normally train a general embedding model first by applying information extracted from base that have abundant data. In those methods, hallucinators are then built upon trained generate classes. However, these usually rely on general‐purpose embeddings, limiting their ability task‐oriented samples Recent studies shown task‐specific models, which adapted tasks, can achieve better classification performance. To improve performance of example is used proposed method perform generation. After initialization, hallucinator finetuned with guidance teacher–student mechanism. The contains two steps. An initial network and an dataset step. second step pseudo‐labelling process where pseudo‐labelled using support task fine‐tuning adjusted simultaneously. Both updated set knowledge distillation. experiments conducted four popular datasets. results demonstrate approach outperforms state‐of‐the‐art 0.8% 4.08% increases accuracy 5‐way 5‐shot tasks. It also achieves comparable 1‐shot

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sample-oriented Domain Adaptation for Image Classification

Image processing is a method to perform some operations on an image, in order to get an enhanced image or to extract some useful information from it. The conventional image processing algorithms cannot perform well in scenarios where the training images (source domain) that are used to learn the model have a different distribution with test images (target domain). Also, many real world applicat...

متن کامل

Nearest feature line embedding for face hallucination

A new manifold learning method, called nearest feature line (NFL) embedding, for face hallucination is proposed. While many manifold learning based face hallucination algorithms have been proposed in recent years, most of them apply the conventional nearest neighbour metric to derive the subspace and may not effectively characterise the geometrical information of the samples, especially when th...

متن کامل

Hierarchical feature coding for image classification

Feature coding and pooling are two critical stages in the widely used Bag-of-Features (BOF) framework in image classification. After coding, each local feature formulates its representation by the visual codewords. However, the two-dimensional feature-code layout is transformed to a one-dimensional codeword representation after pooling. The property for each local feature is ignored and the who...

متن کامل

A Convex Approach for Image Hallucination

In this paper we propose a global convex approach for image hallucination. Altering the idea of classical multi image super resolution (SU) systems to single image SU, we incorporate aligned images to hallucinate the output. Our work is based on the paper of Tappen et al.[14] where they use a non-convex model for image hallucination. In comparison we formulate a convex primal optimization probl...

متن کامل

Feature Difference Classification in Fractal Image Coding

Fractal image coding suffers from its long encoding time. Block classification is often used to speed up coding processing, which uses some mechanism of classification when coding an image and only does match job for domain and range blocks with some similar features. D. Saupe’s classification algorithm of nearest neighbor search in feature space seems to have the best rate-distortion property ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Iet Image Processing

سال: 2023

ISSN: ['1751-9659', '1751-9667']

DOI: https://doi.org/10.1049/ipr2.12886