Fast Marching Minimal Path Extraction in ITK
| Please use this identifier to cite or link to this publication: http://hdl.handle.net/1926/1332 |
Published in The Insight Journal - 2008 January - June.
Submitted by Dan Mueller on 03-04-2008.
This paper describes the ITK implementation of a minimal path extraction framework based on Fast Marching arrival functions. The method requires the user to provide three inputs: 1. a meaningful speed function to generate an arrival function, 2. path information in the form of start, end, and way-points (which the path must pass near), and 3. an optimizer which steps along the resultant arrival function perpendicular to the Fast Marching front. A number of perspectives for choosing speed functions and optimizers are given, as well as examples using synthetic and real images.
Data
2 Files (3Mb)
Code
Automatic Testing Results
by Insight-Journal Dashboard
on Mon Jun 9 15:37:45 2008 for revision #6 
expertise: 5 sensitivity: 5 
This project passed 16 out of 17 tests.Click here for more details.
Go here to access the main testing dashboard.
Automatic Testing Results
by Insight-Journal Dashboard
on Mon Jun 9 15:18:55 2008 for revision #5 expertise: 5 sensitivity: 5
Automatic Testing Results
by Insight-Journal Dashboard
on Mon Jun 9 15:11:30 2008 for revision #4 expertise: 5 sensitivity: 5
Automatic Testing Results
by Insight-Journal Dashboard
on Fri Mar 21 11:53:19 2008 for revision #1 expertise: 5 sensitivity: 5 Reviews
Exhaustive minimal path seaching methods
by Sergio Vera on 2012-07-17 06:18:13 for revision #6 expertise: 2 sensitivity: 5
Summary:
The author provide a set of classes to find minimal paths in images. A set of optimization methods are provided.
Hypothesis:Minimal path can be extracted between two points using a speed image by means of the Fast marching fronts.
Evidence:Code and tests are provided.
Open Science:Code and data is provided. I've been able to use the method on my own data using my own speed functions.
Reproducibility:I was able to run the code without problems.
Quality of the data :The method is usable thanks to the multiple examples an tests provided.
Interest:In medical imaging, this method is very useful in the context of centerline generation. The author states concerns about possible patent violations if this code is used to generate centerlines.
Free comment :A good contribution to ITK. Applicable to many fields and applications. Centerline generation being the most useful in medical imaging, must require caution as may be under a patent.
Quick Comments
Resources
|
|
| Download All | |
Statistics more
|
|
| Global rating: |
|
| Review rating: | [review]
|
| Code rating: |  
|
| Paper Quality: |
|
| 1 comment | |
Information more
|
|
| Categories: | Feature extraction, Optimization, Path, Segmentation |
| Keywords: | ITK, vessel segmentation, centerline, minimal path |
| Toolkits: | ITK, CMake |
| Export citation: | |
Share
|
Linked Publications more
|
||
Diffeomorphic Demons Using ITK's Finite Difference Solver Hierarchy
by Vercauteren T., Pennec X., Perchant A., Ayache N.
|
||
Implementation of weighted Dijkstra’s shortest-path algorithm for n-D images
by Weizman L., Freiman M., Joskowicz L.
|
||
View license
Loading license...
Send a message to the author
This article has been merged into ITK as a Remote module in 4.8.0 as the "MinimalPathExtraction" module.