In this paper, the authors developed a data-driven model to classify radar measurements into precipitation (P) and non-precipitation (NP) echoes using the Random Forest machine learning algorithm. Dual-polarimetric radar variables and their local variability exhibit distinctive characteristics between P and NP echoes. The authors found that using larger search window sizes generally improves classification accuracy, though it involves a trade-off: while it helps eliminate small clusters of NP echoes, it may also suppress weak precipitation signals near storm edges. Incorporating multiscale local variability estimates computed with varying window sizes further enhances classification performance by capturing spatial-scale-dependent features characteristic of P and NP echoes. The main model uses radar variables obtained from a single scan and demonstrates consistent performance across all distances from the radar. This consistency allows reliable use of the model out to 230 km—the maximum range at which dual-polarimetric variables are used for rainfall estimation from NEXRAD radars—without significant degradation in accuracy due to range effects. Supplementing the model with independent information from GOES-16 infrared channel products further improves classification by helping to eliminate localized NP echoes remaining after the main model, particularly those caused by wind turbines that mimic precipitation in dual-polarimetric signatures. This is based on the tendency of water vapor and/or raindrops to absorb terrestrial radiation, thereby lowering brightness temperatures. A practical challenge remains near the radar, where the sampling volume is small and signal processing (e.g., sidelobe impact and ground clutter suppression) can distort radar measurements. The under-detection of precipitation in these regions is likely due to such corrupted data. This issue may be mitigated by adopting a hybrid scan strategy—such as a Constant Altitude Plan Position Indicator (CAPPI)—specifically for regions close to the radar.
Building similarity graph...
Analyzing shared references across papers
Loading...
Keem et al. (Sat,) studied this question.
www.synapsesocial.com/papers/69ada8a1bc08abd80d5bbc5b — DOI: https://doi.org/10.3390/rs18050827
Munsung Keem
Bong‐Chul Seo
Witold F. Krajewski
Building similarity graph...
Analyzing shared references across papers
Loading...