You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I've been playing around with pyART and decluttering of weather radar data and came across your implementation of the Steiner/Smith algorithm (thanks for making this available).
One thing that puzzles me is that you seem to have fixed sweeps in your implementation (0 & 2). As I understand the algorithm, for each pixel in the base sweep, you need to find the highest sweep that contains a reflectivity above a certain threshold (you actually do the same for the neighbours of the base pixel). So this 'top sweep' is likely to vary.
Thanks for any advice.
Kind regards,
Greg
The text was updated successfully, but these errors were encountered:
Hi Jure.
I've been playing around with pyART and decluttering of weather radar data and came across your implementation of the Steiner/Smith algorithm (thanks for making this available).
One thing that puzzles me is that you seem to have fixed sweeps in your implementation (0 & 2). As I understand the algorithm, for each pixel in the base sweep, you need to find the highest sweep that contains a reflectivity above a certain threshold (you actually do the same for the neighbours of the base pixel). So this 'top sweep' is likely to vary.
Thanks for any advice.
Kind regards,
Greg
The text was updated successfully, but these errors were encountered: