Results 1  10
of
192,390
Correspondence Subspace Approach for Fast and Accurate SingleTone Frequency Estimation
"... Abstract—A new signal subspace approach for estimating the frequency of a single complex tone in additive white noise is proposed in this correspondence. Our main ideas are to use a matrix without repeated elements to represent the observed signal and exploit the principal singular vectors of this m ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract—A new signal subspace approach for estimating the frequency of a single complex tone in additive white noise is proposed in this correspondence. Our main ideas are to use a matrix without repeated elements to represent the observed signal and exploit the principal singular vectors
Correspondence SubspaceBased Algorithm for Parameter Estimation of Polynomial Phase Signals
"... Abstract—In this correspondence, parameter estimation of a polynomial phase signal (PPS) in additive white Gaussian noise is addressed. Assuming that the order of the PPS is at least 3, the basic idea is first to separate its phase parameters into two sets by a novel signal transformation procedure, ..."
Abstract
 Add to MetaCart
Abstract—In this correspondence, parameter estimation of a polynomial phase signal (PPS) in additive white Gaussian noise is addressed. Assuming that the order of the PPS is at least 3, the basic idea is first to separate its phase parameters into two sets by a novel signal transformation procedure
From Few to many: Illumination cone models for face recognition under variable lighting and pose
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... We present a generative appearancebased method for recognizing human faces under variation in lighting and viewpoint. Our method exploits the fact that the set of images of an object in fixed pose, but under all possible illumination conditions, is a convex cone in the space of images. Using a smal ..."
Abstract

Cited by 755 (12 self)
 Add to MetaCart
conditions. The pose space is then sampled, and for each pose the corresponding illumination cone is approximated by a lowdimensional linear subspace whose basis vectors are estimated using the generative model. Our recognition algorithm assigns to a test image the identity of the closest approximated
SUBSPACES
, 2004
"... In [Chahlaoui, Gallivan and Van Dooren, 2004] a recursive procedure is designed for computing an approximation of the left and right dominant singular subspaces of a matrix, whose columns are produced incrementally. The method is particularly suited for matrices with many more rows than columns. The ..."
Abstract
 Add to MetaCart
In [Chahlaoui, Gallivan and Van Dooren, 2004] a recursive procedure is designed for computing an approximation of the left and right dominant singular subspaces of a matrix, whose columns are produced incrementally. The method is particularly suited for matrices with many more rows than columns
subspace
"... Highfrequency multiple scattering problems: An appropriate preconditioner for a Krylov ..."
Abstract
 Add to MetaCart
Highfrequency multiple scattering problems: An appropriate preconditioner for a Krylov
On Krylov subspace approximations to the matrix exponential operator
 SIAM J. NUMER. ANAL
, 1997
"... Krylov subspace methods for approximating the action of matrix exponentials are analyzed in this paper. We derive error bounds via a functional calculus of Arnoldi and Lanczos methods that reduces the study of Krylov subspace approximations of functions of matrices to that of linear systems of equ ..."
Abstract

Cited by 183 (6 self)
 Add to MetaCart
Krylov subspace methods for approximating the action of matrix exponentials are analyzed in this paper. We derive error bounds via a functional calculus of Arnoldi and Lanczos methods that reduces the study of Krylov subspace approximations of functions of matrices to that of linear systems
Frames and Stable Bases for ShiftInvariant Subspaces of . . .
, 1994
"... Let X be a countable fundamental set in a Hilbert space H, and let T be the operator T : ` 2 (X) ! H : c 7! X x2X c(x)x: Whenever T is welldefined and bounded, X is said to be a Bessel sequence. If, in addition, ran T is closed, then X is a frame. Finally, a frame whose corresponding T is inje ..."
Abstract

Cited by 133 (29 self)
 Add to MetaCart
Let X be a countable fundamental set in a Hilbert space H, and let T be the operator T : ` 2 (X) ! H : c 7! X x2X c(x)x: Whenever T is welldefined and bounded, X is said to be a Bessel sequence. If, in addition, ran T is closed, then X is a frame. Finally, a frame whose corresponding
Results 1  10
of
192,390