-
Notifications
You must be signed in to change notification settings - Fork 54
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
Implementation of Koehl's method for calculating geometric moments #45
Comments
I now have the method working and will focus on optimization. |
Optimization is almost finished. I have reduced per-face computational time at N=20 from 0.20s (Pozo's method) to 0.01s (Koehl's method). Things are coming along nicely. |
Here are the latest benchmarks for Koehl's method on a standard Mindboggle mesh (~300k faces):
Looking to push tomorrow. |
Closed
binarybottle
pushed a commit
that referenced
this issue
Oct 4, 2014
…oments. This is the slowest step in calculating the Zernike moments. See Koehl (2012), IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 34, No. 11, pg 2158-2163.
binarybottle
pushed a commit
that referenced
this issue
Oct 4, 2014
…oments. This is the slowest step in calculating the Zernike moments. See Koehl (2012), IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 34, No. 11, pg 2158-2163.
binarybottle
pushed a commit
that referenced
this issue
Oct 4, 2014
…oments. This is the slowest step in calculating the Zernike moments. See Koehl (2012), IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 34, No. 11, pg 2158-2163. Former-commit-id: 0bba48e
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
The current method for calculating Zernike moments depends on first calculating the geometric moments for the mesh. This is the slowest step in the algorithm, by far.
The current implementation depends on a method due to Pozo that is O(N^6). Koehl proposes a recursive method that is O(N^3).
The text was updated successfully, but these errors were encountered: