paper-with-me

Papers

GKGNet: Group K-Nearest Neighbor based Graph Convolutional Network for Multi-Label Image Recognition

2023-08-28 · Ruijie Yao, Sheng Jin, Lumin Xu, Wang Zeng, Wentao Liu, Chen Qian, Ping Luo, Ji Wu

Multi-Label Image Recognition (MLIR) is a challenging task that aims to predict multiple object labels in a single image while modeling the complex relationships between labels and image regions. Although convolutional neural networks and vision transformers have succeeded in processing images as regular grids of pixels or patches, these representations are sub-optimal for capturing irregular and discontinuous regions of interest. In this work, we present the first fully graph convolutional model, Group K-nearest neighbor based Graph convolutional Network (GKGNet), which models the connections between semantic label embeddings and image patches in a flexible and unified graph structure. To address the scale variance of different objects and to capture information from multiple perspectives, we propose the Group KGCN module for dynamic graph construction and message passing. Our experiments demonstrate that GKGNet achieves state-of-the-art performance with significantly lower computational costs on the challenging multi-label datasets, i.e., MS-COCO and VOC2007 datasets. Codes are available at https://github.com/jin-s13/GKGNet.

📄 PDF Abstract BibTeX arXiv:2308.14378

Code (1)

jin-s13/gkgnet 공식 구현 pytorch

Tasks

graph constructionMulti-Label ClassificationMulti-Label Image Recognition

Methods 이 논문이 사용한 방법론

GCN A Graph Convolutional Network, or GCN, is an approach for semi-supervised learning on graph-structured data. It is based on an efficient variant of [convolutional neural…

Similar Papers 제목 키워드 기반

Neighbor group structure preserving based consensus graph learning for incomplete multi-view clustering

2023-07-11 · journal 2023 7 · Wai Keung Wong, Chengliang Liu, Shijie Deng, Lunke Fei 외

n the area of clustering, multi-view clustering has drawn a lot of research attention by making full use of information from different views. In many practical applications, collecting complete multi-view data without mi…

ClusteringGraph LearningIncomplete multi-view clustering

Approximate k-NN Graph Construction: a Generic Online Approach

2018-04-09 · Wan-Lei Zhao, Hui Wang, Chong-Wah Ngo

Nearest neighbor search and k-nearest neighbor graph construction are two fundamental issues arise from many disciplines such as multimedia information retrieval, data-mining and machine learning. They become more and mo…

graph constructionInformation RetrievalRetrieval

Label Noise Robustness for Domain-Agnostic Fair Corrections via Nearest Neighbors Label Spreading

2024-06-13 · Nathan Stromberg, Rohan Ayyagari, Sanmi Koyejo, Richard Nock 외

Last-layer retraining methods have emerged as an efficient framework for correcting existing base models. Within this framework, several methods have been proposed to deal with correcting models for subgroup fairness wit…

Fairness

EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph

2016-09-23 · Cong Fu, Deng Cai

Approximate nearest neighbor (ANN) search is a fundamental problem in many areas of data mining, machine learning and computer vision. The performance of traditional hierarchical structure (tree) based methods decreases …

graph construction

Graph Laplacians on Shared Nearest Neighbor graphs and graph Laplacians on $k$-Nearest Neighbor graphs having the same limit

2023-02-24 · A. Martina Neuman

A Shared Nearest Neighbor (SNN) graph is a type of graph construction using shared nearest neighbor information, which is a secondary similarity measure based on the rankings induced by a primary $k$-nearest neighbor ($k…

graph construction