paper-with-me

홈 › Papers

Generalized Design of Sampling Kernels for 2-D FRI Signals

2019-02-19

One of the interesting problems in the finite-rate-of-innovation signal sampling framework is the design of compactly supported sampling kernels. In this paper, we present a generic framework for designing sampling kernels in 2-D. We consider both separable and nonseparable kernels. The design is carried out in the frequency domain, where a set of alias cancellation conditions are imposed on the kernel's frequency response. The Paley-Wiener theorem for 2-D signals is invoked to arrive at admissible kernels with a compact support. As a specific case, we show that a certain separable extension of the 1-D design framework results in 2-D sum-of-modulated-spline (SMS) kernels. Similar to their 1-D counterparts, the 2-D SMS kernels have the attractive feature of reproducing a class of 2-D polynomial-modulated exponentials of a desired order. Also, the support of the kernels is independent of the order. The design framework is generic and also allows one to design nonseparable sampling kernels. To this end, we demonstrate the design of a nonseparable kernel and present simulation results.

📄 PDF Abstract BibTeX arXiv:1902.02732

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Sampling and Reconstruction of Sparse Signals in Shift-Invariant Spaces: Generalized Shannon's Theorem Meets Compressive Sensing

2020-10-29 · Tin Vlašić, Damir Seršić

This paper introduces a novel framework and corresponding methods for sampling and reconstruction of sparse signals in shift-invariant (SI) spaces. We reinterpret the random demodulator, a system that acquires sparse ban…

Compressive Sensing

Generalized Graph Signal Sampling by Difference-of-Convex Optimization

2023-06-26 · Keitaro Yamashita, Kazuki Naganuma, Shunsuke Ono

We propose a desigining method of a flexible sampling operator for graph signals via a difference-of-convex (DC) optimization algorithm. A fundamental challenge in graph signal processing is sampling, especially for grap…

Graph Signal Sampling Under Stochastic Priors

2022-06-01 · Junya Hara, Yuichi Tanaka, Yonina C. Eldar

We propose a generalized sampling framework for stochastic graph signals. Stochastic graph signals are characterized by graph wide sense stationarity (GWSS) which is an extension of wide sense stationarity (WSS) for stan…

A spectral mixture representation of isotropic kernels to generalize random Fourier features

2024-11-05 · Nicolas Langrené, Xavier Warin, Pierre Gruet

Rahimi and Recht (2007) introduced the idea of decomposing positive definite shift-invariant kernels by randomly sampling from their spectral distribution. This famous technique, known as Random Fourier Features (RFF), i…

Gaussian Processes

Learning to Sample: Data-Driven Sampling and Reconstruction of FRI Signals

2021-06-28 · Satish Mulleti, Haiyang Zhang, Yonina C. Eldar

Finite-rate-of-innovation (FRI) signals are ubiquitous in applications such as radar, ultrasound, and time of flight imaging. Due to their finite degrees of freedom, FRI signals can be sampled at sub-Nyquist rates using …

compressed sensing