Anisotropic Fast Marching in ITK
No opinion
The Fast Marching algorithm is an efficient numerical method for computing the distance and shortest path between points of a domain. For that purpose, it solves a front propagation problem, which can be of interest in itself. The method has numerous [...]

An Implementation of Parallel Fast Marching Using the Message Passing Interface
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 It produces as output an image whose values are the times [...]

Geodesic Computations on Surfaces
The computation of geodesic distances on a triangle mesh has many applications in geometry processing. The fast marching method provides an approximation of the true geodesic distance field. We provide VTK classes to compute geodesics on triangulated surface [...]

Carotid Lumen Segmentation Based on Tubular Anisotropy and Contours Without Edges
No opinion
We present a semi-automatic algorithm for Carotid lumen segmentation on CTA images. Our method is based on a variant of the minimal path method that models the vessel as a centerline and boundary. This is done by adding one dimension for the local radius [...]

Sort results by

Refine the search results



Powered by Midas