paper-with-me

Papers

A Learned Generalized Geodesic Distance Function-Based Approach for Node Feature Augmentation on Graphs

2024-07-01 · Amitoz Azad, Yuan Fang

Geodesic distances on manifolds have numerous applications in image processing, computer graphics and computer vision. In this work, we introduce an approach called `LGGD' (Learned Generalized Geodesic Distances). This method involves generating node features by learning a generalized geodesic distance function through a training pipeline that incorporates training data, graph topology and the node content features. The strength of this method lies in the proven robustness of the generalized geodesic distances to noise and outliers. Our contributions encompass improved performance in node classification tasks, competitive results with state-of-the-art methods on real-world graph datasets, the demonstration of the learnability of parameters within the generalized geodesic equation on graph, and dynamic inclusion of new labels.

📄 PDF Abstract BibTeX arXiv:2407.01194

Code (0)

등록된 구현이 없습니다.

Tasks

Node Classification

Similar Papers 제목 키워드 기반

Geodesic Distance Between Graphs: A Spectral Metric for Assessing the Stability of Graph Neural Networks

2024-06-15 · Soumen Sikder Shuvo, Ali Aghdaei, Zhuo Feng

This paper presents a spectral framework for assessing the generalization and stability of Graph Neural Networks (GNNs) by introducing a Graph Geodesic Distance (GGD) metric. For two different graphs with the same number…

Graph Matching

Geodesic Semantic Search: Cartographic Navigation of Citation Graphs with Learned Local Riemannian Maps

2026-02-27 · Brandon Yee, Lucas Wang, Kundana Kommini arxiv

We present Geodesic Semantic Search (GSS), a retrieval system that learns node-specific Riemannian metrics on citation graphs to enable geometry-aware semantic search. Unlike standard embedding-based retrieval that relie…

Geodesic Exponential Kernels: When Curvature and Linearity Conflict

2014-11-02 · CVPR 2015 6 · Aasa Feragen, Francois Lauze, Søren Hauberg

We consider kernel methods on general geodesic metric spaces and provide both negative and positive results. First we show that the common Gaussian kernel can only be generalized to a positive definite kernel on a geodes…

NeuroGF: A Neural Representation for Fast Geodesic Distance and Path Queries

2023-06-01 · NeurIPS 2023 11 · Qijian Zhang, Junhui Hou, Yohanes Yudhi Adikusuma, Wenping Wang 외

Geodesics are essential in many geometry processing applications. However, traditional algorithms for computing geodesic distances and paths on 3D mesh models are often inefficient and slow. This makes them impractical f…

3D geometry

Geodesic-HOF: 3D Reconstruction Without Cutting Corners

2020-06-14 · Ziyun Wang, Eric A. Mitchell, Volkan Isler, Daniel D. Lee

Single-view 3D object reconstruction is a challenging fundamental problem in computer vision, largely due to the morphological diversity of objects in the natural world. In particular, high curvature regions are not alwa…

3D Object Reconstruction3D ReconstructionDiversityObject+1