Discrete Linear Canonical Transform on Graphs: Uncertainty Principle and Sampling
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916329064235008 |
|---|---|
| author | Zhang, Yu Li, Bing-Zhao |
| author_facet | Zhang, Yu Li, Bing-Zhao |
| contents | With an increasing influx of classical signal processing methodologies into the field of graph signal processing, approaches grounded in discrete linear canonical transform have found application in graph signals. In this paper, we initially propose the uncertainty principle of the graph linear canonical transform (GLCT), which is based on a class of graph signals maximally concentrated in both vertex and graph spectral domains. Subsequently, leveraging the uncertainty principle, we establish conditions for recovering bandlimited signals of the GLCT from a subset of samples, thereby formulating the sampling theory for the GLCT. We elucidate interesting connections between the uncertainty principle and sampling. Further, by employing sampling set selection and experimental design sampling strategies, we introduce optimal sampling operators in the GLCT domain. Finally, we evaluate the performance of our methods through simulations and numerical experiments across applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_19660 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Discrete Linear Canonical Transform on Graphs: Uncertainty Principle and Sampling Zhang, Yu Li, Bing-Zhao General Mathematics With an increasing influx of classical signal processing methodologies into the field of graph signal processing, approaches grounded in discrete linear canonical transform have found application in graph signals. In this paper, we initially propose the uncertainty principle of the graph linear canonical transform (GLCT), which is based on a class of graph signals maximally concentrated in both vertex and graph spectral domains. Subsequently, leveraging the uncertainty principle, we establish conditions for recovering bandlimited signals of the GLCT from a subset of samples, thereby formulating the sampling theory for the GLCT. We elucidate interesting connections between the uncertainty principle and sampling. Further, by employing sampling set selection and experimental design sampling strategies, we introduce optimal sampling operators in the GLCT domain. Finally, we evaluate the performance of our methods through simulations and numerical experiments across applications. |
| title | Discrete Linear Canonical Transform on Graphs: Uncertainty Principle and Sampling |
| topic | General Mathematics |
| url | https://arxiv.org/abs/2403.19660 |