Dynamic graph message passing networks
Modelling long-range dependencies is critical for scene understanding tasks in computer vision. Although CNNs have excelled in many vision tasks, they are still limited in capturing long-range structured relationships as they typically consist of layers of local kernels. A fully-connected graph is b...
المؤلفون الرئيسيون: | Zhang, L, Xu, D, Arnab, A, Torr, PHS |
---|---|
التنسيق: | Conference item |
اللغة: | English |
منشور في: |
IEEE
2020
|
مواد مشابهة
-
Dynamic graph message passing networks for visual recognition
حسب: Zhang, L, وآخرون
منشور في: (2022) -
Graph inductive biases in transformers without message passing
حسب: Ma, L, وآخرون
منشور في: (2023) -
Graph inductive biases in transformers without message passing
حسب: Ma, L, وآخرون
منشور في: (2023) -
Polarized message-passing in graph neural networks
حسب: He, Tiantian, وآخرون
منشور في: (2024) -
A graph neural network with negative message passing and uniformity maximization for graph coloring
حسب: Xiangyu Wang, وآخرون
منشور في: (2024-03-01)