Random average sampling and reconstruction in shift-invariant subspaces of mixed Lebesgue spaces
Ankush Kumar Garg
School of Mathematics,
Indian Institute of Science Education
and Research Thiruvananthapuram,
Maruthamala P.O., Vithura,
Thiruvananthapuram-695551.
[email protected]S. Arati
School of Mathematics,
Indian Institute of Science Education
and Research Thiruvananthapuram,
Maruthamala P.O., Vithura,
Thiruvananthapuram-695551.
[email protected]P. Devaraj
School of Mathematics,
Indian Institute of Science Education
and Research Thiruvananthapuram,
Maruthamala P.O., Vithura,
Thiruvananthapuram-695551.
[email protected]
Abstract.
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 shift-invariant 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.
Key words and phrases:
mixed Lebesgue spaces; probabilistic reconstruction; random average sampling; sampling inequality; shift-invariant subspaces.
1991 Mathematics Subject Classification:
46E30; 94A20; 94A12
1. Introduction
In information theory, it is highly desirable to gain maximum information about a function (or signal) using the least available data. Image processing, data analysis, computer tomography, bio-engineering and artificial intelligence are a few fields which often deal with sampling and reconstruction problems. In 1949, the celebrated Shannon sampling theorem was proved which turned out to be a milestone in this field of study and set the foundation for information theory. Over these years, the theory of sampling has been intensively studied. For a detailed survey on the theory, we refer to Butzer and Stens [7]. Further, the theory has been developed for shift-invariant spaces with a single generator as well as with multiple generators in various contexts such as regular, irregular, average and multi-channel sampling by several authors.
The average sampling is a useful and a practical model of sampling when the physical devices fail to measure the exact value of a signal at a given time. Sun and Zhou gave the reconstruction formulae from local convoluted samples for band-limited functions in [19, 20], for spline subspaces in [21, 22] and for shift-invariant subspaces with symmetric averaging functions in [23]. The average sampling and reconstruction algorithms for shift-invariant subspaces were also studied in [1, 13, 8]. In [18], the average sampling has been analyzed for a reproducing kernel subspace of - spaces. Li et al. gave the reconstruction formula for the functions in local shift-invariant subspaces of from average random samples in [16].
Random sampling is another type of sampling which has been used in practical applications such as learning theory, image filtering and compressed sensing. In [2], Bass and Gröchenig discussed random sampling for multivariate trigonometric polynomials. They obtained the probabilistic sampling inequality for band-limited functions on in [3] and the same for band-limited functions on 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. Random sampling for reproducing kernel subspaces was analyzed in [17, 11, 15].
The random sampling theory was also extended to mixed Lebesgue spaces which are generalized versions of the Lebesgue spaces. In this context, the random sampling for reproducing kernel subspaces was studied in [10] and that for multiply generated shift-invariant subspaces was analyzed in [12]. For a detailed study of the mixed Lebesgue spaces, we refer to [5].
This paper deals with the study of random average sampling for functions in mixed Lebesgue spaces using a probabilistic approach.
For , let denote the mixed Lebesgue space, which consists of complex valued measurable functions on such that
and let denote the set of all complex valued measurable functions on such that .
Similarly, for , denotes the space of all complex sequences such that
and denotes the space of all complex sequences on such that We observe that and for
We consider a multiply generated shift-invariant subspace of the mixed Lebesgue space of the form
where with and
We prove the sampling inequalities for certain subsets of and estimate the probabilities with which they hold. Our results show that the probability tends to one as the number of samples increases. Further, using these sampling inequalities, we derive explicit reconstruction formulae. We also simulate the reconstruction numerically for certain examples and obtain the error estimates.
2. Preliminaries
The subsets of that are needed for our analysis are defined as follows :
Let denote the compact set for some positive constants and and be the set
where . In fact, consists of the signals in whose energy is concentrated on the set
For a positive integer , denotes the finite dimensional subspace of given by
where for a multi-index
The unit ball of the above space is
For and the subset is defined as
and its unit ball is denoted by
Further, for we define
(2.1)
Also, for we define as
and as its unit ball.
We make the following assumptions for our study:
The generators have stable shifts, i.e., there exist positive constants and such that
(2.2)
for and
Also ’s are continuous with polynomial decay, i.e.,
(2.3)
where is a positive constant and are positive constants satisfying
.
The averaging function with supp
There exists a probability density function defined over such that
(2.4)
for all where and are positive constants.
We provide some examples of generators satisfying the assumption in Section 5.
3. Random average sampling inequalities
In this section, we shall show that the sampling inequalities hold with certain probabilities for functions in and The result for states as follows:
Theorem 3.1.
Let and satisfy assumptions and respectively. Further, let be a sequence of i.i.d. random variables that are drawn from a general probability distribution over and whose density function is . Then for any and
(3.1)
the sampling inequality
(3.2)
holds with probability at least for every in
where
In order to prove Theorem 3.1, we consider for and a sequence of i.i.d. random variables that are drawn from a general probability distribution over whose density function is the random variables , defined by
(3.3)
and a few of its properties, namely its expectation, variance and certain norm estimates. The proofs of these properties and the subsequent analysis require the following variants of Young’s inequality.
Lemma 3.2.
Let with . Suppose with , where denotes the cube Then,
(3.4)
Proof.
Let and be their conjugate exponents respectively.
Consider for
As we get
by Holder’s inequality.
Now using the relations and we obtain
which implies
thereby proving the desired inequality (3.4). The proof of (3.4) for the other cases is obvious.
∎
The version of Young’s inequality for mixed Lebesgue spaces is given in [14]. The analogous result for the compact subset is given below.
Lemma 3.3.
Let , and with supp. Then, we have
(3.5)
Also
(3.6)
Proof.
For a fixed consider the functions on given by and
Then,
Applying the Minkowski’s integral inequality and Lemma 3.4, we have
To proceed further, we shall consider the following lemmas. The relation between the and norms of functions in is given below.
Lemma 3.4.
[12]
Suppose that satisfies (2.2) and (2.3). Then for every function we have
where
and denote the conjugate exponents of and respectively.
As the sampling inequalities are given in a probabilistic sense, it is vital to consider the notion of covering numbers which help in the estimation of the probability.
For a compact set in a metric space, its covering number is the least number of balls of radius needed to cover The following lemma gives an upper bound for the covering number of
Lemma 3.5.
[12] Suppose that satisfies (2.2) and (2.3). Then the covering number of with respect to
is bounded by
We observe that the probabilities with which the sampling inequalities proved in Theorems 3.1, 3.8 and 3.10 hold approach one when the sample size tends to infinity.
4. Reconstruction using random average samples
In this section, we give reconstruction formulae for functions in the signal classes and
Theorem 4.1.
Let and satisfy the assumptions and respectively. Suppose is a sequence of i.i.d. random variables that are drawn from a general probability distribution over the cuboid with the density function satisfying the assumption . If
(4.1)
holds for all and for some positive constant , then for any , there exists a finite sequence of functions such that
holds for all with probability at least
(4.2)
where and are positive constants as in Theorem 3.1.
Using the sampling inequality provided in Theorem 3.8, we shall give a reconstruction formula for the functions in the set given by (2.1).
Theorem 4.2.
Let and satisfy the assumptions , and respectively. Also, let denote a sequence of i.i.d random variables over a cuboid drawn from a probability distribution with probability density function . For and , let be such that (3.11) is satisfied.
Then, there exist functions such that
every can be reconstructed by
In this section, we give some examples of generators which satisfy the assumption . We also validate the results obtained in the previous section numerically using some of these examples.
For , we consider the cardinal B-spline of degree defined on by
where
Example 1.
We define by
Example 2.
For let be such that
and for Let for
Example 3.
Let and be two compactly supported continuous functions such that is orthogonal to for every and there exist positive constants and such that
and
For numerical implementations, we consider the cuboid The function and the averaging function are as defined below:
One can easily verify that the functions and satisfy the conditions of Theorem 4.1. Using the reconstruction formula provided in Theorem 4.1, the simulation is performed for various values of the sample size The graphical representations of the function and its reconstructed version corresponding to 25 (m=5 and n=5) random samples are shown in Figures 1 and 2 respectively.
Figure 1. The 3D plot of the function Figure 2. The 3D plot of corresponding to 25 samples (n=5, m=5).
The reconstruction error is also computed with respect to and norms for various sample sizes. The numerical results are presented in Table 1.
Sample size
Reconstruction Error
Table 1. The reconstruction error .
Further, to test Theorem 4.2 numerically, we consider
It can be easily shown that where The reconstruction formula in Theorem 4.2 has been used for reconstructing the function for different sample sizes. The Figures 3 and 4 show the function and its reconstructed version corresponding to 25 random samples(). The errors in and norms are calculated and the numerical values are given in Table 2.
Figure 3. The 3D plot of the function Figure 4. The 3D plot of for
Sample size
Reconstruction Error
Table 2. The reconstruction error .
Acknowledgment:
The second author S. Arati acknowledges the financial support of National Board for Higher Mathematics, Department of Atomic Energy(Government of India). The third author P. Devaraj acknowledges the financial support of the Department of Science and Technology(Government of India) under the research grant DST-SERB Research Grant MTR/2018/000559.
References
[1] A. Aldroubi, Q. Sun and W.S. Tang, Convolution, average sampling, and a Calderon resolution of the identity for shift-invariant spaces, Journal of Fourier Analysis and Applications. 11(2) (2005) 215-244.
[2] R. F. Bass and K. Gröchenig, Random sampling of multivariate trigonometric polynomials, SIAM Journal on Mathematical Analysis. 36(3) (2004) 773-795.
[3] R. F. Bass and K. Gröchenig, Random sampling of bandlimited functions, Israel Journal of Mathematics. 177(1) (2010) 1-28.
[4] R. F. Bass and K. Gröchenig, Relevant sampling of band-limited functions, Illinois Journal of Mathematics. 57(1) (2013) 43-58.
[5] A. Benedek and R. Panzone, The space with mixed norm, Duke Mathematical Journal. 28(3) (1961) 301–324.
[6] G. Bennett, Probability inequalities for the sum of independent random variables, Journal of the American Statistical Association. 57(297) (1962) 33-45.
[7] P.L. Butzer and R.L. Stens, Sampling theory for not necessarily band-limited functions: A historical overview, SIAM Review. 34(1) (1992) 40-53.
[8] P. Devaraj and S. Yugesh, A local weighted average sampling and reconstruction theorem over shift invariant subspaces, Results in Mathematics. 71 (2017) 319-332.
[9] H. Führ and J. Xian, Relevant sampling in finitely generated shift-invariant spaces, Journal of Approximation Theory. 240 (2019) 1–15 .
[10] P. Goyal, D. Patel and S. Sampath, Random sampling in reproducing kernel subspace of mixed Lebesgue spaces, arXiv:2102.08632.
[11] Y. Jiang and W. Li, Random sampling in weighted reproducing kernel subspaces of , arXiv:2003.02993.
[12] Y. Jiang and W. Li, Random sampling in multiply generated shift-invariant subspaces of mixed Lebesgue spaces Journal of Computational and Applied Mathematics. 386 (2021) 113237.
[13] S. Kang and K. H. Kwon, Generalized average sampling in shift invariant spaces, Journal of Mathematical Analysis and Applications. 377 (2011) 70-78.
[14] R. Li, B. Liu, R. Liu and Q. Y. Zhang, The -stability of the shifts of finitely many functions
in mixed Lebesgue spaces , Acta Mathematica Sinica, English Series. 34(6) (2018) 1001-1014.
[15] Y. Li, Q. Sun and J. Xian, Random sampling and reconstruction of concentrated signals in a reproducing kernel space, Applied and Computational Harmonic Analysis. 54 (2021) 273-302.
[16] Y. Li, J. Wen and J. Xian, Reconstruction from convolution random sampling in local shift invariant spaces, Inverse Problems. 35 (2019) 125008.
[17] D. Patel and S. Sampath, Random sampling in reproducing kernel subspaces of , Journal of Mathematical Analysis and Applications. 491 (2020)
124270.
[18] M. Z. Nashed, Q. Sun And J Xian, Convolution sampling and reconstruction of signals in a reproducing kernel subspace, Proceedings of the American Mathematical Society. 141(6) (2013) 1995-2007.
[19] W. Sun and X. Zhou, Reconstruction of band-limited functions from local averages, Constructive Approximation. 18 (2002) 205-222.
[20] W. Sun and X. Zhou, Reconstruction of band-limited signals from local averages, IEEE Transactions on Information Theory. 48 (2002) 2955-2963.
[21] W. Sun and X. Zhou, Average sampling in spline subspaces, Applied Mathematics Letters. 15 (2002) 233-237.
[22] W. Sun and X. Zhou, Reconstruction of functions in spline subspaces from local averages, Proceedings of the American Mathematical Society. 131(8) (2003) 2561-2571.
[23] W. Sun and X. Zhou, Average sampling in shift invariant subspaces with symmetric averaging functions, Journal of Mathematical Analysis and Applications. 287(1) (2003) 279-295.
[24] J. Yang, Random sampling and reconstruction in multiply generated shift-invariant spaces, Analysis and Applications. 17(2) (2019) 323–347.
[25] J. Yang and X. Tao, Random sampling and approximation of signals with bounded derivatives, Journal of Inequalities and Applications. 107 (2019).
[26] J. Yang and W. Wei, Random sampling in shift invariant spaces, Journal of Mathematical Analysis and Applications. 398(1) (2013) 26–34.