reduced multiplication cost in Gauss filtering #24
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
- cudaArray for intermediate memory - use texture engine to halve mult ops in Gauss filtering
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Instead of using Gauss as (g1 x_1 + g2 x_2), we use (u x_1 + (1-u) x_2) v, where v=g1+g2 and u=g1/v
u is handled by linear interpolation of the texture engine, so we need only one multiplication.
Still not perfect, but this shifts the performance bottleneck and reduces the time in Gauss filtering by at least 20% for the first octaves.