Now showing items 1-10 of 19
Application of a Frequency Domain Prony Method to Wide Bandwidth Radar Signature Classification
A frequency domain Prony approach is presented for extracting features of return signals from targets illuminated by wide bandwidth (short pulse) radar. Theoretical details pertaining to this approach are described in a ...
Optimization Techniques for Feature Extraction in Automatic Pattern Recognition
This report summarizes the work performed under the AFOSR grant 75-2777 over the almost five year period during which the grant was in effect.
Computer Controlled Intracavity Frequency Doubling of a CW Dye Ring Laser
The development of a computer controlled tunable ultraviolet spectrometer utilizing intracavity second harmonic generation in a single frequency CW dye ring laser is reported. With 5 W of argon ion laser pump power at 514.5 ...
A recursive algorithm for digital Image Processing using Local Statistics
An algorithm is presented for digital image processing based on local statistics. The algorithm constitutes a recursive implementaiton of an approach proposed and implemented nonrecursively by J.S. Lee (Naval Research ...
A Fourier-Prony Tauberian Approach to the Analysis of a Mixture of Delayed Signals
Let x and y be signals (i.e. real-valued functions of time) of finite duration and energy. In the present paper, we develop a frequency domain Prony approach for interpolating, or in general, approximating y(t) by ....
Algorithms for Optimal Numerical Quadrature Based on Signal Class Models
A framework is presented for constructing various types of numerical quadrature algorithms which take into account the a-priori known or estimated properties of the signal being processed. This is done by appropriately ...
A Note on the Characterization of Bivariate Densities by Conditional Densities
The compatibility of pairs of conditional densities and the uniqueness of the resulting bivariate densities are discussed. Examples are given involving beta, gamma, and Gaussian conditional densities.
Algorithms for Optimal Dynamic Assignment in Distributed Processing Systems
The problem of determining an optimal dynamic assignment of a modular program in a loosely coupled distributed processing system is considered. An optimal dynamic assignment minimizes the sum of all module execution costs, ...