The detection and tracking of small slow moving targets by High Frequency Surface Wave radar are limited by the presence of a dominate sea clutter spectrum. The ocean surface behaves as a distributed source in contrast to targets that are point sources. It is shown that by mapping data to eigenspaces, the sea clutter level decreases due to its nondeterministic behaviour while point targets' levels remain unchanged. The high resolution (subspace-based or eigenspace) methods and frequency tracking method for slowly time varying frequencies are evaluated to suppress this sea clutter to enhance detection of weak signals. Experimental results verify the advantage of subspace-based methods over the traditional processing techniques. Conventional subspace methods can be utilized to enhance the detection, but they deteriorate dramatically in the presence of correlated sea clutter. In our thesis some adaptive sea clutter pre-filtering schemes are introduced which improve the threshold and accuracy of subsequent subspace methods. Both simulated and real ship targets are used to verify the effectiveness of our proposed method. Furthermore, we propose another novel subspace algorithm to estimate the directions of arrival of superimposed cisoidal radar echoes from far-field targets in the radar pulse domain. The improvement provided by this algorithm is based on the use of a state space model that more accurately represents the received Doppler radar array signal prior to spatial processing such as MUSIC. A 2-d (spatial and temporal) pre-filtering matrix is structured and applied to the received array signal, which is finally combined with the high-resolution (MUSIC) method for DOA estimation. Lower resolution threshold and estimation variance are achieved by this algorithm compared to conventional beam-space MUSIC and sensor-space MUSIC. A simplified theoretical resolution threshold is derived, and both the theory and simulations verify the effectiveness of our proposed algorithm. Results from an experiment using a simulated target superimposed on real HF radar sea clutter also confirm the algorithm.

Thesis (M.S.)--University of Wisconsin--Madison, 1984. / Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 71-78).

International Telemetering Conference Proceedings / October 28-31, 1985 / Riviera Hotel, Las Vegas, Nevada / PSL is developing a telemetry antenna intended to avoid the mechanical complexity of traditional parabolic passive monopulse trackers. For a considerable range of reception scenarios, a stationary non-tracking antenna will fill the reception requirement while greatly simplyfing the antenna hardware as compared to mechanical passive trackers. A single, phi-symmetric, shaped-beam antenna provides proper coverage of the test range for multiple airborne targets. This system is not time shared and requires no acquisition time. Approximate azimuth to the target is displayed on a CRT. This paper examines the applicable test scenario and the resulting hardware.

No description available.

Thesis (M.S. in Applied Physics)--Naval Postgraduate School, December 2009. / Thesis Advisor(s): Borden, Brett. Second Reader: Walters, Donald. "December 2009." Description based on title screen as viewed on January 29, 2010. Author(s) subject terms: Radar imaging, moving targets, point-spread function. Includes bibliographical references (p. 57). Also available in print.

Thesis (D. Phil.(Biokinetics, Sport and Leisure Sciences))--University of Pretoria, 2002. / Includes bibliographical references.

The aim of this work was to investigate the possibility of detecting anti-ship sea-skimming missiles at long ranges over the ocean with cluttered cloud background using a staring infrared search and track (IRST) system. / Thesis (PhDElectronicEngineering)--University of South Australia, 2002.

Project report (M. Eng.)--Virginia Polytechnic Institute and State University, 1990. / Vita. Abstract. Includes bibliographical references (leaf 71). Also available via the Internet.

Thesis (M.S. in Combat Systems Technology)--Naval Postgraduate School, December 2004. / Thesis advisor(s): Brett Borden. Includes bibliographical references (p. 71-72). Also available online.

A mathematical model of a discrete sequential search for a target moving in discrete space is given. The model is based on a Bayesian updating algorithm giving successive probability distributions of target position at intervals throughout the search. Updating allows for target movement and for negative information gained from unsuccessful search. The search is conducted by taking a sequence of discrete, instantaneous looks at chosen points, or nodes, of the search area. The sequence of chosen nodes is termed a strategy. The successive target position distributions allow the probability of detecting the target to be found for any strategy. The model is an improvement over previous discrete sequential search models with respect to the following points. Target movement between nodes of the search area is formulated in terms of statistical information of target speed and direction, which are likely to be known. The time interval between looks, and target movement during this time, are related to the distance travelled by the searcher between search nodes. Also, with each look, the searcher has a view of surrounding nodes as well as the chosen search node. Implementation of these refinements is aided by considering the search area to consist of a finite, isometric pattern of nodes. Optimisation of strategies with respect to both detection probability and detection probability per unit cost is considered, and a criterion given in each case to assist optimisation. However, in practice, these criteria are of limited use, and full optimisation can only be carried out in a limited range of cases. Restricting both the planning horizon of the optimisation process, and searcher travel distance, allows sub-optimal strategies to be found in a wider range of cases. Results suggest that the detection probability of strategies found under these restrictions is normally close to optimal.