Perfect reconstruction two-channel filter banks on arbitrary graphs
From MaRDI portal
Publication:6042615
Abstract: This paper extends the existing theory of perfect reconstruction two-channel filter banks from bipartite graphs to non-bipartite graphs. By generalizing the concept of downsampling/upsampling we establish the frame of two-channel filter bank on arbitrary connected, undirected and weighted graphs. Then the equations for perfect reconstruction of the filter banks are presented and solved under proper conditions. Algorithms for designing orthogonal and biorthogonal banks are given and two typical orthogonal two-channel filter banks are calculated. The locality and approximation properties of such filter banks are discussed theoretically and experimentally.
Recommendations
- Theory and design of M-channel maximally decimated quadrature mirror filters with arbitrary M, having the perfect-reconstruction property
- Two-channel perfect reconstruction FIR filter banks over commutative rings.
- scientific article; zbMATH DE number 741105
- A comparison of design methods for 2-D FIR orthogonal perfect reconstruction filter banks
- scientific article; zbMATH DE number 878860
Cites work
- A Multiscale Pyramid Transform for Graph Signals
- Advanced coarsening schemes for graph partitioning
- Approximation theorems on graphs
- Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
- Diffusion wavelets
- Discrete Signal Processing on Graphs
- Engineering multilevel graph partitioning algorithms
- Graph Fourier transform based on \(\ell_1\) norm variation minimization
- Graph reduction with spectral and cut guarantees
- scientific article; zbMATH DE number 3014451 (Why is no real title available?)
- scientific article; zbMATH DE number 794709 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Kron Reduction of Graphs With Applications to Electrical Networks
- Parseval wavelets on hierarchical graphs
- Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
- Relaxation-based coarsening and multiscale graph organization
- Sampling, filtering and sparse approximations on combinatorial graphs
- Sparse representation on graphs by tight wavelet frames and applications
- Spectrum-Adapted Tight Graph Wavelet and Vertex-Frequency Frames
- Splines and wavelets on circulant graphs
- Ten Lectures on Wavelets
- Wavelets on graphs via spectral graph theory
Cited in
(8)- Handling finite length signals borders in two-channel multirate filter banks for perfect reconstruction
- Two-channel perfect reconstruction FIR filter banks over commutative rings.
- Polynomial graph filters of multiple shifts and distributed implementation of inverse filtering
- scientific article; zbMATH DE number 2084559 (Why is no real title available?)
- scientific article; zbMATH DE number 2084561 (Why is no real title available?)
- Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
- scientific article; zbMATH DE number 2147847 (Why is no real title available?)
- Multidimensional perfect reconstruction filter banks: An approach of algebraic geometry
This page was built for publication: Perfect reconstruction two-channel filter banks on arbitrary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042615)