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 [...]

Graph Cuts, <i>Caveat Utilitor</i>, and Euler's Bridges of Konigsberg
Graph-based algorithms have enjoyed renewed interest for solving computer vision problems. These algorithms have been the subject of intense interest and research. In order to maintain the ITK library au courant, we developed a framework for graph-based [...]

Sort results by

Refine the search results



Powered by Midas