Multi-modal curriculum learning for semi-supervised image classification
Semi-supervised image classification aims to classify a large quantity of unlabeled images
by typically harnessing scarce labeled images. Existing semi-supervised methods often …
by typically harnessing scarce labeled images. Existing semi-supervised methods often …
Diffwire: Inductive graph rewiring via the lov\'asz bound
Graph Neural Networks (GNNs) have been shown to achieve competitive results to tackle
graph-related tasks, such as node and graph classification, link prediction and node and …
graph-related tasks, such as node and graph classification, link prediction and node and …
Sub-Markov random walk for image segmentation
A novel sub-Markov random walk (subRW) algorithm with label prior is proposed for seeded
image segmentation, which can be interpreted as a traditional random walker on a graph …
image segmentation, which can be interpreted as a traditional random walker on a graph …
A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching
In this paper, the problem of non-rigid shape recognition is studied from the perspective of
metric geometry. In particular, we explore the applicability of diffusion distances within the …
metric geometry. In particular, we explore the applicability of diffusion distances within the …
Effective resistance is more than distance: Laplacians, simplices and the Schur complement
K Devriendt - Linear Algebra and its Applications, 2022 - Elsevier
This article reviews and discusses a geometric perspective on the well-known fact in graph
theory that the effective resistance is a metric on the nodes of a graph. The classical proofs …
theory that the effective resistance is a metric on the nodes of a graph. The classical proofs …
Label propagation via teaching-to-learn and learning-to-teach
How to propagate label information from labeled examples to unlabeled examples over a
graph has been intensively studied for a long time. Existing graph-based propagation …
graph has been intensively studied for a long time. Existing graph-based propagation …
Biharmonic distance
Measuring distances between pairs of points on a 3D surface is a fundamental problem in
computer graphics and geometric processing. For most applications, the important …
computer graphics and geometric processing. For most applications, the important …
K-nearest neighbors in uncertain graphs
Complex networks, such as biological, social, and communication networks, often entail
uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of …
uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of …
Flexible diffusion scopes with parameterized laplacian for heterophilic graph learning
The ability of Graph Neural Networks (GNNs) to capture long-range and global topology
information is limited by the scope of conventional graph Laplacian, leading to unsatisfactory …
information is limited by the scope of conventional graph Laplacian, leading to unsatisfactory …
[BOOK][B] Image processing and analysis with graphs
The last two decades have witnessed the explosive growth of image production from digital
photographs to the medical scans, satellite images, and video films. Consequently, the …
photographs to the medical scans, satellite images, and video films. Consequently, the …