HELA-VFA: a hellinger distance-attention-based feature aggregation network for few-shot classification

• Main Authors: Lee, Gao Yu, Dam, Tanmoy, Poenar, Daniel Puiu, Duong, Vu N., Ferdaus, Md Meftahul
• Other Authors: School of Mechanical and Aerospace Engineering
• Format: Conference or Workshop Item
• Language: English
• Published: 2024
• Subjects: Computer and Information Science; Feature aggregation; Few-shot learning; Hellinger distance; Image classification
• Online Access: https://hdl.handle.net/10356/173508
• Institution: Nanyang Technological University

Enabling effective learning using only a few presented examples is a crucial but difficult computer vision objective. Few-shot learning have been proposed to address the challenges, and more recently variational inference-based approaches are incorporated to enhance few-shot classification performances. However, the current dominant strategy utilized the Kullback-Leibler (KL) divergences to find the log marginal likelihood of the target class distribution, while neglecting the possibility of other probabilistic comparative measures, as well as the possibility of incorporating attention in the feature extraction stages, which can increase the effectiveness of the few-shot model. To this end, we proposed the HELlinger-Attention Variational Feature Aggregation network (HELA-VFA), which utilized the Hellinger distance along with attention in the encoder to fulfill the aforementioned gaps. We show that our approach enables the derivation of an alternate form of the lower bound commonly presented in prior works, thus making the variational optimization feasible and be trained on the same footing in a given setting. Extensive experiments performed on four benchmarked few-shot classification datasets demonstrated the feasibility and superiority of our approach relative to the State-Of-The-Arts (SOTAs) approaches.