System identification in dynamical sampling
17
TL;DR: This paper provides an algorithm based on a generalized Prony method for the case when both a and x are of finite impulse response and an upper bound of their support is known and performs a perturbation analysis based on the spectral properties of the operator A and initial state x, and verify the results by several numerical experiments.
read more
Abstract: We consider the problem of spatiotemporal sampling in a discrete infinite dimensional spatially invariant evolutionary process x(n) = Anx to recover an unknown convolution operator A given by a filter a?l1(?)$a \in \ell ^{1}(\mathbb {Z})$ and an unknown initial state x modeled as a vector in l2(?)$\ell ^{2}(\mathbb {Z})$. Traditionally, under appropriate hypotheses, any x can be recovered from its samples on ?$\mathbb {Z}$ and A can be recovered by the classical techniques of deconvolution. In this paper, we will exploit the spatiotemporal correlation and propose a new sampling scheme to recover A and x that allows us to sample the evolving states x,Ax,? ,AN?1x on a sub-lattice of ?$\mathbb {Z}$, and thus achieve a spatiotemporal trade off. The spatiotemporal trade off is motivated by several industrial applications (Lu and Vetterli, 2249---2252, 2009). Specifically, we show that {x(m?),Ax(m?),?,AN?1x(m?):N?2m}$\{x(m\mathbb {Z}), Ax(m\mathbb {Z}), \cdots , A^{N-1}x(m\mathbb {Z}): N \geq 2m\}$ contains enough information to recover a typical "low pass filter" a and x almost surely, thus generalizing the idea of the finite dimensional case in Aldroubi and Krishtal, arXiv:1412.1538 (2014). In particular, we provide an algorithm based on a generalized Prony method for the case when both a and x are of finite impulse response and an upper bound of their support is known. We also perform a perturbation analysis based on the spectral properties of the operator A and initial state x, and verify the results by several numerical experiments. Finally, we provide several other numerical techniques to stabilize the proposed method, with some examples to demonstrate the improvement.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Scalability of frames generated by dynamical operators
Roza Aceska,Yeon Hyang Kim +1 more
TL;DR: In this paper, it was shown that the canonical dual frame of a dynamical frame has an iterative set structure and is a scalable frame under appropriate conditions on the operator and the set of iterations.
16
Phaseless reconstruction from space–time samples
TL;DR: Various sufficient or necessary conditions for solving Paseless reconstruction from space-time samples are provided, which has connections to X-ray crystallography, the scattering transform, and deep learning.
15
Dynamical sampling for shift-preserving operators
TL;DR: In this paper, the dynamical sampling problem for a class of shift-preserving operators L : V → V acting on a finitely generated shift-invariant space V was solved.
14
•Posted Content
Dynamical Sampling for Shift-preserving Operators
TL;DR: In this paper, the dynamical sampling problem for a class of shift-preserving operators (L:V\to V) acting on a finitely generated shift-invariant space was solved.
12
Dynamical Sampling with Additive Random Noise
Akram Aldroubi,Longxiu Huang,Ilya A. Krishtal,Akos Ledeczi,Roy R. Lederman,Peter Volgyesi +5 more
- 01 May 2018
TL;DR: In this article, the performance of the basic dynamical sampling algorithms in the finite dimensional case and the impact of additive noise were analyzed and tested on synthetic and real data sets, and denoising techniques were integrated to mitigate the effect of the noise.
12
References
Wireless sensor networks: a survey
TL;DR: The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.
19.8K
Ten Lectures on Wavelets.
TL;DR: Introduction Preliminaries and notation The what, why, and how of wavelets The continuous wavelet transform Discrete wavelet transforms: Frames Time-frequency density and orthonormal bases Orthonormal wavelet bases of compactly supported wavelets and multiresolutional analysis.
13.5K
Noiseless coding of correlated information sources
David Slepian,Jack K. Wolf +1 more
TL;DR: The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
Yingbo Hua,Tapan K. Sarkar +1 more
TL;DR: It is found through perturbation analysis and simulation that, for signals with unknown damping factors, the pencil method is less sensitive to noise than the polynomial method.