Graph signal interpolation with Positive Definite Graph Basis Functions
For the interpolation of graph signals with generalized shifts of a graph basis function (GBF), we introduce the concept of positive definite functions on graphs. This concept merges kernel-based interpolation with spectral theory on graphs and can be regarded as a graph analog of radial basis function interpolation in euclidean spaces or spherical basis functions. We provide several descriptions of positive definite functions on graphs, the most relevant one is a Bochner-type characterization in terms of positive Fourier coefficients. These descriptions allow us to design GBF's and to study GBF interpolation in more detail: we are able to characterize the native spaces of the interpolants, we provide explicit estimates for the interpolation error and obtain bounds for the numerical stability. As a final application, we show how GBF interpolation can be used to get quadrature formulas on graphs.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Learning Sparse Graph Laplacian with K Eigenvector Prior via Iterative GLASSO and Projection
Learning a suitable graph is an important precursor to many graph signal processing (GSP) pipelines, such as graph spectral signal compression and denoising. Previous graph learning algorithms either i) make some assumpt…
DenoisingGraph LearningRobust Semi-Supervised Graph Classifier Learning with Negative Edge Weights
In a semi-supervised learning scenario, (possibly noisy) partially observed labels are used as input to train a classifier, in order to assign labels to unclassified samples. In this paper, we study this classifier learn…
Sign-Aware Multistate Jaccard Kernels and Geometry for Real and Complex-Valued Signals
We introduce a sign-aware, multistate Jaccard/Tanimoto framework that extends overlap-based distances from nonnegative vectors and measures to arbitrary real- and complex-valued signals while retaining bounded metric and…
Feature EngineeringCommunity Detection with a Subsampled Semidefinite Program
Semidefinite programming is an important tool to tackle several problems in data science and signal processing, including clustering and community detection. However, semidefinite programs are often slow in practice, so …
ClusteringCommunity DetectionStochastic Block ModelTwo Channel Filter Banks on Arbitrary Graphs with Positive Semi Definite Variation Operators
We propose novel two-channel filter banks for signals on graphs. Our designs can be applied to arbitrary graphs, given a positive semi definite variation operator, while using arbitrary vertex partitions for downsampling…