کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
8898238 1631327 2018 35 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Random sampling of bandlimited signals on graphs
ترجمه فارسی عنوان
نمونه برداری تصادفی از سیگنال های باندینگ در نمودار
کلمات کلیدی
پردازش سیگنال گراف، نمونه برداری، سنجش فشرده،
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات آنالیز ریاضی
چکیده انگلیسی
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 the graph structure, and its performance depends on a parameter called the graph coherence. On the contrary, the second strategy is adaptive but yields optimal results. Indeed, no more than O(klog⁡(k)) measurements are sufficient to ensure an accurate and stable recovery of all k-bandlimited signals. This second strategy is based on a careful choice of the sampling distribution, which can be estimated quickly. Then, we propose a computationally efficient decoder to reconstruct k-bandlimited signals from their samples. We prove that it yields accurate reconstructions and that it is also stable to noise. Finally, we conduct several experiments to test these techniques.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied and Computational Harmonic Analysis - Volume 44, Issue 2, March 2018, Pages 446-475
نویسندگان
, , , ,