Two-Channel Filter Banks on Joint Time-Vertex Graphs with Oversampled Graph Laplacian Matrix
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914397207658496 |
|---|---|
| author | Zhang, Yu Li, Bing-Zhao |
| author_facet | Zhang, Yu Li, Bing-Zhao |
| contents | To address the limitations of conventional critically sampled graph filter banks in joint time-vertex signal processing, which require decomposing the joint graph into bipartite subgraphs and thus cannot fully exploit all temporal and spatial edges in a single-stage transform, we introduce the joint time-vertex oversampled graph Laplacian matrix. This operator enables the construction of bipartite extensions that preserve all edges of the original joint graph and supports redundant multiresolution representations. Based on this operator, we design two-channel joint time-vertex oversampled graph filter banks and develop efficient oversampling extensions using a $K$-coloring strategy. The proposed framework is applied to both graph signal and image/video denoising, modeling images as graph signals to leverage structural relationships. Extensive experiments demonstrate its effectiveness in decomposition, reconstruction, and denoising, achieving notable performance improvements over critically sampled and existing methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_11768 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Two-Channel Filter Banks on Joint Time-Vertex Graphs with Oversampled Graph Laplacian Matrix Zhang, Yu Li, Bing-Zhao General Mathematics To address the limitations of conventional critically sampled graph filter banks in joint time-vertex signal processing, which require decomposing the joint graph into bipartite subgraphs and thus cannot fully exploit all temporal and spatial edges in a single-stage transform, we introduce the joint time-vertex oversampled graph Laplacian matrix. This operator enables the construction of bipartite extensions that preserve all edges of the original joint graph and supports redundant multiresolution representations. Based on this operator, we design two-channel joint time-vertex oversampled graph filter banks and develop efficient oversampling extensions using a $K$-coloring strategy. The proposed framework is applied to both graph signal and image/video denoising, modeling images as graph signals to leverage structural relationships. Extensive experiments demonstrate its effectiveness in decomposition, reconstruction, and denoising, achieving notable performance improvements over critically sampled and existing methods. |
| title | Two-Channel Filter Banks on Joint Time-Vertex Graphs with Oversampled Graph Laplacian Matrix |
| topic | General Mathematics |
| url | https://arxiv.org/abs/2511.11768 |