{"version":1,"kind":"Article","sha256":"","slug":"38","location":"","dependencies":[],"doi":"10.54294/518ywu","frontmatter":{"title":"N-Dimensional Path Optimization: The Implementation of a Novel Algorithm in ITK","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.","license":"You are licensing your work to Kitware Inc. under the\nCreative Commons Attribution License Version 3.0.\n\nKitware Inc. agrees to the following:\n\nKitware is free\n * to copy, distribute, display, and perform the work\n * to make derivative works\n * to make commercial use of the work\n\nUnder the following conditions:\n\\\"by Attribution\\\" - Kitware must attribute the work in the manner specified by the author or licensor.\n\n * For any reuse or distribution, they must make clear to others the license terms of this work.\n * Any of these conditions can be waived if they get permission from the copyright holder.\n\nYour fair use and other rights are in no way affected by the above.\n\nThis is a human-readable summary of the Legal Code (the full license) available at\nhttp://creativecommons.org/licenses/by/3.0/legalcode","keywords":["path","chain code","chain-code","ITK","swath","NDS"],"authors":[{"name":"Galeotti, John","email":"jgaleotti@cmu.edu","affiliations":["Carnegie Mellon University Robotics Institute"],"corresponding":true},{"name":"Stetten, George","email":"email@stetten.com","affiliations":[]}],"date_submitted":"2005-08-05T20:24:14Z","external_publication_id":38,"revision_cids":["bafkreiflbl7d5c4ltliaywjocvbotixswautak36ehrdzyz4yc6fbd7rgq"],"github":"https://github.com/midas-journal/midas-journal-38.git"},"mdast":{"type":"root"},"downloads":[{"url":"https://pub.desci.com/ipfs/bafkreifmfekekrfcjmqgfpse5cdleer3dmzfnwwbaw7hgfhavg4m5woexe","title":"root/code/ND_Swath/.DS_Store","filename":".DS_Store","extra":{"size_bytes":6148,"type":"file"}},{"url":"https://pub.desci.com/ipfs/bafkreiau4nde5ecckb5vkgrwul27vq4ui2hr5ynyvxdo3lbsm52ngaujgq","title":"root/code/ND_Swath/CMakeLists.txt","filename":"CMakeLists.txt","extra":{"size_bytes":752,"type":"file"}},{"url":"https://pub.desci.com/ipfs/bafkreib4yehb3e3rwceiiosj5zimjscshl6ymjyhznehdxq5aibxmmsq5m","title":"root/code/ND_Swath/itkSwathChainCodePathFilter.h","filename":"itkSwathChainCodePathFilter.h","extra":{"size_bytes":7065,"type":"file"}},{"url":"https://pub.desci.com/ipfs/bafkreie34uydfkmfoq6nvisqvgnsanvkswbjxvuoxwxk46ajfeirhfmqxq","title":"root/code/ND_Swath/itkSwathChainCodePathFilter.txx","filename":"itkSwathChainCodePathFilter.txx","extra":{"size_bytes":28609,"type":"file"}},{"url":"https://pub.desci.com/ipfs/bafkreicdne2gfyha6zfamuz2ydrtsca34kpq2extu56hralj5prhuupgwq","title":"root/code/ND_Swath/itkSwathChainCodePathFilterTest.cxx","filename":"itkSwathChainCodePathFilterTest.cxx","extra":{"size_bytes":13569,"type":"file"}},{"url":"https://pub.desci.com/ipfs/bafkreieke5ixx6j5dtpg4mhcaflv7pnkvm6i37vbbdhhusb5ahnlmqjv7q","title":"root/code/ND_Swath/main.cxx","filename":"main.cxx","extra":{"size_bytes":693,"type":"file"}},{"url":"https://pub.desci.com/ipfs/bafkreiaqaspqqnqp6lauhr2bno2v42uygazvx6zcgx32j6g7srdj4yxzia","title":"root/code/ND_Swath/readme_TODO.txt","filename":"readme_TODO.txt","extra":{"size_bytes":232,"type":"file"}},{"url":"https://ipfs.desci.com/ipfs/bafkreifvwlfzt5qi7rqzvc7jn7leaejscuke7p6xoxpwrbzd4zkhhgxjde","title":"root/insight-journal-metadata.json","filename":"insight-journal-metadata.json","extra":{"size_bytes":9836,"type":"file"}},{"url":"https://ipfs.desci.com/ipfs/bafkreifpm5ifuxkf36qktx3sffit4ek2sr6iuchfppj4tlgwxkud2s6ony","title":"root/reviews.md","filename":"reviews.md","extra":{"size_bytes":4649,"type":"file"}},{"url":"https://dweb.link/ipfs/bafybeialm36s2t5w72b47mpqiwflpwlpbtif33msyumha6w5i4sghqbpzm","title":"root/article.pdf","filename":"article.pdf","extra":{"size_bytes":2470360,"type":"file"}}],"references":{"cite":{"order":["ref1","ref2","ref3","ref4","ref5","ref6","ref7"]},"data":{"ref1":{"label":"ref1","enumerator":"1","url":"https://doi.org/10.1109/34.277589","html":"1994+Modeling, Analysis, and Visualization of Left Ventricle Shape and Motion by Hierarchical Decomposition+16+4+342+356+C. Chen+T. Huang+M. Arrot"},"ref2":{"label":"ref2","enumerator":"2","url":"https://doi.org/10.1109/34.368194","html":"1995+Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours+17+3+294+302+D. Geiger+A. Gupta+L. Costa+J. Vlontzos"},"ref3":{"label":"ref3","enumerator":"3","url":"https://doi.org/10.1109/34.566812","html":"1997+19+1+63+68+S. Gunn+M. Nixon+A Robust Snake Implementation: A Dual Active+Contour"},"ref4":{"label":"ref4","enumerator":"4","url":"https://doi.org/10.1142/s0219467801000347","html":"2001+Active Fourier Contour Applied to Real Time 3D Ultrasound of the Heart+International Journal of Image and Graphics+1+4+647+658+G. Stetten+R. Drezek"},"ref5":{"label":"ref5","enumerator":"5","url":"https://doi.org/10.1145/362588.362594","html":"1971+On the optimal detection of curves in noisy pictures+Communications of the ACM+14+5+335+345+U. Montanari"},"ref6":{"label":"ref6","enumerator":"6","html":"1984+Dynamic Search Algorithms in Left Ventricular Border Recognition and Analysis of Coronary Arteries+Pope"},"ref7":{"label":"ref7","enumerator":"7","html":"1926+Creation and Demonstration of a Framework for Handling Paths in ITK+J. Galeotti+G. Stetten"}}}}