[Insight-users] The Insight Journal-New Submission

[Insight Journal]

Hello,
A new submission has been added to the Insight Journal.

Title: Implementation of weighted Dijkstra’s shortest-path algorithm for n-D images
Author(s):Weizman L., Freiman M., Joskowicz L.
Abstract: 
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.

Download and Review the paper at: http://www.insight-journal.org/browse/publication/315

Generated by the Insight Journal
You are receiving this email because you asked to be informed by the Insight Journal for new submissions.
                    
To change your email preference go to http://www.insight-journal.org .