Surveillance radar range-bearing centroid processing

Benjamin J. Slocumb

doi:10.1117/12.492759

26 November 2001 Surveillance radar range-bearing centroid processing

Benjamin J. Slocumb

Proceedings Volume 4473, Signal and Data Processing of Small Targets 2001; (2001) https://doi.org/10.1117/12.492759
Event: International Symposium on Optical Science and Technology, 2001, San Diego, CA, United States

Abstract

In non-monopulse mechanically scanned surveillance radars, each target can be detected multiple times as the beam is scanned across the target. To prevent redundant reports of the object, a centroid processing algorithm is used to associate and cluster the multiple detections, called primitives, into a single object measurement. This paper reviews several techniques for centroid processing, and presents a new center of mass algorithm that is implemented with the recursive least squares algorithm. The new algorithm has a unique gating process to enable the primitive measurement association. Simulation results of the new algorithm are reported. Multiple object merged measurement handling issues within the centroid processing context are discussed.

Citation Download Citation

Benjamin J. Slocumb "Surveillance radar range-bearing centroid processing", Proc. SPIE 4473, Signal and Data Processing of Small Targets 2001, (26 November 2001); https://doi.org/10.1117/12.492759

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available