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 |
---|---|
格式: | Conference item |
语言: | English |
出版: |
IEEE
2020
|
相似书籍
-
Dynamic graph message passing networks for visual recognition
由: Zhang, L, et al.
出版: (2022) -
Graph inductive biases in transformers without message passing
由: Ma, L, et al.
出版: (2023) -
Graph inductive biases in transformers without message passing
由: Ma, L, et al.
出版: (2023) -
Polarized message-passing in graph neural networks
由: He, Tiantian, et al.
出版: (2024) -
Rethinking the message passing for graph-level classification tasks in a category-based view
由: Lei, Han, et al.
出版: (2025)