Search

Navigator: RI | Publications | N-Dimensional Path Optimization: The Implementation of a Novel Algorithm in ITK

Graphics enhanced version of this site

N-Dimensional Path Optimization: The Implementation of a Novel Algorithm in ITK
J. Galeotti and G.D. Stetten
Technical report in special MICCAI 2005 Workshop on Open-Source Software issue of The Insight Journal, August, 2005.

Jump to: Download | Abstract | Notes | Text Reference | BibTeX Reference


Download [Help]

Adobe portable document format (pdf) [2470 KB]

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


Abstract

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.


Notes

Associated center: VASC

Number of pages: 10


Text Reference

J. Galeotti and G.D. Stetten, "N-Dimensional Path Optimization: The Implementation of a Novel Algorithm in ITK," Technical report in special MICCAI 2005 Workshop on Open-Source Software issue of The Insight Journal, August, 2005.


BibTeX Reference

@article{Galeotti_2005_5256,
   author = "John Galeotti and George D Stetten",
   title = "N-Dimensional Path Optimization: The Implementation of a Novel Algorithm in ITK",
   journal = "Technical report in special MICCAI 2005 Workshop on Open-Source Software issue of The Insight Journal",
   month = "August",
   year = "2005"
}


The Robotics Institute is part of the School of Computer Science, Carnegie Mellon University.
For updates and comments, please see these instructions.
This page maintained by robotwebmaster@ri.cmu.edu