Akademik Veri Yönetim Sistemi
APPLIED SCIENCES, cilt.15, sa.17, ss.9503-9527, 2025 (SCI-Expanded)
Point cloud segmentation underpins various applications in geospatial analysis, such as autonomous navigation, urban planning, and management. Kernel Point Convolution (KPConv) has become a de facto standard for such tasks, yet its fixed geometric kernel limits the modeling of fine-grained contextual relationships—particularly in heterogeneous, real-world point cloud data. In this paper, we introduce the adaptation of a Local Contextual Attention (LCA) mechanism for the KPConv network, with reweighting kernel coefficients based on local feature similarity in the spatial proximity domain. Crucially, our lightweight design preserves KPConv’s distance-based weighting while embedding adaptive context aggregation, improving boundary delineation and small-object recognition without incurring significant computational or memory overhead. Our comprehensive experiments validate the efficacy of the proposed LCA block across multiple challenging benchmarks. Specifically, our method significantly improves segmentation performance by achieving a 20% increase in mean Intersection over Union (mIoU) on the STPLS3D dataset. Furthermore, we observe a 16% enhancement in mean F1 score (mF1) on the Hessigheim3D benchmark and a notable 15% improvement in mIoU on the Toronto3D dataset. These performance gains place LCA-KPConv among the top-performing methods reported in these benchmark evaluations. Trained models, prediction results, and the code of LCA are available in a GitHub opensource repository.