z-logo
Premium
Sensitivity analysis and performance estimation of refractivity from clutter techniques
Author(s) -
Yardim Caglar,
Gerstoft Peter,
Hodgkiss William S.
Publication year - 2009
Publication title -
radio science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.371
H-Index - 84
eISSN - 1944-799X
pISSN - 0048-6604
DOI - 10.1029/2008rs003897
Subject(s) - clutter , estimator , radar , atmospheric duct , inversion (geology) , remote sensing , computer science , algorithm , performance metric , environmental science , meteorology , geology , mathematics , statistics , telecommunications , physics , management , economics , paleontology , structural basin , atmosphere (unit)
Refractivity from clutter (RFC) refers to techniques that estimate the atmospheric refractivity profile from radar clutter returns. A RFC algorithm works by finding the environment whose simulated clutter pattern matches the radar measured one. This paper introduces a procedure to compute RFC estimator performance. It addresses the major factors such as the radar parameters, the sea surface characteristics, and the environment (region, time of the day, season) that affect the estimator performance and formalizes an error metric combining all of these. This is important for applications such as calculating the optimal radar parameters, selecting the best RFC inversion algorithm under a set of conditions, and creating a regional performance map of a RFC system. The performance metric is used to compute the RFC performance of a non‐Bayesian evaporation duct estimator. A Bayesian estimator that incorporates meteorological statistics in the inversion is introduced and compared to the non‐Bayesian estimator. The performance metric is used to determine the optimal radar parameters of the evaporation duct estimator for six scenarios. An evaporation duct inversion performance map for a S band radar is created for the larger Mediterranean/Arabian Sea region.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here