An Implementation of Parallel Fast Marching Using the Message Passing Interface
Hobbs K.
Ohio University
logo

Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3137
This document introduces a program based on the algorithm described by Maria Cristina Tugurlan. The program uses file readers, image filters, and file writers from the Insight Toolkit ITK www.itk.org. It produces as output an image whose values are the times of first arrival of a wavefront that spreads from seed points with a speed at every point equal to the input image intensity. It performs the computation in parallel on distributed memory computers using the Message Passing Interface MPI. Each MPI process reads a small piece of the input image into memory. It computes fast marching on its piece. It sends and receives the values from fast marching at piece boundaries. It recalculates fast marching a number of times set from the command line using the new boundary values each time. Each MPI process writes only a small piece of the output file.

A substantial difference is seen when the output of MPI fast marching is compared to the output of serial fast marching. This difference may be acceptable for some uses. The program should be able to handle input images that are too large to fit in the memory of a single computer.
Data
minus 1 Dataset (77Mb)
Code
minus Automatic Testing Results by Insight-Journal Dashboard on Mon Nov 23 14:55:06 2009 for revision #1
starstarstarstarstar expertise: 5 sensitivity: 5
yellow CMake was unable to configure this project.
Click here for more details.

Go here to access the main testing dashboard.

Reviews
There is no review at this time. Be the first to review this publication!

Statistics
backyellow
Global rating: starstarstarstarstar
Review rating: starstarstarstarstar [review]
Code rating: starstarstarstarstar
Views: 926
Downloads: 486

Send a message to the author

Information
backyellow
Paper Id: 704
Categories: Distributed computation, Level sets
Keywords: MPI, Fast Marching, Distributed Memory, Parallel,
Toolkit: CMake, ITK, VTK
Revision: 1 (11-23-2009)
Status: Open for public review
View license
Loading license...

Data
backyellow
Full download: .zip
Paper: view, .pdf
Source code : Download

Share
backyellow
Facebook Digg delicious StumbleUpon dzone Furl Technorati Reddit

Associated Publications
backyellow
Optimizing ITK’s Registration Methods for Multi-processor, Shared-Memory Systems
Carotid Lumen Segmentation Based on Tubular Anisotropy and Contours Without Edges

main_flat
main_bottom
Powered by Midas