NANAOct 2, 2017

A Graph Framework for Manifold-valued Data

arXiv:1702.0529310 citationsh-index: 13
AI Analysis

It extends graph-based variational and PDE methods to manifold-valued data, enabling regularization tasks like total variation and Tikhonov for non-Euclidean data, which is relevant for fields like medical imaging and remote sensing.

This paper generalizes graph-based frameworks for discrete calculus from real- and vector-valued functions to manifold-valued data, introducing operators like isotropic and anisotropic graph p-Laplacians for p≥1. Numerical results on synthetic and real-world data (DTI, LiDAR) demonstrate the framework's applicability.

Graph-based methods have been proposed as a unified framework for discrete calculus of local and nonlocal image processing methods in the recent years. In order to translate variational models and partial differential equations to a graph, certain operators have been investigated and successfully applied to real-world applications involving graph models. So far the graph framework has been limited to real- and vector-valued functions on Euclidean domains. In this paper we generalize this model to the case of manifold-valued data. We introduce the basic calculus needed to formulate variational models and partial differential equations for manifold-valued functions and discuss the proposed graph framework for two particular families of operators, namely, the isotropic and anisotropic graph~$p$-Laplacian operators, $p\geq1$. Based on the choice of $p$ we are in particular able to solve optimization problems on manifold-valued functions involving total variation ($p=1$) and Tikhonov ($p=2$) regularization. Finally, we present numerical results from processing both synthetic as well as real-world manifold-valued data, e.g., from diffusion tensor imaging (DTI) and light detection and ranging (LiDAR) data.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes