—A sampling theorem for regular sampling in shift invariant subspaces is established. The sufficient-necessary condition for which it holds is found. Then, the theorem is modified to the shift sampling in shift-invariant subspaces by using the Zak transform. Finally, some examples are presented to show the generality of the theorem.
— In this paper, a necessary and sufficient condition for sampling in the general framework of shift invariant spaces is derived. Then this result is applied respectively to the regular sampling and the perturbation of regular sampling in shift invariant spaces. A simple necessary and sufficient condition for regular sampling in shift invariant spaces is… (More)
For finite energy 7-band continuous signal f (t) , t f E L 2 (R) and suppf(w) = [-7,-y], the classical Shannon Sampling Theorem gave the following reconstruction formula, where f (w) is the Fourier transform of f (t) defined by f (w) = J, f(t)e-* " *dt. Unfortunately it is not appropriate for non-band-limited signals. However if we let y = 2 m ~ , m € 2 ,… (More)
— From the Paley–Wiener 1/4-theorem, the finite energy signal f (t) can be reconstructed from its irregularly sampled values f (k + k) if f (t) is band-limited and sup k j k j < 1=4. We consider the signals in wavelet subspaces and wish to recover the signals from its irregular samples by using scaling functions. Then the way to estimate the upper bound of… (More)
We propose a method of predicting the number of requests for video titles in an on-demand video delivery system considering their time dependency. To handle many heterogeneous video requests in a video streaming delivery network system using video servers, it is effective to introduce video caching systems in the network system. For the cache system design… (More)
Summary form only given. M. Crochemore et al. introduced a two-pass lossless data compression scheme called data compression using antidictionaries (DCA) (see Proc. IEEE, vol.88, no.11, p.1756-68, 2000). DCA finds some words (minimal forbidden words) that never appear in the text to be compressed, and chooses a subset of minimal forbidden words as an… (More)
SUMMARY Following our former works on regular sampling in wavelet subspaces, the paper provides two algorithms to estimate the truncation error and aliasing error respectively when the theorem is applied to calculate concrete signals. Furthermore the shift sampling case is also discussed. Finally some important examples are calculated to show the algorithm.
This paper presents a lossless image compression method for one frame of High-definition television (HDTV). We apply classified adaptive prediction, and then the prediction error is encoded by entropy coding of arithmetic coding. Then an image is divided into small blocks, and they are classified into some classes each of which correspond to one minimum… (More)