Abstract:a b s t r a c tThe set of sampling in a shift invariant space plays an important role in signal processing and has many applications. This paper addresses the problem when some randomly chosen samples X = {x j : j ∈ J} form a set of sampling in a shift invariant space.holds uniformly for all functions f in a shift invariant space, where c p and C p are positive constants (1 ≤ p ≤ ∞). We prove that with overwhelming probability, the above sampling inequality holds for certain compact subsets of the shift invari… Show more
“…They obtained the probabilistic sampling inequality for band-limited functions on R in [3] and the same for band-limited functions on R d in [4]. Random sampling in shift-invariant spaces was studied in [26,24,9]. Yang and Tao in [25] studied random sampling and gave an approximation model for signals having bounded derivatives.…”
In this paper, the problem of reconstruction of signals in mixed Lebesgue spaces from their random average samples has been studied. Probabilistic sampling inequalities for certain subsets of shiftinvariant spaces have been derived. It is shown that the probabilities increase to one when the sample size increases. Further, explicit reconstruction formulae for signals in these subsets have been obtained for which the numerical simulations have also been performed.
“…They obtained the probabilistic sampling inequality for band-limited functions on R in [3] and the same for band-limited functions on R d in [4]. Random sampling in shift-invariant spaces was studied in [26,24,9]. Yang and Tao in [25] studied random sampling and gave an approximation model for signals having bounded derivatives.…”
In this paper, the problem of reconstruction of signals in mixed Lebesgue spaces from their random average samples has been studied. Probabilistic sampling inequalities for certain subsets of shiftinvariant spaces have been derived. It is shown that the probabilities increase to one when the sample size increases. Further, explicit reconstruction formulae for signals in these subsets have been obtained for which the numerical simulations have also been performed.
“…Bass and Gröchenig studied random sampling for multivariate trigonometric polynomial [2]; Candés, Romberg, and Tao reconstructed sparse trigonometric polynomial from a random sample set [6]. In the last decades, random sampling studied for Paley-Wiener space [3,4]; shift-invariant space [15,33,35]; continuous function space with bounded derivative [34]; function space with finite rate of innovation [24]; reproducing kernel subspace of L p (R n ) which is an image of an idempotent integral operator [23,27].…”
The paper is devoted to studying the stability of random sampling in a localized reproducing kernel space. We show that if the sampling set on Ω (compact) discretizes the integral norm of simple functions up to a given error, then the sampling set is stable for the set of functions concentrated on Ω. Moreover, we prove with an overwhelming probability that O(µ(Ω)(log µ(Ω)) 3 ) many random points uniformly distributed over Ω yield a stable set of sampling for functions concentrated on Ω.
“…There exist several well-understood ways of formulating these restrictions, eg. by assuming the analog signal f to be bandlimited, or more generally, that it belongs to a shift-invariant space [1,2,3,5,6,10,11,15,16,18,19,20]. Bandlimited signals of finite energy are completely characterized by their regular samples if they are taken at a sufficiently high rate (Nyquist criterion), as described by the famous classical Shannon sampling theorem.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, the random sampling problems were studied by Bass and Gröchenig in the multivariate trigonometric polynomials spaces [4] and bandlimited functions spaces [5,6]. Yang and Wei discussed the problem when some randomly chosen samples X = {x j : j ∈ J} forms a set of sampling in the shift-invariant space [20].…”
We consider random sampling in finitely generated shift-invariant spaces V (Φ) ⊂ L 2 (R n ) generated by a vector Φ = (ϕ 1 , . . . , ϕ r ) ∈ L 2 (R n ) r . Following the approach introduced by Bass and Gröchenig, we consider certain relatively compact subsets V R,δ (Φ) of such a space, defined in terms of a concentration inequality with respect to a cube with side lengths R. Under very mild assumptions on the generators, we show that for R sufficiently large, taking O(R n log(R n 2 /α ′ )) many random samples (taken independently uniformly distributed within C R ) yields a sampling set for V R,δ (Φ) with high probability. Here α ′ ≤ n is a suitable constant. We give explicit estimates of all involved constants in terms of the generators ϕ 1 , . . . , ϕ r .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.