Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fixed sweeps #1

Open
gfpearson opened this issue Dec 10, 2018 · 0 comments
Open

Fixed sweeps #1

gfpearson opened this issue Dec 10, 2018 · 0 comments

Comments

@gfpearson
Copy link

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant