The Role of Receptive Fields in Graph Neural Networks for Spatially-Aware Tasks

Master Thesis (2026)
Author(s)

V. Srinidhi (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Contributor(s)

J.C. van Gemert – Mentor (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Hesam Araghi – Mentor (TU Delft - Electrical Engineering, Mathematics and Computer Science)

M. Khosla – Graduation committee member (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Faculty
Electrical Engineering, Mathematics and Computer Science
More Info
expand_more
Publication Year
2026
Language
English
Graduation Date
30-06-2026
Awarding Institution
Delft University of Technology
Programme
Computer Science, Data Science and Artificial Intelligence Technology
Faculty
Electrical Engineering, Mathematics and Computer Science
Page Views
107
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

In a Convolutional Neural Network (CNN) the receptive field is a region of the input image that a kernel aggregates features from. Successive layers in a CNN expand the receptive field of a kernel by a fixed amount, and this growth corresponds to a consistent metric region across the entire input. The receptive field in a Graph Neural Network (GNN) depends on the graph topology, which changes based on the method of construction. k-Nearest Neighbor (k-NN) construction produces edges whose physical length varies with local point density to keep node degree constant, leading to non-uniform growth of the receptive field. We hypothesize that this inconsistency degrades GNN accuracy on tasks where metric distances carry meaning, and that radius-based graph construction is preferable, since fixing a distance threshold makes the receptive field grow
uniformly in metric space with each layer. We test both construction methods under the sparse, non-uniform sampling conditions typical of real-world point clouds. To enable these comparisons, we introduce PointMNIST, a 2D point cloud control dataset designed to isolate and empirically expose the fundamental differences between radius and kNN graph construction. We further show that augmenting point clouds with regularly distributed background points, a form of spatial “padding”, partially compensates for the distortions of k-NN construction, and restores the connec- tivity that radius graphs lose on sparse point clouds.

Files

License info not available