Shortest Paths in Graphs with Matrix-Valued Edges: Concepts, Algorithm and Application to 3D Multi-Shape Analysis

12/08/2021
by   Viktoria Ehm, et al.
0

Finding shortest paths in a graph is relevant for numerous problems in computer vision and graphics, including image segmentation, shape matching, or the computation of geodesic distances on discrete surfaces. Traditionally, the concept of a shortest path is considered for graphs with scalar edge weights, which makes it possible to compute the length of a path by adding up the individual edge weights. Yet, graphs with scalar edge weights are severely limited in their expressivity, since oftentimes edges are used to encode significantly more complex interrelations. In this work we compensate for this modelling limitation and introduce the novel graph-theoretic concept of a shortest path in a graph with matrix-valued edges. To this end, we define a meaningful way for quantifying the path length for matrix-valued edges, and we propose a simple yet effective algorithm to compute the respective shortest path. While our formalism is universal and thus applicable to a wide range of settings in vision, graphics and beyond, we focus on demonstrating its merits in the context of 3D multi-shape analysis.

READ FULL TEXT

page 5

page 7

page 8

page 12

research
08/06/2023

A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks

Given a directed graph of nodes and edges connecting them, a common prob...
research
06/13/2023

Expanding the Scope of DAWN: A Novel Version for Weighted Shortest Path Problem

The shortest path problem is a typical problem in graph theory with wide...
research
03/05/2019

Semi-dynamic shortest-path tree algorithms for directed graphs with arbitrary weights

Given a directed graph G with arbitrary real-valued weights, the single ...
research
09/15/2017

On the stability of network indices defined by means of matrix functions

Identifying important components in a network is one of the major goals ...
research
05/15/2023

Non-Separable Multi-Dimensional Network Flows for Visual Computing

Flows in networks (or graphs) play a significant role in numerous comput...
research
07/29/2023

Search for shortest paths based on the projective description of unweighted graphs

A new method of representing graph projections in computer memory is pro...
research
12/24/2020

A Generalized A* Algorithm for Finding Globally Optimal Paths in Weighted Colored Graphs

Both geometric and semantic information of the search space is imperativ...

Please sign up or login with your details

Forgot password? Click here to reset