
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 |
Published in The Insight Journal - 2005 MICCAI Open-Source Workshop.
Submitted by John Galeotti on 08-05-2005.
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
Code







Click here for more details.
Go here to access the main testing dashboard.
Reviews












Quick Comments
Resources
![]() |
|
Download All | |
Github |
Statistics more
![]() |
|
Global rating: | ![]() ![]() ![]() ![]() ![]() |
Review rating: | ![]() ![]() ![]() ![]() ![]() |
Code rating: | ![]() ![]() ![]() ![]() ![]() |
Paper Quality: |
![]() ![]() |
Information more
![]() |
|
Keywords: | ITK, path, chain-code, chain code, swath, NDS |
Export citation: |
Share
![]() |
Linked Publications more
![]() |
||
![]() by Saboo R., Julian R., Stephen P.
|
||
![]() by Araujo A., Bellon O., Silva L., Vieira E., Cat M.
|
View license
Loading license...
Send a message to the author
