-
Notifications
You must be signed in to change notification settings - Fork 15
DEV: Prototype some zernike polynomials #188
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
base: main
Are you sure you want to change the base?
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You'll want to use float division then round/cast back to an int. Otherwise the binomial function will overflow pretty quickly.
I've been playing with Zernike-basis transforms of a reconstructed probe from some real data. I'm a bit concerned that zernike polynomials are not a good basis because the number of basis vectors needed to accurately represent the probe is approaching the number of pixels in the probe. We need like degree 40 polynomials which is 861 polynomials to get moderately high details. |
Nicely done, you got this working quickly. I like that image. I have several questions on implementation details that might help. Maybe we can discuss tomorrow. One useful thing to look at is a bar chart of the Zernike coefficients. It can provide some insight into what is going on. |
Hello @carterbox! Thanks for updating this PR. We checked the lines you've touched for PEP 8 issues, and found:
Comment last updated at 2024-01-19 18:23:37 UTC |
Purpose
Approach
Pre-Merge Checklists
Submitter
Reviewer