Blue-Noise Sampling on Graphs
In the area of graph signal processing, a graph is a set of nodes arbitrarily connected by weighted links; a graph signal is a set of scalar values associated with each node; and sampling is the problem of selecting an optimal subset of nodes from which a graph signal can be reconstructed. This paper proposes the use of spatial dithering on the vertex domain of the graph, as a way to conveniently find statistically good sampling sets. This is done establishing that there is a family of good sampling sets characterized on the vertex domain by a maximization of the distance between sampling nodes; in the Fourier domain, these are characterized by spectrums that are dominated by high frequencies referred to as blue-noise. The theoretical connection between blue-noise sampling on graphs and previous results in graph signal processing is also established, explaining the advantages of the proposed approach. Restricting our analysis to undirected and connected graphs, numerical tests are performed in order to compare the effectiveness of blue-noise sampling against other approaches.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Gaussian Blue Noise
Among the various approaches for producing point distributions with blue noise spectrum, we argue for an optimization framework using Gaussian kernels. We show that with a wise selection of optimization parameters, this …
CoG: Controllable Graph Reasoning via Relational Blueprints and Failure-Aware Refinement over Knowledge Graphs
Large Language Models (LLMs) have demonstrated remarkable reasoning capabilities but often grapple with reliability challenges like hallucinations. While Knowledge Graphs (KGs) offer explicit grounding, existing paradigm…
Knowledge GraphsBlue noise for diffusion models
Most of the existing diffusion models use Gaussian noise for training and sampling across all time steps, which may not optimally account for the frequency contents reconstructed by the denoising network. Despite the div…
DenoisingLocal-Global History-aware Contrastive Learning for Temporal Knowledge Graph Reasoning
Temporal knowledge graphs (TKGs) have been identified as a promising approach to represent the dynamics of facts along the timeline. The extrapolation of TKG is to predict unknowable facts happening in the future, holdin…
Contrastive LearningKnowledge GraphsCoherence-driven inference for cybersecurity
Large language models (LLMs) can compile weighted graphs on natural language data to enable automatic coherence-driven inference (CDI) relevant to red and blue team operations in cybersecurity. This represents an early a…