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...
Main Authors: | Zhang, L, Xu, D, Arnab, A, Torr, PHS |
---|---|
Formato: | Conference item |
Idioma: | English |
Publicado: |
IEEE
2020
|
Títulos similares
-
Dynamic graph message passing networks for visual recognition
por: Zhang, L, et al.
Publicado: (2022) -
Graph inductive biases in transformers without message passing
por: Ma, L, et al.
Publicado: (2023) -
Graph inductive biases in transformers without message passing
por: Ma, L, et al.
Publicado: (2023) -
Polarized message-passing in graph neural networks
por: He, Tiantian, et al.
Publicado: (2024) -
A graph neural network with negative message passing and uniformity maximization for graph coloring
por: Xiangyu Wang, et al.
Publicado: (2024-03-01)