N-Dimensional Path Optimization: The Implementation of a Novel Algorithm in ITK

Please use this identifier to cite or link to this publication: http://hdl.handle.net/1926/42
Using the path framework we previously added to ITK, we implemented a novel algorithm for n-dimensional path optimization, which we call the ND Swath (NDS). NDS uses dynamic programming to globally optimize the placement of a path within an image, subject to several constraints and a user-supplied merit function. The NDS algorithm is presented in this paper along with a description of how it was implemented using ITK.
Data
minus 2 Files (2Mb)
Code
minus Automatic Testing Results by Insight-Journal Dashboard on Tue Apr 13 16:42:02 2010 for revision #2
starstarstarstarstar expertise: 5 sensitivity: 5
yellow This project was submitted with no test cases.
Click here for more details.

Go here to access the main testing dashboard.

Reviews
plus Path by Luis Ibanez on 09-19-2005 for revision #1
starstarstarstarstar expertise: 4 sensitivity: 5
plus Promising work, but missing parts (especially code) by Ingmar Bitter on 09-09-2005 for revision #1
starstarstarstarstar expertise: 5 sensitivity: 5
Add a new review
Quick Comments


Resources
backyellow
Download All
Github

Statistics more
backyellow
Global rating: starstarstarstarstar
Review rating: starstarstarstarstar [review]
Code rating: starstarstarstarstar
Paper Quality: plus minus

Information more
backyellow
Keywords: ITK, path, chain-code, chain code, swath, NDS
Export citation:

Share
backyellow
Share

Linked Publications more
backyellow
Transforming an itkPointSet Transforming an itkPointSet
by Doria D.
Applying Image Mining to Support Gestational Age Determination Applying Image Mining to Support Gestational Age Determination
by Araujo A., Bellon O., Silva L., Vieira E., Cat M.

View license
Loading license...

Send a message to the author
main_flat
Powered by Midas