Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
296
Signal extrapolation in wavelet subspaces
- SIAM J. Sci. Comp
, 1995
"... Abstract. The Papoulis-Gerchberg (PG) algorithm is well known for band-limited signal extrapolation. The authors consider the generalization of the PG algorithm to signals in the wavelet subspaces in this research. The uniqueness of the extrapolation for continuous-time signals is examined, and suff ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Abstract. The Papoulis-Gerchberg (PG) algorithm is well known for band-limited signal extrapolation. The authors consider the generalization of the PG algorithm to signals in the wavelet subspaces in this research. The uniqueness of the extrapolation for continuous-time signals is examined
On the translation invariance of wavelet subspaces
- J. Fourier Anal. Appl
"... Abstract. An examination of the translation invariance of V0 under dyadic rationals is presented, generating a new equivalence relation on the collection of wavelets. The equivalence classes under this relation are completely characterized in terms of the support of the Fourier transform of the wave ..."
Abstract
-
Cited by 13 (3 self)
- Add to MetaCart
Abstract. An examination of the translation invariance of V0 under dyadic rationals is presented, generating a new equivalence relation on the collection of wavelets. The equivalence classes under this relation are completely characterized in terms of the support of the Fourier transform
Irregular sampling theorems for wavelet subspaces
- IEEE Trans. Inform. Theory
, 1998
"... Abstract—From the Paley–Wiener 1/4-theorem, the finite en-ergy signal f(t) can be reconstructed from its irregularly sampled values f(k+ k) if f(t) is band-limited and sup k j ..."
Abstract
-
Cited by 31 (7 self)
- Add to MetaCart
Abstract—From the Paley–Wiener 1/4-theorem, the finite en-ergy signal f(t) can be reconstructed from its irregularly sampled values f(k+ k) if f(t) is band-limited and sup k j
Wavelet Subspace Method for Real-time Face Tracking
- In Proc. Pattern Recognition, 23rd DAGM Symposium
, 2004
"... In this article we present a new method for visual face tracking that is carried out in wavelet subspace. Firstly, a wavelet representation for the face template is created, which spans a low dimensional subspace of the image space. The wavelet representation of the face is a point in this wavelet s ..."
Abstract
-
Cited by 13 (2 self)
- Add to MetaCart
In this article we present a new method for visual face tracking that is carried out in wavelet subspace. Firstly, a wavelet representation for the face template is created, which spans a low dimensional subspace of the image space. The wavelet representation of the face is a point in this wavelet
Efficient Real-Time Face Tracking in Wavelet Subspace
- In Proceedings of the Int. Workshop on Recognition, Analysis and Tracking of Faces and Gestures in Real-Time Systems
, 2001
"... In this article we present a new method for visual face tracking that is carried out in wavelet subspace. Firstly, a wavelet representation for the face template is created, which spans a low-dimensional subspace of the image space. The video sequence frames where the face is tracked are then orthog ..."
Abstract
-
Cited by 10 (6 self)
- Add to MetaCart
In this article we present a new method for visual face tracking that is carried out in wavelet subspace. Firstly, a wavelet representation for the face template is created, which spans a low-dimensional subspace of the image space. The video sequence frames where the face is tracked
© Printed in India Wavelet subspaces invariant under groups of translation
, 2002
"... Abstract. We study the action of translation operators on wavelet subspaces. This action gives rise to an equivalence relation on the set of all wavelets. We show by explicit construction that each of the associated equivalence classes is non-empty. ..."
Abstract
- Add to MetaCart
Abstract. We study the action of translation operators on wavelet subspaces. This action gives rise to an equivalence relation on the set of all wavelets. We show by explicit construction that each of the associated equivalence classes is non-empty.
The Zak transform and sampling theorem for wavelet subspaces,”IEEE Trans.
- Signal Processing,
, 1993
"... Abstract-The Zak transform is used for generalizing a sampling theorem of G. Walter for wavelet subspaces. Cardinal series based on signal samples f(a + n), n E 2 with a possibly unequal to 0 (Walter's case) are considered. The condition number of the sampling operator and worst-case aliasing ..."
Abstract
-
Cited by 40 (0 self)
- Add to MetaCart
Abstract-The Zak transform is used for generalizing a sampling theorem of G. Walter for wavelet subspaces. Cardinal series based on signal samples f(a + n), n E 2 with a possibly unequal to 0 (Walter's case) are considered. The condition number of the sampling operator and worst-case aliasing
ALIASING ERROR OF SAMPLING SERIES IN WAVELET SUBSPACES
"... In [6], Walter extended the Shannon sampling theorem [3], under appropriate hypotheses, the Shannon sampling theorem to the subspace V0 of a general multiresolution analysis {Vn}n∈Z in L 2 (R): For any f ∈ V0 the sampling formula f(t) = � f(n)S(t − n), t ∈ R n∈Z holds, where � S(ξ): = � φ(ξ)/ ( � ..."
Abstract
- Add to MetaCart
In [6], Walter extended the Shannon sampling theorem [3], under appropriate hypotheses, the Shannon sampling theorem to the subspace V0 of a general multiresolution analysis {Vn}n∈Z in L 2 (R): For any f ∈ V0 the sampling formula f(t) = � f(n)S(t − n), t ∈ R n∈Z holds, where � S(ξ): = � φ
Results 1 - 10
of
296
