paper-with-me

홈 › Papers

WiGNet: Windowed Vision Graph Neural Network

2024-10-01 · Gabriele Spadaro, Marco Grangetto, Attilio Fiandrotti, Enzo Tartaglione, Jhony H. Giraldo

In recent years, Graph Neural Networks (GNNs) have demonstrated strong adaptability to various real-world challenges, with architectures such as Vision GNN (ViG) achieving state-of-the-art performance in several computer vision tasks. However, their practical applicability is hindered by the computational complexity of constructing the graph, which scales quadratically with the image size. In this paper, we introduce a novel Windowed vision Graph neural Network (WiGNet) model for efficient image processing. WiGNet explores a different strategy from previous works by partitioning the image into windows and constructing a graph within each window. Therefore, our model uses graph convolutions instead of the typical 2D convolution or self-attention mechanism. WiGNet effectively manages computational and memory complexity for large image sizes. We evaluate our method in the ImageNet-1k benchmark dataset and test the adaptability of WiGNet using the CelebA-HQ dataset as a downstream task with higher-resolution images. In both of these scenarios, our method achieves competitive results compared to previous vision GNNs while keeping memory and computational complexity at bay. WiGNet offers a promising solution toward the deployment of vision GNNs in real-world applications. We publicly released the code at https://github.com/EIDOSLAB/WiGNet.

📄 PDF Abstract BibTeX arXiv:2410.00807

Code (1)

eidoslab/wignet 공식 구현 pytorch

Tasks

Graph Neural Network

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Graph Neural Network 설명 없음

Similar Papers 제목 키워드 기반

Frames and vertex-frequency representations in graph fractional Fourier domain

2024-12-28 · Linbo Shang, Zhichao Zhang

Vertex-frequency analysis, particularly the windowed graph Fourier transform (WGFT), is a significant challenge in graph signal processing. Tight frame theories is known for its low computational complexity in signal rec…

Anomaly DetectionComputational Efficiency

Hierarchical Windowed Graph Attention Network and a Large Scale Dataset for Isolated Indian Sign Language Recognition

2024-07-19 · Suvajit Patra, Arkadip Maitra, Megha Tiwari, K. Kumaran 외

Automatic Sign Language (SL) recognition is an important task in the computer vision community. To build a robust SL recognition system, we need a considerable amount of data which is lacking particularly in Indian sign …

Graph AttentionHand Gesture RecognitionSign Language Recognition

Pose Graph Optimization for Unsupervised Monocular Visual Odometry

2019-03-15 · Yang Li, Yoshitaka Ushiku, Tatsuya Harada

Unsupervised Learning based monocular visual odometry (VO) has lately drawn significant attention for its potential in label-free leaning ability and robustness to camera parameters and environmental variations. However,…

Loop Closure DetectionMonocular Visual OdometryVisual Odometry

Understanding Graph Neural Networks with Generalized Geometric Scattering Transforms

2019-11-14 · Michael Perlmutter, Alexander Tong, Feng Gao, Guy Wolf 외

The scattering transform is a multilayered wavelet-based deep learning architecture that acts as a model of convolutional neural networks. Recently, several works have introduced generalizations of the scattering transfo…

Windowed MAPF with Completeness Guarantees

2024-10-02 · Rishi Veerapaneni, Muhammad Suhail Saleem, Jiaoyang Li, Maxim Likhachev

Traditional multi-agent path finding (MAPF) methods try to compute entire start-goal paths which are collision free. However, computing an entire path can take too long for MAPF systems where agents need to replan fast. …

Heuristic SearchMulti-Agent Path Finding