Skip to content

Theory behind local thickness filter #494

Answered by jgostick
javierpagalo asked this question in Q&A
Discussion options

You must be logged in to vote

The "theory" is just that you put the largest spheres you can in the image. How you do it is less important...that only affects speed and memory usage for instance. The paper we refer to in our previous work uses skeletons which are not always robust since they don't always go where they're supposed to. Our method is robust in that we iteratively find all locations where spheres of size r=R can find, then r=R-1, then r=R-2, etc. On each iteration we update the image with "r" that have not already been updated on a previous iteration. I do not know of a paper that explicitly outlines our method, but as I said it's just a background implementation detail and the result is the same.

Replies: 1 comment 1 reply

Comment options

You must be logged in to vote
1 reply
@javierpagalo
Comment options

Answer selected by jgostick
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
2 participants