In oncological chemotherapy monitoring, the change of a tumor's size is an important criterion for assessing cancer therapeutics. Measuring the volume of a tumor requires its delineation in 3-D. This is called segmentation, which is an intensively studied problem in medical image processing. However, simply counting the voxels within a binary segmentation result can lead to significant differences in the volume, if the lesion has been segmented slightly differently by various segmentation procedures or in different scans, for example due to the limited spatial resolution of computed tomography (CT) or partial volume effects. This variability limits the sensitivity of size measurements and thus of therapy response assessments and it can even lead to misclassifications. We present a fast, generic algorithm for measuring the volume of solid, compact tumors in CT that considers partial volume effects at the border of a given segmentation result. The algorithm is an extension of the segmentation-based partial volume analysis proposed by Kuhnigk for the volumetry of solid lung lesions , such that it can be applied to inhomogeneous lesions and lesions with inhomogeneous surroundings. Our generalized segmentation-based partial volume correction is based on a spatial subdivision of the segmentation result, from which the fraction of tumor for each voxel is computed. It has been evaluated on phantom data, 1516 lesion segmentation pairs (lung nodules, liver metastases and lymph nodes) as well as 1851 lung nodules from the LIDC-IDRI database. The evaluations of our algorithm show a more accurate estimation of the real volume and its ability to reduce inter- and intra-observer variability significantly for each entity. Overall, the variability (interquartile range) for phantom data is reduced by 49% ( p ≪ 0.001) and the variability between different readers is reduced by 28% ( p ≪ 0.001). The average computation time is 0.2 s.

Abstract In the past years sophisticated automatic segmentation algorithms for various medical image segmentation problems have been developed. However, there are always cases where automatic algorithms fail to provide an acceptable segmentation. In these cases the user needs efficient segmentation editing tools, a problem which has not received much attention in research. We give a comprehensive overview on segmentation editing for three‐dimensional (3D) medical images. For segmentation editing in two‐dimensional (2D) images, we discuss a sketch‐based approach where the user modifies the segmentation in the contour domain. Based on this 2D interface, we present an image‐based as well as an image‐independent method for intuitive and efficient segmentation editing in 3D in the context of tumour segmentation in computed tomography (CT). Our editing tools have been evaluated on a database containing 1226 representative liver metastases, lung nodules and lymph nodes of different shape, size and image quality. In addition, we have performed a qualitative evaluation with radiologists and technical experts, proving the efficiency of our tools.

Abstract In this paper, we present a rapid prototyping framework for GPU‐based volume rendering. Therefore, we propose a dynamic shader pipeline based on the SuperShader concept and illustrate the design decisions. Also, important requirements for the development of our system are presented. In our approach, we break down the rendering shader into areas containing code for different computations, which are defined as freely combinable, modularized shader blocks. Hence, high‐level changes of the rendering configuration result in the implicit modification of the underlying shader pipeline. Furthermore, the prototyping system allows inserting custom shader code between shader blocks of the pipeline at run‐time. A suitable user interface is available within the prototyping environment to allow intuitive modification of the shader pipeline. Thus, appropriate solutions for visualization problems can be interactively developed. We demonstrate the usage and the usefulness of our framework with implementations of dynamic rendering effects for medical applications.

Percutaneous radiofrequency ablation (RFA) is becoming a standard minimally invasive clinical procedure for the treatment of liver tumors. However, planning the applicator placement such that the malignant tissue is completely destroyed, is a demanding task that requires considerable experience. In this work, we present a fast GPU-based real-time approximation of the ablation zone incorporating the cooling effect of liver vessels. Weighted distance fields of varying RF applicator types are derived from complex numerical simulations to allow a fast estimation of the ablation zone. Furthermore, the heat-sink effect of the cooling blood flow close to the applicator's electrode is estimated by means of a preprocessed thermal equilibrium representation of the liver parenchyma and blood vessels. Utilizing the graphics card, the weighted distance field incorporating the cooling blood flow is calculated using a modular shader framework, which facilitates the real-time visualization of the ablation zone in projected slice views and in volume rendering. The proposed methods are integrated in our software assistant prototype for planning RFA therapy. The software allows the physician to interactively place virtual RF applicator models. The real-time visualization of the corresponding approximated ablation zone facilitates interactive evaluation of the tumor coverage in order to optimize the applicator's placement such that all cancer cells are destroyed by the ablation.

In this paper, a fast and robust graph-based approach for boundary estimation of fiber bundles derived from Diffusion Tensor Imaging (DTI) is presented. DTI is a non-invasive imaging technique that allows the estimation of the location of white matter tracts based on measurements of water diffusion properties. Depending on DTI data, the fiber bundle boundary can be determined to gain information about eloquent structures, which is of major interest for neurosurgery. DTI in combination with tracking algorithms allows the estimation of position and course of fiber tracts in the human brain. The presented method uses these tracking results as the starting point for a graph-based approach. The overall method starts by computing the fiber bundle centerline between two user-defined regions of interests (ROIs). This centerline determines the planes that are used for creating a directed graph. Then, the mincut of the graph is calculated, creating an optimal boundary of the fiber bundle.

BACKGROUND: Quantification of different types of cells is often needed for analysis of histological images. In our project, we compute the relative number of proliferating hepatocytes for the evaluation of the regeneration process after partial hepatectomy in normal rat livers. RESULTS: Our presented automatic approach for hepatocyte (HC) quantification is suitable for the analysis of an entire digitized histological section given in form of a series of images. It is the main part of an automatic hepatocyte quantification tool that allows for the computation of the ratio between the number of proliferating HC-nuclei and the total number of all HC-nuclei for a series of images in one processing run. The processing pipeline allows us to obtain desired and valuable results for a wide range of images with different properties without additional parameter adjustment. Comparing the obtained segmentation results with a manually retrieved segmentation mask which is considered to be the ground truth, we achieve results with sensitivity above 90% and false positive fraction below 15%. CONCLUSIONS: The proposed automatic procedure gives results with high sensitivity and low false positive fraction and can be applied to process entire stained sections.

We describe a pipeline of image processing steps for deriving symbolic models of vascular structures from radiological data which reflect the branching pattern and diameter of vessels. For the visualization of these symbolic models, concatenated truncated cones are smoothly blended at branching points. We put emphasis on the quality of the visualizations which is achieved by anti-aliasing operations in different stages of the visualization. The methods presented are referred to as HQVV (high quality vessel visualization). Scalable techniques are provided to explore vascular structures of different orders of magnitude. The hierarchy as well as the diameter of the branches of vascular systems are used to restrict visualizations to relevant subtrees and to emphasize parts of vascular systems. Our research is inspired by clear visualizations in textbooks and is targeted toward medical education and therapy planning. We describe the application of vessel visualization techniques for liver surgery planning. For this application it is crucial to recognize the morphology and branching pattern of vascular systems as well as the basic spatial relations between vessels and other anatomic structures.