Signal Recovery on Graphs: Random versus Experimentally Designed Sampling
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 generalizes the bandlimited class and is similar to the globally smooth class. We then propose two recovery strategies based on random sampling and experimentally designed sampling. The proposed recovery strategy based on experimentally designed sampling is similar to the leverage scores used in the matrix approximation. We show that while both strategies are unbiased estimators for the low-frequency components, the convergence rate of experimentally designed sampling is much faster than that of random sampling when a graph is irregular. We validate the proposed recovery strategies on three specific graphs: a ring graph, an Erd\H{o}s-R\'enyi graph, and a star graph. The simulation results support the theoretical analysis.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
DeepCodec: Adaptive Sensing and Recovery via Deep Convolutional Neural Networks
In this paper we develop a novel computational sensing framework for sensing and recovering structured signals. When trained on a set of representative signals, our framework learns to take undersampled measurements and …
Compressive SensingMaking sense of randomness: an approach for fast recovery of compressively sensed signals
In compressed sensing (CS) framework, a signal is sampled below Nyquist rate, and the acquired compressed samples are generally random in nature. However, for efficient estimation of the actual signal, the sensing matrix…
compressed sensingDecoderDictionary LearningGraph sampling with determinantal processes
We present a new random sampling strategy for k-bandlimited signals defined on graphs, based on determinantal point processes (DPP). For small graphs, ie, in cases where the spectrum of the graph is accessible, we exhibi…
Graph SamplingPoint ProcessesNon-Bayesian Estimation Framework for Signal Recovery on Graphs
Graph signals arise from physical networks, such as power and communication systems, or as a result of a convenient representation of data with complex structure, such as social networks. We consider the problem of gener…
Signal Recovery on Graphs: Variation Minimization
We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted…
Anomaly DetectionGeneral ClassificationMatrix CompletionRecommendation Systems