Showing papers by "John B. Moore published in 2000"
TL;DR: In this article, a generalized algebraic Riccati equation (GARE) was introduced, which involves a matrix pseudo-inverse and two additional algebraic equality/inequality constraints.
44 citations
01 Jan 2000
31 citations
TL;DR: An on-line method for estimating pulse train phases and fine-tuning pulse repetition frequency (PRF) estimates of a known number of interleaved pulse trains, using an extended Kalman filter.
Abstract: Some signals are transmitted as periodic pulse trains where information is in the timing of the arrival of the pulses. A number of pulse trains arriving over the same time interval are said to be interleaved. We propose an on-line method for estimating pulse train phases and fine-tuning pulse repetition frequency (PRF) estimates of a known number of interleaved pulse trains. The computational effort is of order N, where N is the number of pulses received. In particular, we employ an extended Kalman filter, where discontinuities in the signal model are appropriately smoothed.
20 citations
Patent•
14 Jan 2000
TL;DR: A panoramic imaging system includes an imaging device having an image plane and a first field of view, a first reflective surface having at least one circularly symmetric portion convex in a radial direction disposed in the first field-of-view to provide an expanded pan-oramic second-view as mentioned in this paper.
Abstract: A panoramic imaging system includes an imaging device having an image plane and a first field of view, a first reflective surface having at least one circularly symmetric portion convex in a radial direction disposed in the first field of view to provide an expanded panoramic second field of view. The profile of the or each convex portion provides a varying gain between the fields of view in the radial direction to limit variation in the solid angle of view across the image plane of the imaging device.
7 citations
TL;DR: By the introduction of a variable search direction, a new convergent algorithm for solving the problem is derived, which is guaranteed to be convergent and is capable of achieving a fast rate of convergence.
Abstract: This paper considers the problem of approximating a given symmetric matrix by a symmetric matrix with a prescribed spectrum so that the Frobenius norm of the matrix difference is minimized. By the introduction of a variable search direction, a new convergent algorithm for solving the problem is derived, which is guaranteed to be convergent and is capable of achieving a fast rate of convergence. It is shown that the set of fixed points of the proposed algorithm coincides with the set of equilibrium points of the original double bracket equation. A numerical example is presented to demonstrate superior performance of the proposed algorithm over a standard double bracket algorithm.
3 citations
01 Jan 2000
TL;DR: A new numerical scheme for computing balancing coordinate transformations for signature symmetric realizations in linear systems theory is presented and the algorithm is shown to be globally convergent to a balancing transformation that arranges the Hankel singular values in a prescribed ordering.
Abstract: A new numerical scheme for computing balancing coordinate transformations for signature symmetric realizations in linear systems theory is presented. The method is closely related to the Jacobi method for diagonalizing symmetric matrices. Here the minimization of the sum of traces of the Gramians by orthogonal and hyperbolic Jacobi-type rotations is considered. The algorithm is shown to be globally convergent to a balancing transformation that arranges the Hankel singular values in a prescribed ordering. Local quadratic convergence of the algorithm is shown.