Implementation of weighted Dijkstra’s shortest-path algorithm for n-D images
No opinion
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 [...]

Implementation of graph-based interactive 3D vessel segmentation filter
This paper describes an ITK implementation of a 3D vascular segmentation filter using a graph-based energy minimization algorithm. The method first computes the shortest path between two user provided points in the vessel and then performs a graph min-cut [...]

Nearly automatic vessels segmentation using graph-based energy minimization
No opinion
We present a nearly automatic tool for the accurate segmentation of vascular structures in volumetric CTA images. Its inputs are a start and an end seed points inside the vessel. The two-step graph-based energy minimization method starts by computing the [...]

Carotid Lumen Segmentation and Stenosis Grading Challenge
No opinion
This paper describes the Carotid Lumen Segmentation and Stenosis Grading Challenge, which was part of the workshop ``3D Segmentation in the Clinic: A Grand Challenge''. This workshop was part of the 12th conference on Medical Image Computing and Computer [...]

Sort results by

Refine the search results



Powered by Midas