Partition of unity methods for signal processing on graphs
From MaRDI portal
(Redirected from Publication:2048685)
Abstract: Partition of unity methods (PUMs) on graphs are simple and highly adaptive auxiliary tools for graph signal processing. Based on a greedy-type metric clustering and augmentation scheme, we show how a partition of unity can be generated in an efficient way on graphs. We investigate how PUMs can be combined with a local graph basis function (GBF) approximation method in order to obtain low-cost global interpolation or classification schemes. From a theoretical point of view, we study necessary prerequisites for the partition of unity such that global error estimates of the PUM follow from corresponding local ones. Finally, properties of the PUM as cost-efficiency and approximation accuracy are investigated numerically.
Recommendations
Cites work
- A Best Possible Heuristic for the k-Center Problem
- A least squares radial basis function partition of unity method for solving PDEs
- A Particle-Partition of Unity Method for the Solution of Elliptic, Parabolic, and Hyperbolic PDEs
- Adaptive meshless refinement schemes for RBF-PUM collocation
- Clustering to minimize the maximum intercluster distance
- Error indicators and refinement strategies for solving Poisson problems through a RBF partition of unity collocation scheme
- Geometric approximation algorithms
- Graph signal sampling and interpolation based on clusters and averages
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 1950576 (Why is no real title available?)
- scientific article; zbMATH DE number 1972823 (Why is no real title available?)
- scientific article; zbMATH DE number 1981794 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Interpolating splines on graphs for data science applications
- Kernel-Based Reconstruction of Graph Signals
- Kernels and regularization on graphs.
- Local smoothness of graph signals
- Matrix Analysis
- Meshfree approximation methods with Matlab. With CD-ROM.
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- Optimal selection of local approximants in RBF-PU interpolation
- Sampling by averages and average splines on Dirichlet spaces and on combinatorial graphs
- Sampling in Paley-Wiener spaces on combinatorial graphs
- Scattered Data Approximation
- Shapes of Uncertainty in Spectral Graph Theory
- Spatially distributed sampling and reconstruction
- The partition of unity finite element method: basic theory and applications
- Theory of Reproducing Kernels
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
- Vertex-frequency analysis on graphs
Cited in
(19)- Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
- Overview of the topical collection: harmonic analysis on combinatorial graphs
- A locally stabilized radial basis function partition of unity technique for the sine-Gordon system in nonlinear optics
- Discrete Signal Processing on Graphs
- scientific article; zbMATH DE number 2154133 (Why is no real title available?)
- Node-bound communities for partition of unity interpolation on graphs
- An efficient localized meshless collocation method for the two-dimensional Burgers-type equation arising in fluid turbulent flows
- Adaptive residual Refinement in an RBF Finite difference scheme for 2D time-dependent problems
- An RBF-PUM finite difference scheme for forward-backward heat equation
- Efficient truncated randomized SVD for mesh-free kernel methods
- The RBF partition of unity method for a 2D time-fractional parabolic equation
- GBFPUM -- a MATLAB package for partition of unity based signal interpolation and approximation on graphs
- Reconstruction of volatility surfaces: a first computational study
- Parameter tuning in the radial kernel-based partition of unity method by Bayesian optimization
- Quadrature formulas on combinatorial graphs
- Exploration of kernel parameters in signal GBF-PUM approximation on graphs
- Community detection methods for GBF-PUM signal approximation on graphs
- Numerical modeling of the ion-acoustic solitary waves arising in nonlinear dispersive system
- Adaptive residual subsampling algorithms for kernel interpolation based on cross validation techniques
This page was built for publication: Partition of unity methods for signal processing on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048685)
