paper-with-me

Papers

Irregularity-Aware Bandlimited Approximation for Graph Signal Interpolation

2023-12-14 · Darukeesan Pakiyarajah, Eduardo Pavez, Antonio Ortega

In most work to date, graph signal sampling and reconstruction algorithms are intrinsically tied to graph properties, assuming bandlimitedness and optimal sampling set choices. However, practical scenarios often defy these assumptions, leading to suboptimal performance. In the context of sampling and reconstruction, graph irregularities lead to varying contributions from sampled nodes for interpolation and differing levels of reliability for interpolated nodes. The existing GFT-based methods in the literature make bandlimited signal approximations without considering graph irregularities and the relative significance of nodes, resulting in suboptimal reconstruction performance under various mismatch conditions. In this paper, we leverage the GFT equipped with a specific inner product to address graph irregularities and account for the relative importance of nodes during the bandlimited signal approximation and interpolation process. Empirical evidence demonstrates that the proposed method outperforms other GFT-based approaches for bandlimited signal interpolation in challenging scenarios, such as sampling sets selected independently of the underlying graph, low sampling rates, and high noise levels.

📄 PDF Abstract BibTeX arXiv:2312.09405

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Signal Recovery on Graphs: Random versus Experimentally Designed Sampling

2015-04-21 · Siheng Chen, Rohan Varma, Aarti Singh, Jelena Kovačević

We study signal recovery on graphs based on two sampling strategies: random sampling and experimentally designed sampling. We propose a new class of smooth graph signals, called approximately bandlimited, which generaliz…

Random sampling of bandlimited signals on graphs

2015-11-16 · Gilles Puy, Nicolas Tremblay, Rémi Gribonval, Pierre Vandergheynst

We study the problem of sampling k-bandlimited signals on graphs. We propose two sampling strategies that consist in selecting a small subset of nodes at random. The first strategy is non-adaptive, i.e., independent of t…

Decoder

Graph-Based Signal Sampling with Adaptive Subspace Reconstruction for Spatially-Irregular Sensor Data

2024-09-14 · Darukeesan Pakiyarajah, Eduardo Pavez, Antonio Ortega

Choosing an appropriate frequency definition and norm is critical in graph signal sampling and reconstruction. Most previous works define frequencies based on the spectral properties of the graph and use the same frequen…

Super-resolution of periodic signals from short sequences of samples

2020-10-22 · Marek W. Rupniewski

Reconstruction of undersampled periodic signals of unknown period is an important signal processing operation. It is especially difficult operation when the sequences of samples are short and no information on the inter-…

Super-Resolution

Active Sampling for Approximately Bandlimited Graph Signals

2019-02-16

This paper investigates the active sampling for estimation of approximately bandlimited graph signals. With the assistance of a graph filter, an approximately bandlimited graph signal can be formulated by a Gaussian rand…