Radar clutter modeling for change detection

Erik P. Blasch; Mike Hensel; James L. Jackson

doi:10.1117/12.542857

2 September 2004 Radar clutter modeling for change detection

Erik P. Blasch, Mike Hensel, James L. Jackson

Proceedings Volume 5427, Algorithms for Synthetic Aperture Radar Imagery XI; (2004) https://doi.org/10.1117/12.542857
Event: Defense and Security, 2004, Orlando, Florida, United States

Abstract

To recognize an object in an image, an algorithm must identify not only the object pixels, but also non-object clutter pixels. Non-object pixels can be assessed with a priori clutter models that account for the varying terrain and cultural objects. Radar clutter models have been well developed; however, these models typically incorporate a single distribution to capture background effects. In this paper, we propose to use a fusion of distributions through mixture modeling to characterize various background clutter information so as to more accurately develop a clutter model useful for object recognition. In a radar example, we show a fused-distribution using a Rayleigh and Pareto model describing the average and heavy tail clutter characteristics.

Citation Download Citation

Erik P. Blasch, Mike Hensel, and James L. Jackson "Radar clutter modeling for change detection", Proc. SPIE 5427, Algorithms for Synthetic Aperture Radar Imagery XI, (2 September 2004); https://doi.org/10.1117/12.542857

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