
Implementation of weighted Dijkstra’s shortest-path algorithm for n-D images
Please use this identifier to cite or link to this publication: http://hdl.handle.net/1926/1520 |
Published in The Insight Journal - 2009 January - June.
Submitted by Lior Weizman on 01-29-2009.
This paper describes the ITK implementation of a shortest path extraction algorithm based on graph representation of the image and the Dijkstra shortest path algorithm. The method requires the user to provide two inputs: 1. path information in the form of start, end, and neighboring mode, the form of which path is allowed to propagate between neighboring pixels, and 2. a weighting function which sets the distance metric between neighboring pixels. A number of perspectives for choosing weighting functions are given, as well as examples using real images. This paper can also serve as an example for utilizing the Boost C++ graph library into the ITK framework.
Code
Reviews
Quick Comments
Resources
![]() |
|
Download All | |
Download Paper , View Paper | |
Download Source code | |
Github |
Statistics more
![]() |
|
Global rating: | ![]() ![]() ![]() ![]() ![]() |
Review rating: | ![]() ![]() ![]() ![]() ![]() |
Code rating: | |
Paper Quality: |
![]() ![]() |
Information more
![]() |
|
Categories: | Data Representation, Distance maps, Filtering, Neighborhood filters, Path |
Keywords: | minimal path, centerline, vessel segmentation, ITK, boost |
Toolkits: | ITK, CMake |
Export citation: |
Share
![]() |
Linked Publications more
![]() |
||
![]() by Hawley J., Johnson H.
|
||
![]() by Vercauteren T., Pennec X., Perchant A., Ayache N.
|
View license
Loading license...
Send a message to the author
