Splines and wavelets on circulant graphs
From MaRDI portal
Publication:2325545
Abstract: We present novel families of wavelets and associated filterbanks for the analysis and representation of functions defined on circulant graphs. In this work, we leverage the inherent vanishing moment property of the circulant graph Laplacian operator, and by extension, the e-graph Laplacian, which is established as a parameterization of the former with respect to the degree per node, for the design of vertex-localized and critically-sampled higher-order graph (e-)spline wavelet filterbanks, which can reproduce and annihilate classes of (exponential) polynomial signals on circulant graphs. In addition, we discuss similarities and analogies of the detected properties and resulting constructions with splines and spline wavelets in the Euclidean domain. Ultimately, we consider generalizations to arbitrary graphs in the form of graph approximations, with focus on graph product decompositions. In particular, we proceed to show how the use of graph products facilitates a multi-dimensional extension of the proposed constructions and properties.
Recommendations
Cites work
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 741107 (Why is no real title available?)
- scientific article; zbMATH DE number 3438337 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A Multiscale Pyramid Transform for Graph Signals
- A class of Laplacian multiwavelets bases for high-dimensional data
- A variational approach to spline functions theory
- Cardinal exponential splines: part I - theory and filtering algorithms
- Cardinal exponential splines: part II - think analog, act digital
- Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
- Diffusion wavelets
- Discrete Green's functions
- Discrete Signal Processing on Graphs: Frequency Analysis
- Eigenvalue bounds for the signless laplacian
- Estimation of Laplacian spectra of direct and strong product graphs
- Generalized Daubechies Wavelet Families
- Handbook of product graphs
- Kron Reduction of Graphs With Applications to Electrical Networks
- Kronecker graphs: an approach to modeling networks
- Kronecker product and SVD approximations in image restoration
- Laplacians and the Cheeger inequality for directed graphs
- On the Laplacian spectra of product graphs
- Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
- Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix
- Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
- Self-Similarity: Part I—Splines and Operators
- Signless Laplacians of finite graphs
- Spectra of graphs
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
- Wavelets on graphs via spectral graph theory
Cited in
(9)- Quadrature formulas on combinatorial graphs
- Polynomial graph filters of multiple shifts and distributed implementation of inverse filtering
- Locally supported, quasi-interpolatory bases for the approximation of functions on graphs
- Perfect reconstruction two-channel filter banks on arbitrary graphs
- Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs
- Intertwining wavelets or multiresolution analysis on graphs through random forests
- On circulant matrices for certain periodic spline and histospline projections
- Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
- Graph Fourier transform based on singular value decomposition of the directed Laplacian
This page was built for publication: Splines and wavelets on circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2325545)