کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6957132 | 1451915 | 2018 | 36 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Signal processing on graphs: Case of sampling in Paley-Wiener spaces
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
پردازش سیگنال
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Given a weighted undirected graph, this paper focuses on the sampling problem of uniquely recovering Paley-Wiener functions from a sampled set of vertices. In accordance with the measures of connectivity introduced by Pesenson [30], we address two optimization problems related to discrete sampling on graphs via the so-called uniqueness sets, namely: (i) determining the maximal bandwidth of the signal, which can be perfectly reconstructed by a sampling subset of vertices with a cardinality smaller than a given value; (ii) finding the minimal sampling subset of graph vertices, which guarantees the complete reconstruction of at least a required signal bandwidth. In this sense, two integer linear programs are provided together with their complexity and solution approach. Since the uniqueness sets are described in terms of Poincaré-Wirtinger type inequalities, the used approximation of the true cut-off-frequency KS is only a lower bound of the Poincaré constant, through which the removable subset of vertices is characterized. In spite of this limitation, conducted computational experiments illustrate, however, a considerable decision support and a practical interest, as well as, highlight the pertinence of the used measure KS against the true cut-off-frequency for signal sampling on graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Signal Processing - Volume 152, November 2018, Pages 130-140
Journal: Signal Processing - Volume 152, November 2018, Pages 130-140
نویسندگان
Valeria Borodin, Hichem Snoussi, Faicel Hnaien, Nacima Labadie,