
Escher's Ants as Metaphor: Topological Marching for the Well-Composed, Genus Zero Crowd
Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3234 |
Published in The Insight Journal - 2010 July-December.
Submitted by Nick Tustison on 11-30-2010.
Topological considerations for segmentation results are important for such applications as proper brain segmentation from digital image data. We present an enhancement of the FastMarchingImageFilter which allows for topologically constrained evolution of the level set. Identical to the original functionality of the FastMarchingImageFilter, the evolution of the level set of a single or multiple genus zero, well-composed seed objects proceeds according to the specified parameters. With our proposed enhancements, the user can either choose to prevent the level set from merging with itself such that the original topology of the initial seed object(s) is not violated or that no handles are created during the evolution process. However, in contrast to earlier approaches which relied on the concept of the simple point implicitly requiring the definition of a user-specified foreground/background connectivity, we use the related, but more restrictive concept of well-composed sets to topologically constrain the evolution of the level set. Utility of our submission is demonstrated on both 2-D and 3-D brain images. Note that this submission is a companion piece to a more theoretical discussion of our work given in [9]
Code






Reviews
Quick Comments
Resources
![]() |
|
Download All | |
Download Paper , View Paper | |
Download Source code | |
Github |
Statistics more
![]() |
|
Global rating: | ![]() ![]() ![]() ![]() ![]() |
Review rating: | ![]() ![]() ![]() ![]() ![]() |
Code rating: | ![]() ![]() ![]() ![]() ![]() |
Paper Quality: |
![]() ![]() |
Information more
![]() |
|
Categories: | Level sets, Region growing, Segmentation |
Keywords: | digital topology, well-composedness |
Toolkits: | ITK |
Export citation: |
Share
![]() |
Linked Publications more
![]() |
||
![]() by Vercauteren T., Pennec X., Perchant A., Ayache N.
|
||
![]() by Dowling J., Malaterre M., Greer P.B., Salvado O.
|
View license
Loading license...
Send a message to the author
